Subhasree Patro
Subhasree Patro
QuSoft, Centrum Wiskunde and Informatica
Verified email at - Homepage
Cited by
Cited by
A framework of quantum strong exponential-time hypotheses
H Buhrman, S Patro, F Speelman
38th international symposium on theoretical aspects of computer science …, 2021
Non-negativity of conditional von Neumann entropy and global unitary operations
S Patro, I Chakrabarty, N Ganguly
Physical Review A 96 (6), 062102, 2017
Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks
H Buhrman, B Loff, S Patro, F Speelman
arXiv preprint arXiv:2106.02005, 2021
Impossibility of cloning of quantum coherence
D Patel, S Patro, C Vanarasa, I Chakrabarty, AK Pati
Physical Review A 103 (2), 022422, 2021
Memory compression with quantum random-access gates
H Buhrman, B Loff, S Patro, F Speelman
arXiv preprint arXiv:2203.05599, 2022
An overview of quantum algorithms: From quantum supremacy to shor factorization
S Patro, A Piedrafita
2020 IEEE International Symposium on Circuits and Systems (ISCAS), 1-5, 2020
Teleportation of quantum coherence
Sohail, AK Pati, V Aradhya, I Chakrabarty, S Patro
Physical Review A 108 (4), 042620, 2023
Improved quantum query upper bounds based on classical decision trees
A Cornelissen, NS Mande, S Patro
arXiv preprint arXiv:2203.02968, 2022
Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture
A Ambainis, H Buhrman, K Leijnse, S Patro, F Speelman
arXiv preprint arXiv:2207.11068, 2022
QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more
Y Chen, Y Chen, R Kumar, S Patro, F Speelman
arXiv preprint arXiv:2309.16431, 2023
Quantum fine-grained complexity
S Patro
Institute for Logic, Language and Computation, 2023
A few limits to Quantum Information Theory
S Patro
International Institute of Information Technology Hyderabad, 2018
The system can't perform the operation now. Try again later.
Articles 1–12