The Quantum Strong Exponential-Time Hypothesis. - Harry Buhrman; Subhasree Patro; Florian Speelman (CoRR, 2019)

An Overview of Quantum Algorithms: From Quantum Supremacy to Shor Factorization. - Subhasree Patro; Alvaro Piedrafita (ISCAS, 2020)

A Framework of Quantum Strong Exponential-Time Hypotheses. - Harry Buhrman; Subhasree Patro; Florian Speelman (STACS, 2021)

Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks. - Harry Buhrman; Bruno Loff; Subhasree Patro; Florian Speelman (ITCS, 2022)

Memory Compression with Quantum Random-Access Gates. - Harry Buhrman; Bruno Loff; Subhasree Patro; Florian Speelman (TQC, 2022)

Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture. - Andris Ambainis; Harry Buhrman; Koen Leijnse; Subhasree Patro; Florian Speelman (CoRR, 2022)

QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more. - Yanlin Chen; Yilei Chen; Rajendra Kumar 002; Subhasree Patro; Florian Speelman (CoRR, 2023)

Quantum Sabotage Complexity. - Arjan Cornelissen; Nikhil S. Mande; Subhasree Patro (FSTTCS, 2024)

Improved Quantum Query Upper Bounds Based on Classical Decision Trees. - Arjan Cornelissen; Nikhil S. Mande; Subhasree Patro (Quantum, 2025)

Oracle Separations for RPH. - Thekla Hamm; Lucas Meijer; Tillmann Miltzow; Subhasree Patro (CoRR, 2025)

Fine-Grained Complexity via Quantum Natural Proofs. - Yanlin Chen; Yilei Chen; Rajendra Kumar 002; Subhasree Patro; Florian Speelman (CoRR, 2025)