REVIEW 6 cited by
An area law and sub-exponential algorithm for 1D systems
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
An area law and sub-exponential algorithm for 1D systems
read the original abstract
We give a new proof for the area law for general 1D gapped systems, which exponentially improves Hastings' famous result \cite{ref:Has07}. Specifically, we show that for a chain of d-dimensional spins, governed by a 1D local Hamiltonian with a spectral gap \eps>0, the entanglement entropy of the ground state with respect to any cut in the chain is upper bounded by $O{\frac{\log^3 d}{\eps}}$. Our approach uses the framework Arad et al to construct a Chebyshev-based AGSP (Approximate Ground Space Projection) with favorable factors. However, our construction uses the Hamiltonian directly, instead of using the Detectability lemma, which allows us to work with general (frustrated) Hamiltonians, as well as slightly improving the $1/\eps$ dependence of the bound in Arad et al. To achieve that, we establish a new, "random-walk like", bound on the entanglement rank of an arbitrary power of a 1D Hamiltonian, which might be of independent interest: \ER{H^\ell} \le (\ell d)^{O(\sqrt{\ell})}. Finally, treating d as a constant, our AGSP shows that the ground state is well approximated by a matrix product state with a sublinear bond dimension $B=e^{O(\log^{3/4}n/\eps^{1/4})}. Using this in conjunction with known dynamical programing algorithms, yields an algorithm for a 1/\poly(n) approximation of the ground energy with a subexponential running time T\le \exp(e^{O(\log^{3/4}n/\eps^{1/4})}).
Forward citations
Cited by 6 Pith papers
-
Extracting conserved operators from a projected entangled pair state
A technique extracts k-local conserved operators from iPEPS by identifying vanishing fidelity susceptibility in a quantum geometry of parameter-deformed states, yielding improved parent Hamiltonians for RVB and deform...
-
Static features from mixing in short- and long-range Lindbladians: Markov property and correlations
Rapid mixing and frustration-freeness in short- and long-range Lindbladians imply polynomial decay of MI and CMI in fixed points, and long-range non-commuting Gibbs states satisfy local Markov property at any temperature.
-
Fast mixing of all-to-all quantum systems at high temperatures
k-local quantum Hamiltonians admit system-size-independent spectral gap for Gibbs samplers at high temperature, enabling FPT quantum approximation algorithms for partition functions.
-
A universal and efficient hybrid digital-analog fermionic quantum simulator
Hybrid variational framework claims polynomial-time quantum simulation of ground-state local observables in gapless fermionic models on existing hardware, with numerical support for Hubbard variants.
-
Quantum Gibbs sampling through the detectability lemma
Detectability lemma enables Gibbs sampling without Lindbladian simulation, yielding O(M) cost reduction for M-term local Lindbladians and quadratic speedup in spectral gap for frustration-free and commuting cases.
-
A universal and efficient hybrid digital-analog fermionic quantum simulator
Hybrid variational quantum simulation on fermionic ultracold atoms achieves polynomial scaling for ground states of gapless target Hamiltonians, claiming exponential speedup over classical exact diagonalization for lo...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.