Pith. sign in

REVIEW

Translationally-Invariant Universal Quantum Hamiltonians in 1D

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

arxiv 2003.13753 v2 pith:72THJD5U submitted 2020-03-30 quant-ph

Translationally-Invariant Universal Quantum Hamiltonians in 1D

classification quant-ph
keywords hamiltoniansuniversalquantumchainsmodelsspinuniversalitycomplexity
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Recent work has characterised rigorously what it means for one quantum system to simulate another, and demonstrated the existence of universal Hamiltonians -- simple spin lattice Hamiltonians that can replicate the entire physics of any other quantum many body system. Previous universality results have required proofs involving complicated `chains' of perturbative `gadgets'. In this paper, we derive a significantly simpler and more powerful method of proving universality of Hamiltonians, directly leveraging the ability to encode quantum computation into ground states. This provides new insight into the origins of universal models, and suggests a deep connection between universality and complexity. We apply this new approach to show that there are universal models even in translationally invariant spin chains in 1D. This gives as a corollary a new Hamiltonian complexity result, that the local Hamiltonian problem for translationally-invariant spin chains in one dimension with an exponentially-small promise gap is PSPACE-complete. Finally, we use these new universal models to construct the first known toy model of 2D--1D holographic duality between local Hamiltonians.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.