Quantum advantage from energy measurements of many-body quantum systems
arXiv:1912.06608 · doi:10.22331/q-2021-06-02-465
Abstract
The problem of sampling outputs of quantum circuits has been proposed as a candidate for demonstrating a quantum computational advantage (sometimes referred to as quantum "supremacy"). In this work, we investigate whether quantum advantage demonstrations can be achieved for more physically-motivated sampling problems, related to measurements of physical observables. We focus on the problem of sampling the outcomes of an energy measurement, performed on a simple-to-prepare product quantum state -- a problem we refer to as energy sampling. For different regimes of measurement resolution and measurement errors, we provide complexity theoretic arguments showing that the existence of efficient classical algorithms for energy sampling is unlikely. In particular, we describe a family of Hamiltonians with nearest-neighbour interactions on a 2D lattice that can be efficiently measured with high resolution using a quantum circuit of commuting gates (IQP circuit), whereas an efficient classical simulation of this process should be impossible. In this high resolution regime, which can only be achieved for Hamiltonians that can be exponentially fast-forwarded, it is possible to use current theoretical tools tying quantum advantage statements to a polynomial-hierarchy collapse whereas for lower resolution measurements such arguments fail. Nevertheless, we show that efficient classical algorithms for low-resolution energy sampling can still be ruled out if we assume that quantum computers are strictly more powerful than classical ones. We believe our work brings a new perspective to the problem of demonstrating quantum advantage and leads to interesting new questions in Hamiltonian complexity.
arXiv commentComments are welcome
References in corpus (64)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Probing many-body dynamics on a 51-atom quantum simulator
- Persistent entanglement in arrays of interacting particles
- Strengths and Weaknesses of Quantum Computing
- Characterizing Quantum Supremacy in Near-Term Devices
- Measuring entanglement entropy through the interference of quantum many-body twins
- Quantum thermalization through entanglement in an isolated many-body system
- Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator
- Probing the relaxation towards equilibrium in an isolated strongly correlated 1D Bose gas
- Exploring the many-body localization transition in two dimensions
- Hamiltonian Simulation by Qubitization
- Quantum Computational Supremacy
- A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Measuring out-of-time-order correlations and multiple quantum spectra in a trapped ion quantum magnet
- Probing entanglement entropy via randomized measurements
- Quantum Kibble-Zurek mechanism and critical dynamics on a programmable Rydberg simulator
- Gaussian Boson Sampling
- Spectral signatures of many-body localization with interacting photons
- A blueprint for demonstrating quantum supremacy with superconducting qubits
- Hamiltonian simulation with nearly optimal dependence on all parameters
- Simulating Physical Phenomena by Quantum Networks
- Observation of Entangled States of a Fully Controlled 20-Qubit System
- Boson Sampling for Molecular Vibronic Spectra
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Average-case complexity versus approximate simulation of commuting quantum computations
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Unconditionally verifiable blind computation
- Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
- A quantum-inspired classical algorithm for recommendation systems
- Quantum critical behavior at the many-body-localization transition
- Emergence of coherence and the dynamics of quantum phase transitions
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- Instantaneous Quantum Computation
- Quantum Hamiltonian Complexity
- Probing scrambling using statistical correlations between randomized measurements
- Universal Quantum Hamiltonians
- Architectures for quantum simulation showing a quantum speedup
- On the hardness of classically simulating the one clean qubit model
- Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
- Post hoc verification with a single prover
- Post hoc verification of quantum computation
- Fast-forwarding of Hamiltonians and Exponentially Precise Measurements
- Quantum search by measurement
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
- Novikov's Conjecture
- Direct certification of a class of quantum simulations
- Quantum circuit complexity of one-dimensional topological phases
- Measuring Energy, Estimating Hamiltonians, and the Time-Energy Uncertainty Relation
- Anticoncentration theorems for schemes showing a quantum speedup
- Dynamical phase transitions in sampling complexity
- From estimation of quantum probabilities to simulation of quantum circuits
- Hardness of classically sampling one clean qubit model with constant total variation distance error
- Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction
- Sample complexity of device-independently certified "quantum supremacy"
- Closing gaps of a quantum advantage with short-time Hamiltonian dynamics
- The Feynman-Kitaev computer's clock: bias, gaps, idling and pulse tuning
- Quantum Non-demolition Measurement of a Many-Body Hamiltonian
- Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
- Quantum computational supremacy in the sampling of bosonic random walkers on a one-dimensional lattice
- Quantum simulation of partially distinguishable boson sampling
- A single-shot measurement of the energy of product states in a translation invariant spin chain can replace any quantum computation
Cited by in corpus (6)
- Computational advantage of quantum random sampling
- Mesoscopic ultrafast nonlinear optics -- The emergence of multimode quantum non-Gaussian physics
- Importance of the spectral gap in estimating ground-state energies
- Quantum computational advantage with constant-temperature Gibbs sampling
- Dynamics of single-mode nonclassicalities and quantum correlations in the Jaynes-Cummings model
- Quantum advantage in temporally flat measurement-based quantum computation