Product-state approximations to quantum states
From MaRDI portal
Publication:5962905
Abstract: The local Hamiltonian problem consists of estimating the ground-state energy (given by the minimum eigenvalue) of a local quantum Hamiltonian. First, we show the existence of a good product-state approximation for the ground-state energy of 2-local Hamiltonians with one or more of the following properties: (1) high degree, (2) small expansion, or (3) a ground state with sublinear entanglement with respect to some partition into small pieces. The approximation based on degree is a surprising difference between quantum Hamiltonians and classical CSPs (constraint satisfaction problems), since in the classical setting, higher degree is usually associated with harder CSPs. The approximation based on low entanglement, in turn, was previously known only in the regime where the entanglement was close to zero. Since the existence of a low-energy product state can be checked in NP, the result implies that any Hamiltonian used for a quantum PCP theorem should have: (1) constant degree, (2) constant expansion, (3) a "volume law" for entanglement with respect to any partition into small parts. Second, we show that in several cases, good product-state approximations not only exist, but can be found in polynomial time: (1) 2-local Hamiltonians on any planar graph, solving an open problem of Bansal, Bravyi, and Terhal, (2) dense k-local Hamiltonians for any constant k, solving an open problem of Gharibian and Kempe, and (3) 2-local Hamiltonians on graphs with low threshold rank, via a quantum generalization of a recent result of Barak, Raghavendra and Steurer. Our work introduces two new tools which may be of independent interest. First, we prove a new quantum version of the de Finetti theorem which does not require the usual assumption of symmetry. Second, we describe a way to analyze the application of the Lasserre/Parrilo SDP hierarchy to local quantum Hamiltonians.
Recommendations
- Product-state approximations to quantum ground states
- scientific article; zbMATH DE number 7651034
- Approximation algorithms for QMA-complete problems
- Approximation algorithms for quantum many-body problems
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
Cites work
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- scientific article; zbMATH DE number 1789920 (Why is no real title available?)
- scientific article; zbMATH DE number 1456191 (Why is no real title available?)
- A Parallel Repetition Theorem
- A de Finetti representation for finite symmetric quantum states
- A simple proof of monogamy of entanglement
- An application of Bell's inequalities to a quantum state extension problem
- Approximating CSPs with global cardinality constraints using SDP hierarchies
- Approximation algorithms for QMA-complete problems
- Area laws in quantum systems: mutual information and correlations
- Colloquium: area laws for the entanglement entropy
- Commutative version of the local Hamiltonian problem and common eigenspace problem
- Complexity of commuting Hamiltonians on a square lattice of qubits
- Distinguishing multi-partite states by local measurements
- Entropy scaling and simulability by matrix product states
- Expander graphs and their applications
- Faithful squashed entanglement
- Finite exchangeable sequences
- Finitely correlated states on quantum spin chains
- Inapproximability of combinatorial optimization problems
- Locally normal symmetric states and an analogue of de Finetti's theorem
- Matrix product operators and central elements: classical description of a quantum state
- On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems
- One-and-a-half quantum de Finetti theorems
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Quantum de finetti theorems under local measurements with applications
- Quantum entanglement
- Quantum fluctuations and rate of convergence towards mean field dynamics
- Robustness of quantum Markov chains
- Rounding Semidefinite Programming Hierarchies via Global Correlation
- Some applications of hypercontractive inequalities in quantum information theory
- Squashed Entanglement for Multipartite States and Entanglement Measures Based on the Mixed Convex Roof
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Symmetric states of infinite tensor products of \(C^ *\)-algebras
- The Complexity of the Local Hamiltonian Problem
- The PCP theorem by gap amplification
- The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
- The complexity of quantum spin systems on a two-dimensional square lattice
- The detectability lemma and quantum gap amplification
- The power of quantum systems on a line
- Unknown quantum states: The quantum de Finetti representation
Cited in
(10)- Hamiltonian sparsification and gap-simulation
- scientific article; zbMATH DE number 7651034 (Why is no real title available?)
- Product-state approximations to quantum ground states
- A class of stochastic products on the convex set of quantum states
- scientific article; zbMATH DE number 7758361 (Why is no real title available?)
- A fermionic de Finetti theorem
- Approximate low-weight check codes and circuit lower bounds for noisy ground states
- Semidefinite programming hierarchies for constrained bilinear optimization
- A construction of combinatorial NLTS
- Concentration bounds for quantum states with finite correlation length on quantum spin lattice systems
This page was built for publication: Product-state approximations to quantum states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962905)
