{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:55:46Z","timestamp":1781078146570,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2238836, 2013303, OMA2016245"],"award-info":[{"award-number":["2238836, 2013303, OMA2016245"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"EPSRC Prosperity Partnership in Quantum Software for Simulation and Modelling","award":["EP\/S005021\/1"],"award-info":[{"award-number":["EP\/S005021\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585114","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"1090-1096","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["NLTS Hamiltonians from Good Quantum Codes"],"prefix":"10.1145","author":[{"given":"Anurag","family":"Anshu","sequence":"first","affiliation":[{"name":"Harvard University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolas P.","family":"Breuckmann","sequence":"additional","affiliation":[{"name":"University of Bristol, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chinmay","family":"Nirkhe","sequence":"additional","affiliation":[{"name":"MIT-IBM Watson AI Lab, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536472"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491533.2491549"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-014-0877-9"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519962"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2206.02741"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2022.6"},{"key":"e_1_3_2_2_7_1","unstructured":"Boaz Barak and David Steurer. 2016. Proofs beliefs and algorithms through the lens of sum-of-squares. https:\/\/www.sumofsquares.org\/public\/index.html"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488719"},{"key":"e_1_3_2_2_9_1","volume-title":"Obstacles to State Preparation and Variational Optimization from Symmetry Protection. Physical review letters, 125, 26","author":"Bravyi Sergey","year":"2020","unstructured":"Sergey Bravyi, Alexander Kliesch, Robert Koenig, and Eugene Tang. 2020. Obstacles to State Preparation and Variational Optimization from Symmetry Protection. Physical review letters, 125, 26 (2020), 260505."},{"key":"e_1_3_2_2_10_1","first-page":"187","article-title":"Commutative Version of the Local Hamiltonian Problem and Common Eigenspace Problem. Quantum Info","volume":"5","author":"Bravyi Sergey","year":"2005","unstructured":"Sergey Bravyi and Mikhail Vyalyi. 2005. Commutative Version of the Local Hamiltonian Problem and Common Eigenspace Problem. Quantum Info. Comput., 5, 3 (2005), May, 187\u2013215. issn:1533-7146","journal-title":"Comput."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3097347"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814607"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","unstructured":"Irit Dinur Min-Hsiu Hsieh Ting-Chun Lin and Thomas Vidick. 2022. Good Quantum LDPC Codes with Linear Time Decoders. https:\/\/doi.org\/10.48550\/ARXIV.2206.07750","DOI":"10.48550\/ARXIV.2206.07750"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2021.49"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.46"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC14.1-2-9"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2108492118"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-001-8192-0"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","unstructured":"Max Hopkins and Ting-Chun Lin. 2022. Explicit Lower Bounds Against Omega(n)-Rounds of Sum-of-Squares. https:\/\/doi.org\/10.48550\/ARXIV.2204.11469","DOI":"10.48550\/ARXIV.2204.11469"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01271266"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"A. Yu. Kitaev A. H. Shen and M. N. Vyalyi. 2002. Classical and Quantum Computation. American Mathematical Society USA. isbn:0821832298","DOI":"10.1090\/gsm\/047"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","unstructured":"Anthony Leverrier and Gilles Z\u00e9mor. 2022. Quantum Tanner codes. https:\/\/doi.org\/10.48550\/ARXIV.2202.13641","DOI":"10.48550\/ARXIV.2202.13641"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"},{"key":"e_1_3_2_2_24_1","volume-title":"Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problemy peredachi informatsii, 24, 1","author":"Margulis Grigorii Aleksandrovich","year":"1988","unstructured":"Grigorii Aleksandrovich Margulis. 1988. Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problemy peredachi informatsii, 24, 1 (1988), 51\u201360."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00075"},{"key":"e_1_3_2_2_26_1","volume-title":"Lower bounds on the complexity of quantum proofs. Ph. D. Dissertation. EECS Department","author":"Nirkhe Chinmay","year":"2022","unstructured":"Chinmay Nirkhe. 2022. Lower bounds on the complexity of quantum proofs. Ph. D. Dissertation. EECS Department, University of California, Berkeley. http:\/\/www2.eecs.berkeley.edu\/Pubs\/TechRpts\/2022\/EECS-2022-236.html"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.91"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","unstructured":"Pavel Panteleev and Gleb Kalachev. 2021. Asymptotically Good Quantum and Locally Testable Classical LDPC Codes. https:\/\/doi.org\/10.48550\/ARXIV.2111.03654","DOI":"10.48550\/ARXIV.2111.03654"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.796385"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","location":"Orlando FL USA","acronym":"STOC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585114","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585114","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:27Z","timestamp":1750295847000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":31,"alternative-id":["10.1145\/3564246.3585114","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585114","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}