Show simple item record

dc.contributor.authorEldar, Lior
dc.contributor.authorHarrow, Aram W.
dc.date.accessioned2020-01-21T16:32:21Z
dc.date.available2020-01-21T16:32:21Z
dc.date.issued2017-11-13
dc.date.submitted2016-11-21
dc.identifier.isbn978-1-5386-3464-6
dc.identifier.isbn978-1-5386-3465-3
dc.identifier.issn0272-5428
dc.identifier.urihttps://hdl.handle.net/1721.1/123484
dc.description.abstractGround states of local Hamiltonians can be generally highly entangled: Any quantum circuit that generates them (even approximately) must be sufficiently deep to allow coupling (entanglement) between any pair of qubits. Until now this property was not known to be robust - the marginals of such states to a subset of the qubits containing all but a small constant fraction of them may be only locally entangled, and hence approximable by shallow quantum circuits. In this work we construct a family of 16-local Hamiltonians for which any 1-10[superscript-8] fraction of qubits of any ground state must be highly entangled.This provides evidence that quantum entanglement is not very fragile, and perhaps our intuition about its instability is an artifact of considering local Hamiltonians which are not only local but spatially local. Formally, it provides positive evidence for two wide-open conjectures in condensed-matter physics and quantum complexity theory which are the qLDPC conjecture, positing the existence of good quantum LDPC codes, and the NLTS conjecture due to Freedman and Hastings positing the existence of local Hamiltonians in which any low-energy state is highly-entangled.Our Hamiltonian is based on applying the hypergraph product by Tillich-Zemor to the repetition code with checks from an expander graph. A key tool in our proof is a new lower bound on the vertex expansion of the output of low-depth quantum circuits, which may be of independent interest. Keywords: quantum entanglement; stationary state; robustness; complexity theory; graph theoryen_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-1111382)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-1452616)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-1629809)en_US
dc.description.sponsorshipUnited States. Army Research Office (Contract W911NF-12-1-0486)en_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.isversionofhttp://dx.doi.org/10.1109/FOCS.2017.46en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleLocal Hamiltonians Whose Ground States Are Hard to Approximateen_US
dc.typeArticleen_US
dc.identifier.citationEldar, Lior, and Aram W. Harrow. “Local Hamiltonians Whose Ground States Are Hard to Approximate.” 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), October 2017, Berkeley, California, USA, Institute of Electrical and Electronics Engineers (IEEE), November 2017en_US
dc.contributor.departmentMassachusetts Institute of Technology. Center for Theoretical Physicsen_US
dc.relation.journal2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)en_US
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2019-03-26T15:29:31Z
dspace.orderedauthorsEldar, Lior; Harrow, Aram W.en_US
dspace.embargo.termsNen_US
dspace.date.submission2019-04-04T11:19:12Z
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record