Følg
Subhasree Patro
Subhasree Patro
Eindhoven University of Technology and QuSoft, Centrum Wiskunde and Informatica
Verifisert e-postadresse på tue.nl - Startside
Tittel
Sitert av
Sitert av
År
A framework of quantum strong exponential-time hypotheses
H Buhrman, S Patro, F Speelman
38th international symposium on theoretical aspects of computer science …, 2021
37*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
262017
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
152021
Memory compression with quantum random-access gates
H Buhrman, B Loff, S Patro, F Speelman
arXiv preprint arXiv:2203.05599, 2022
132022
Impossibility of cloning of quantum coherence
D Patel, S Patro, C Vanarasa, I Chakrabarty, AK Pati
Physical Review A 103 (2), 022422, 2021
92021
Teleportation of quantum coherence
Sohail, AK Pati, V Aradhya, I Chakrabarty, S Patro
Physical Review A 108 (4), 042620, 2023
82023
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
72020
Improved quantum query upper bounds based on classical decision trees
A Cornelissen, NS Mande, S Patro
arXiv preprint arXiv:2203.02968, 2022
52022
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
42023
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
22022
Quantum sabotage complexity
A Cornelissen, NS Mande, S Patro
arXiv preprint arXiv:2408.12595, 2024
12024
Oracle Separations for RPH
T Hamm, L Meijer, T Miltzow, S Patro
arXiv preprint arXiv:2502.09279, 2025
2025
Quantum fine-grained complexity
S Patro
University of Amsterdam, 2023
2023
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)
A Gupta, R Santhanam, P Bouyer, M Randour, P Vandenhove, I Dinur, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2022
2022
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
M Bläser, B Monmege
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2021
2021
A few limits to Quantum Information Theory
S Patro
International Institute of Information Technology Hyderabad, 2018
2018
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–16