| A framework of quantum strong exponential-time hypotheses H Buhrman, S Patro, F Speelman 38th international symposium on theoretical aspects of computer science …, 2021 | 45* | 2021 |
| Non-negativity of conditional von Neumann entropy and global unitary operations S Patro, I Chakrabarty, N Ganguly arXiv preprint arXiv:1703.01059, 2017 | 31 | 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 | 21 | 2021 |
| Teleportation of quantum coherence Sohail, AK Pati, V Aradhya, I Chakrabarty, S Patro Physical Review A 108 (4), 042620, 2023 | 15 | 2023 |
| Memory compression with quantum random-access gates H Buhrman, B Loff, S Patro, F Speelman arXiv preprint arXiv:2203.05599, 2022 | 15 | 2022 |
| Impossibility of cloning of quantum coherence D Patel, S Patro, C Vanarasa, I Chakrabarty, AK Pati Physical Review A 103 (2), 022422, 2021 | 11 | 2021 |
| Improved quantum query upper bounds based on classical decision trees A Cornelissen, NS Mande, S Patro Quantum 9, 1777, 2025 | 10 | 2025 |
| 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 | 9 | 2020 |
| 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 | 6 | 2023 |
| Oracle Separations for RPH T Hamm, L Meijer, T Miltzow, S Patro arXiv preprint arXiv:2502.09279, 2025 | 3 | 2025 |
| 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 | 2 | 2022 |
| 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) P Bürgisser, P Ossona de Mendez, L Tendera, D Aggarwal, Y Chen, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2021 | 2 | 2021 |
| Fine-Grained Complexity via Quantum Natural Proofs Y Chen, Y Chen, R Kumar, S Patro, F Speelman arXiv preprint arXiv:2504.10363, 2025 | 1 | 2025 |
| Quantum sabotage complexity A Cornelissen, NS Mande, S Patro arXiv preprint arXiv:2408.12595, 2024 | 1 | 2024 |
| Quantum fine-grained complexity S Patro University of Amsterdam, 2023 | 1 | 2023 |
| Quantum Search With Generalized Wildcards A Cornelissen, NS Mande, S Patro, N Raja, S Sanyal arXiv preprint arXiv:2511.04669, 2025 | | 2025 |
| 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 |
| A few limits to Quantum Information Theory S Patro International Institute of Information Technology Hyderabad, 2018 | | 2018 |
Florian SpeelmanUniversity of Amsterdam, QuSoftVerified email at uva.nl
