research
∙
08/14/2023
Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates II: Single-Copy Measurements
Recent work has shown that n-qubit quantum states output by circuits wit...
share
research
∙
05/22/2023
Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates
We give an algorithm that efficiently learns a quantum state prepared by...
research
∙
04/27/2023
Improved Stabilizer Estimation via Bell Difference Sampling
We study the complexity of learning quantum states in various models wit...
research
∙
02/25/2023
Two-Disk Compound Symmetry Groups
Symmetry is at the heart of much of mathematics, physics, and art. Tradi...
research
∙
02/20/2023
A Qubit, a Coin, and an Advice String Walk Into a Relational Problem
Relational problems (those with many possible valid outputs) are differe...
research
∙
12/29/2022
Quantum Mass Production Theorems
We prove that for any n-qubit unitary transformation U and for any r = 2...
research
∙
12/01/2022
Quantum Cryptography in Algorithmica
We construct a classical oracle relative to which 𝖯 = 𝖭𝖯 yet single-copy...
research
∙
09/29/2022
Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
We show that quantum states with "low stabilizer complexity" can be effi...
research
∙
11/19/2021
The Acrobatics of BQP
One can fix the randomness used by a randomized algorithm, but there is ...
research
∙
03/16/2021
Quantum Pseudorandomness and Classical Complexity
We construct a quantum oracle relative to which 𝖡𝖰𝖯 = 𝖰𝖬𝖠 but cryptograp...
research
∙
08/20/2020
The Quantum Supremacy Tsirelson Inequality
A leading proposal for verifying near-term quantum supremacy experiments...
research
∙
06/23/2020
Symmetries, graph properties, and quantum speedups
Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symm...
research
∙
07/15/2019
Lower Bounding the AND-OR Tree via Symmetrization
We prove a nearly tight lower bound on the approximate degree of the two...
research
∙
04/18/2019
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials
This paper proves new limitations on the power of quantum computers to s...
research
∙
02/06/2019
QMA Lower Bounds for Approximate Counting
We prove a query complexity lower bound for QMA protocols that solve app...
research
∙
06/10/2016