Closing Gaps of a Quantum Advantage with Short-Time Hamiltonian Dynamics.

  title={Closing Gaps of a Quantum Advantage with Short-Time Hamiltonian Dynamics.},
  author={Jonas Haferkamp and Dominik Hangleiter and Adam Bouland and Bill Fefferman and Jens Eisert and Juan Bermejo-Vega},
  journal={Physical review letters},
  volume={125 25},
Demonstrating a quantum computational speed-up is a crucial milestone for near-term quantum technology. Recently, sampling protocols for quantum simulators have been proposed that have the potential to show such a quantum advantage, based on commonly made assumptions. The key challenge in the theoretical analysis of this scheme-as of other comparable schemes such as boson sampling-is to lessen the assumptions and close the theoretical loopholes, replacing them by rigorous arguments. In this… Expand

Figures from this paper

Improved spectral gaps for random quantum circuits: Large local dimensions and all-to-all interactions
Random quantum circuits are a central concept in quantum information theory with applications ranging from demonstrations of quantum computational advantage to descriptions of scrambling inExpand
Exploring Quantum Computation Through the Lens of Classical Simulation
This project looks at the problem of classically simulating quantum circuits through decompositions into stabilizer circuits, a restricted class of quantum computation which can be efficiently simulated classically. Expand
Exact emergent quantum state designs from quantum chaotic dynamics
We present exact results on a novel kind of emergent random matrix universality that quantum many-body systems at infinite temperature can exhibit. Specifically, we consider an ensemble of pureExpand
Random quantum circuits anti-concentrate in log depth.
We consider quantum circuits consisting of randomly chosen two-local gates and study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to beExpand
Emergent Randomness and Benchmarking from Many-Body Quantum Chaos.
Chaotic quantum many-body dynamics typically lead to relaxation of local observables. In this process, known as quantum thermalization, a subregion reaches a thermal state due to quantum correlationsExpand
On Unitary t-Designs from Relaxed Seeds
This work reduces the requirements for generating an ε-approximate unitary t-design efficiently and conjecture that constant sized seeds such as those which are usually present in the literature are sufficient, thereby overcoming the two requirements which limited previous constructions. Expand
A game of quantum advantage: linking verification and simulation
A formalism is presented that captures the process of proving quantum superiority to skeptics as an interactive game between two agents, supervised by a referee, and establishes three results, including that exponential resources may be unavoidable for even the most basic verification tasks in the setting of random quantum circuits. Expand
Efficient Construction of Quantum Physical Unclonable Functions with Unitary t-designs
Quantum physical unclonable functions, or QPUFs, are rapidly emerging as theoretical hardware solutions to provide secure cryptographic functionalities such as key-exchange, message authentication,Expand
A Quantum Hamiltonian Simulation Benchmark
Yulong Dong, K. Birgitta Whaley, and Lin Lin3,4,5∗ Berkeley Center for Quantum Information and Computation, Berkeley, California 94720 USA Department of Chemistry, University of California, Berkeley,Expand
Polynomial speedup in Torontonian calculation by a scalable recursive algorithm
Evaluating the Torontonian function is a central computational challenge in the simulation of Gaussian Boson Sampling (GBS) with threshold detection. In this work, we propose a recursive algorithmExpand


Architectures for quantum simulation showing a quantum speedup
This work shows that benchmark settings exhibiting a quantum speedup may require little control in contrast to universal quantum computing, and proposes versatile and feasible schemes of two-dimensional dynamical quantum simulators showing such a quantumSpeedup. Expand
Anticoncentration theorems for schemes showing a quantum speedup
One of the main milestones in quantum information science is to realise quantum devices that exhibit an exponential computational advantage over classical ones without being universal quantumExpand
Characterizing quantum supremacy in near-term devices
A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities ofExpand
On the complexity and verification of quantum random circuit sampling
A critical milestone on the path to useful quantum computers is the demonstration of a quantum computation that is prohibitively hard for classical computers—a task referred to as quantum supremacy.Expand
Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resourceExpand
Efficient Quantum Pseudorandomness.
This work shows that random quantum unitary time evolutions ("circuits") are a powerful source of quantum pseudorandomness, and gives for the first time a polynomial-time construction of quantum unitARY designs, which can replace fully random operations in most applications. Expand
Achieving quantum supremacy with sparse and noisy commuting quantum computations
The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. HereExpand
Local Random Quantum Circuits are Approximate Polynomial-Designs
We prove that local random quantum circuits acting on n qubits composed of O(t10n2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whetherExpand
Quantum Supremacy and the Complexity of Random Circuit Sampling
This paper shows complexity theoretic evidence of hardness that is on par with the strongest theoretical proposals for supremacy, and shows that RCS satisfies an average-case hardness condition - computing output probabilities of typical quantum circuits is as hard as computing them in the worst-case, and therefore #P-hard. Expand
Recovering quantum gates from few average gate fidelities
This Letter provides a rigorously guaranteed and practical reconstruction method that works with an essentially optimal number of average gate fidelities measured with respect to random Clifford unitaries for characterizing multiqubit unitary gates. Expand