research
∙
01/10/2023
Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling
We give a quantum algorithm for computing an ϵ-approximate Nash equilibr...
share
research
∙
11/01/2022
Quantum Pseudoentanglement
Quantum pseudorandom states are efficiently constructable states which n...
research
∙
12/03/2021
Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm
The Solovay-Kitaev algorithm is a fundamental result in quantum computat...
research
∙
02/02/2021
Noise and the frontier of quantum supremacy
Noise is the defining feature of the NISQ era, but it remains unclear if...
research
∙
10/31/2019
Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality
A fundamental issue in the AdS/CFT correspondence is the wormhole growth...
research
∙
07/17/2018
Classical lower bounds from quantum upper bounds
We prove lower bounds on complexity measures, such as the approximate de...
research
∙
03/12/2018
Quantum Supremacy and the Complexity of Random Circuit Sampling
A critical milestone on the path to useful quantum computers is quantum ...
research
∙
09/06/2017
