Priyanka Mukhopadhyay
Priyanka Mukhopadhyay
Post-doctoral fellow
Verified email at
Cited by
Cited by
A survey of Hough Transform
P Mukhopadhyay, BB Chaudhuri
Pattern Recognition 48 (3), 993-1010, 2015
Lifting randomized query complexity to randomized communication complexity.
A Anshu, NB Goud, R Jain, S Kundu, P Mukhopadhyay
Electron. Colloquium Comput. Complex. 24, 54, 2017
Reducing the CNOT count for Clifford+ T circuits on NISQ architectures
V Gheorghiu, SM Li, M Mosca, P Mukhopadhyay
arXiv preprint arXiv:2011.12191, 2020
A polynomial time and space heuristic algorithm for T-count
M Mosca, P Mukhopadhyay
Quantum Science and Technology 7 (1), 015003, 2021
A composition theorem for randomized query complexity
A Anshu, D Gavinsky, R Jain, S Kundu, T Lee, P Mukhopadhyay, ...
arXiv preprint arXiv:1706.00335, 2017
New one shot quantum protocols with application to communication complexity
A Anshu, R Jain, P Mukhopadhyay, A Shayeghi, P Yao
IEEE Transactions on Information Theory 62 (12), 7566-7577, 2016
Improved algorithms for the Shortest Vector Problem and the Closest Vector Problem in the infinity norm
D Aggarwal, P Mukhopadhyay
arXiv preprint arXiv:1801.02358, 2018
A new operational interpretation of relative entropy and trace distance between quantum states
A Anshu, R Jain, P Mukhopadhyay, A Shayeghi, P Yao
arXiv preprint arXiv:1404.1366, 2014
Faster provable sieving algorithms for the shortest vector problem and the closest vector problem on lattices in ℓp norm
P Mukhopadhyay
Algorithms 14 (12), 362, 2021
T-count and T-depth of any multi-qubit unitary
V Gheorghiu, M Mosca, P Mukhopadhyay
arXiv preprint arXiv:2110.10292, 2021
Error tracing in linear and concatenated quantum circuits
R Majumdar, S Basu, P Mukhopadhyay, S Sur-Kolay
arXiv preprint arXiv:1612.08044, 2016
A (quasi-) polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
V Gheorghiu, M Mosca, P Mukhopadhyay
npj Quantum Information 8 (1), 1-11, 2022
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems
P Mukhopadhyay
Journal of Computer and System Sciences 123, 186-201, 2022
Adaptive estimation of quantum observables
A Shlosberg, AJ Jena, P Mukhopadhyay, JF Haase, F Leditzky, ...
arXiv preprint arXiv:2110.15339, 2021
Composability of global phase invariant distance and its application to approximation error management
P Mukhopadhyay
Journal of Physics Communications 5 (11), 115017, 2021
Faster algorithms for SVP and CVP in the l∞ norm
D Aggarwal, P Mukhopadhyay
arXiv preprint arXiv:1801.02358, 2018
Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
P Mukhopadhyay, Y Qiao
computational complexity 26 (4), 881-909, 2017
Quantum computing
P Mukhopadhyay
Indian Statistical Institute, Kolkata, 2013
Synthesizing efficient circuits for Hamiltonian simulation
P Mukhopadhyay, N Wiebe, HT Zhang
arXiv preprint arXiv:2209.03478, 2022
System and Method for Reducing CNOT Count in Clifford+ T Circuits on Connectivity Constrained Architectures
M Mosca, P Mukhopadhyay, V Gheorghiu
US Patent App. 17/532,273, 2022
The system can't perform the operation now. Try again later.
Articles 1–20