Quantum Algorithms and Complexity
List of papers
- On the Pauli Spectrum of QAC0
- Verifiable Quantum Advantage without Structure
- Unitary Complexity and the Uhlmann Transformation Problem
- Unitary property testing lower bounds by polynomials
- The Power of Adaptivity in Quantum Query Algorithms
- Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem
- The status of the quantum PCP conjecture (games version)
- A distribution testing oracle separation between QMA and QCMA
- Commitments to Quantum States
- Triply efficient shadow tomography
- Quartic quantum speedups for planted inference
- Learning quantum Hamiltonians at any temperature in polynomial time
- The 7 faces of quantum NP
- An Efficient Quantum Factoring Algorithm
- Pseudomagic Quantum States
- A survey on the complexity of learning quantum states
- The Complexity of NISQ
- NLTS Hamiltonians from good quantum codes
- How Much Structure Is Needed for Huge Quantum Speedups?
- Quantum Tanner codes