Direct certification of a class of quantum simulations
arXiv:1602.00703 · doi:10.1088/2058-9565/2/1/015004
Abstract
One of the main challenges in the field of quantum simulation and computation is to identify ways to certify the correct functioning of a device when a classical efficient simulation is not available. Important cases are situations in which one cannot classically calculate local expectation values of state preparations efficiently. In this work, we develop weak-membership formulations of the certification of ground state preparations. We provide a non-interactive protocol for certifying ground states of frustration-free Hamiltonians based on simple energy measurements of local Hamiltonian terms. This certification protocol can be applied to classically intractable analog quantum simulations: For example, using Feynman-Kitaev Hamiltonians, one can encode universal quantum computation in such ground states. Moreover, our certification protocol is applicable to ground states encodings of IQP circuits demonstration of quantum supremacy. These can be certified efficiently when the error is polynomially bounded.
10 pages, corrected a small error in Eqs. (2) and (5)
References in corpus (6)
- Multi-party entanglement in graph states
- Efficient quantum state tomography
- Bounds for the adiabatic approximation with applications to quantum computation
- Average-case complexity versus approximate simulation of commuting quantum computations
- Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction
- Quantum Bootstrapping via Compressed Quantum Hamiltonian Learning
Cited by in corpus (53)
- Programmable Quantum Simulations of Spin Systems with Trapped Ions
- Quantum certification and benchmarking
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- Quantum Sampling Problems, BosonSampling and Quantum Supremacy
- Verification of quantum computation: An overview of existing approaches
- Computational advantage of quantum random sampling
- Theory of quantum system certification: a tutorial
- Architectures for quantum simulation showing a quantum speedup
- Verification of Many-Qubit States
- Self-guaranteed measurement-based quantum computation
- Single-copy entanglement detection
- Anticoncentration theorems for schemes showing a quantum speedup
- Fidelity witnesses for fermionic quantum simulations
- Sample complexity of device-independently certified "quantum supremacy"
- Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors
- Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
- Optimal Verification of Greenberger-Horne-Zeilinger States
- Optimal verification of stabilizer states
- Quantum simulation of thermodynamics in an integrated quantum photonic processor
- Closing gaps of a quantum advantage with short-time Hamiltonian dynamics
- Accrediting outputs of noisy intermediate-scale quantum computing devices
- Efficient verification of Boson Sampling
- Verification of phased Dicke states
- Verifying commuting quantum computations via fidelity estimation of weighted graph states
- Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
- Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
- Reducing resources for verification of quantum computations
- Effects of gate errors in digital quantum simulations of fermionic systems
- Preparation and verification of tensor network states
- Randomized Benchmarking in the Analogue Setting
- Efficient verification of Affleck-Kennedy-Lieb-Tasaki states
- Nonadaptive fault-tolerant verification of quantum supremacy with noise
- Enhancing quantum state tomography via resource-efficient attention-based neural networks
- Unifying Quantum Verification and Error-Detection: Theory and Tools for Optimisations
- Client-friendly continuous-variable blind and verifiable quantum computing
- Efficient Verification of Ground States of Frustration-Free Hamiltonians
- Continuous-variable ramp quantum secret sharing with Gaussian states and operations
- Efficient verification of bosonic quantum channels via benchmarking
- Hamiltonian and Liouvillian learning in weakly-dissipative quantum many-body systems
- Verifiable measurement-based quantum random sampling with trapped ions
- Reconstructing the ideal results of a perturbed analog quantum simulator
- Quantum advantage from energy measurements of many-body quantum systems
- In situ characterization of linear-optical networks in randomized boson sampling
- Optimal trace-distance bounds for free-fermionic states: Testing and improved tomography
- Estimating the error of an analog quantum simulator by additional measurements
- Methods for Classically Simulating Noisy Networked Quantum Architectures
- Efficiently verifiable quantum advantage on near-term analog quantum simulators
- Passive verification protocol for thermal graph states
- Certification of spin-based quantum simulators
- Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases
- Hardness of efficiently generating ground states in postselected quantum computation
- Detecting entanglement from few partial transpose moments and their decay via weight enumerators
- Accreditation Against Limited Adversarial Noise