NLTS Hamiltonians from good quantum codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910727498891264 |
|---|---|
| author | Anshu, Anurag Breuckmann, Nikolas P. Nirkhe, Chinmay |
| author_facet | Anshu, Anurag Breuckmann, Nikolas P. Nirkhe, Chinmay |
| contents | The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastings [2014] posits that there exist families of Hamiltonians with all low energy states of non-trivial complexity (with complexity measured by the quantum circuit depth preparing the state). We prove this conjecture by showing that the recently discovered families of constant-rate and linear-distance QLDPC codes correspond to NLTS local Hamiltonians. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2206_13228 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | NLTS Hamiltonians from good quantum codes Anshu, Anurag Breuckmann, Nikolas P. Nirkhe, Chinmay Quantum Physics Statistical Mechanics Computational Complexity The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastings [2014] posits that there exist families of Hamiltonians with all low energy states of non-trivial complexity (with complexity measured by the quantum circuit depth preparing the state). We prove this conjecture by showing that the recently discovered families of constant-rate and linear-distance QLDPC codes correspond to NLTS local Hamiltonians. |
| title | NLTS Hamiltonians from good quantum codes |
| topic | Quantum Physics Statistical Mechanics Computational Complexity |
| url | https://arxiv.org/abs/2206.13228 |