Preparation and verification of tensor network states
arXiv:2105.06866 · doi:10.1103/PhysRevResearch.4.023161
Abstract
We consider a family of tensor network states defined on regular lattices that come with a natural definition of an adiabatic path to prepare them. This family comprises relevant classes of states, such as injective Matrix Product and Projected Entangled-Pair States, and some corresponding to classical spin models. We show how uniform lower bounds to the gap of the parent Hamiltonian along the adiabatic trajectory can be efficiently computed using semi-definite programming. This allows one to check whether the adiabatic preparation can be performed efficiently with a scalable effort. We also derive a set of observables whose expectation values can be easily determined and that form a complete set, in the sense that they uniquely characterize the state. We identify a subset of those observables which can be efficiently computed if one has access to the quantum state and local measurements, and analyze how they can be used in verification procedures.
arXiv comment22 pages (12 + appendices), 4 figures
References in corpus (52)
- Fault-tolerant quantum computation by anyons
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Persistent entanglement in arrays of interacting particles
- Adiabatic Quantum Computing
- Characterizing Quantum Supremacy in Near-Term Devices
- 14-qubit entanglement: creation and coherence
- Multi-party entanglement in graph states
- Observation of three-photon Greenberger-Horne-Zeilinger entanglement
- Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
- Efficient quantum state tomography
- Generation and manipulation of Schrödinger cat states in Rydberg atom arrays
- Criticality, the area law, and the computational power of PEPS
- Preparation and Measurement of Three-Qubit Entanglement in a Superconducting Circuit
- Experimental Four-photon Entanglement and High-fidelity Teleportation
- 18-qubit entanglement with photon's three degrees of freedom
- 10-qubit entanglement and parallel logic operations with a superconducting circuit
- 12-photon entanglement and scalable scattershot boson sampling with optimal entangled-photon pairs from parametric down-conversion
- Deterministic Generation of a Cluster State of Entangled Photons
- Bounds for the adiabatic approximation with applications to quantum computation
- A compact ion-trap quantum computing demonstrator
- Observation of multi-component atomic Schrödinger cat states of up to 20 qubits
- Self-testing of quantum systems: a review
- Observation of Entangled States of a Fully Controlled 20-Qubit System
- Valence Bond Solids for Quantum Computation
- The computational complexity of PEPS
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Average-case complexity versus approximate simulation of commuting quantum computations
- Hamiltonian Learning and Certification Using Quantum Resources
- Genuine 12-qubit entanglement on a superconducting quantum processor
- Photonic tensor networks produced by a single quantum emitter
- Quantum Overlapping Tomography
- NMR GHZ
- Sequential Generation of Matrix-Product States in Cavity QED
- Sequential generation of linear cluster states from a single photon emitter
- A quantum version of Wielandt's inequality
- Architectures for quantum simulation showing a quantum speedup
- Interactive Proofs For Quantum Computations
- Simulating adiabatic evolution of gapped spin systems
- Post hoc verification of quantum computation
- Post hoc verification with a single prover
- Hierarchy of universal entanglement in 2D measurement-based quantum computation
- Quantum Hamiltonian Learning Using Imperfect Quantum Resources
- Realizing a Deterministic Source of Multipartite-Entangled Photonic Qubits
- Deterministic generation of large-scale entangled photonic cluster state from interacting solid state emitters
- On-demand photonic entanglement synthesizer
- Rapid adiabatic preparation of injective PEPS and Gibbs states
- Direct certification of a class of quantum simulations
- Sequentially generated states for the study of two dimensional systems
- Contracting projected entangled pair states is average-case hard
- Quantum Bootstrapping via Compressed Quantum Hamiltonian Learning
- QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
- Divide and conquer method for proving gaps of frustration free Hamiltonians
Cited by in corpus (7)
- Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers
- Efficient verification of Affleck-Kennedy-Lieb-Tasaki states
- Efficient Verification of Ground States of Frustration-Free Hamiltonians
- Variational adiabatic transport of tensor networks
- Efficient Quantum Circuits based on the Quantum Natural Gradient
- Spectral Gap Optimization for Enhanced Adiabatic State Preparation
- A Hierarchy of Spectral Gap Certificates for Frustration-Free Spin Systems