Subhasree Patro

18 papers A 3C 1Journal 11Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Fine-Grained Complexity via Quantum Natural Proofs.
CoRR
Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman
2025 J jnl
Improved Quantum Query Upper Bounds Based on Classical Decision Trees.
Quantum
Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro
2025 J jnl
Oracle Separations for RPH.
CoRR
Thekla Hamm, Lucas Meijer, Tillmann Miltzow, Subhasree Patro
2025 A conf
QSETH Strikes Again: Finer Quantum Lower Bounds for Lattice Problem, Strong Simulation, Hitting Set Problem, and More.
APPROX/RANDOM
Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman
2025 J jnl
Quantum Search With Generalized Wildcards.
CoRR
Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro, Nithish Raja, Swagato Sanyal
2024 — conf
Quantum Sabotage Complexity.
FSTTCS
Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro
2024 J jnl
Quantum Sabotage Complexity.
CoRR
Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro
2023 J jnl
QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more.
CoRR
Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman
2022 — conf
Improved Quantum Query Upper Bounds Based on Classical Decision Trees.
FSTTCS
Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro
2022 J jnl
Improved Quantum Query Upper Bounds Based on Classical Decision Trees.
CoRR
Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro
2022 A conf
Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks.
ITCS
Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman
2022 J jnl
Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture.
CoRR
Andris Ambainis, Harry Buhrman, Koen Leijnse, Subhasree Patro, Florian Speelman
2022 — conf
Memory Compression with Quantum Random-Access Gates.
TQC
Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman
2022 J jnl
Memory Compression with Quantum Random-Access Gates.
CoRR
Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman
2021 A conf
A Framework of Quantum Strong Exponential-Time Hypotheses.
STACS
Harry Buhrman, Subhasree Patro, Florian Speelman
2021 J jnl
Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks.
CoRR
Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman
2020 C conf
An Overview of Quantum Algorithms: From Quantum Supremacy to Shor Factorization.
ISCAS
Subhasree Patro, Alvaro Piedrafita
2019 J jnl
The Quantum Strong Exponential-Time Hypothesis.
CoRR
Harry Buhrman, Subhasree Patro, Florian Speelman