Document Open Access Logo

NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes

Authors Louis Golowich , Tali Kaufman

PDF

File

Thumbnail PDF
PDF
LIPIcs.ITCS.2024.54.pdf
  • Filesize: 0.85 MB
  • 23 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Quantum complexity theory
Keywords
  • NLTS Hamiltonian
  • Quantum PCP
  • Sum-of-squares lower bound
  • Quantum LDPC code

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Recent constructions of the first asymptotically good quantum LDPC (qLDPC) codes led to two breakthroughs in complexity theory: the NLTS (No Low-Energy Trivial States) theorem (Anshu, Breuckmann, and Nirkhe, STOC'23), and explicit lower bounds against a linear number of levels of the Sum-of-Squares (SoS) hierarchy (Hopkins and Lin, FOCS'22).
In this work, we obtain improvements to both of these results using qLDPC codes of low rate:  
- Whereas Anshu et al. only obtained NLTS Hamiltonians from qLDPC codes of linear dimension, we show the stronger result that qLDPC codes of arbitrarily small positive dimension yield NLTS Hamiltonians. 
- The SoS lower bounds of Hopkins and Lin are only weakly explicit because they require running Gaussian elimination to find a nontrivial codeword, which takes polynomial time. We resolve this shortcoming by introducing a new method of planting a strongly explicit nontrivial codeword in linear-distance qLDPC codes, which in turn yields strongly explicit SoS lower bounds.  Our "planted" qLDPC codes may be of independent interest, as they provide a new way of ensuring a qLDPC code has positive dimension without resorting to parity check counting, and therefore provide more flexibility in the code construction.

Cite As Get BibTex

Louis Golowich and Tali Kaufman. NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 54:1-54:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.ITCS.2024.54

Author Details

Louis Golowich
  • Department of Computer Science, University of California at Berkeley, CA, USA
Tali Kaufman
  • Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel

Funding

This work was done in part while the authors were visiting the Simons Institute for the Theory of Computing.
  • Golowich, Louis: Supported by a National Science Foundation Graduate Research Fellowship under Grant No. DGE 2146752, and in part by V. Guruswami’s Simons Investigator award and UC Noyce Initiative Award award.

Acknowledgements

We thank Max Hopkins for numerous helpful discussions, and for bringing the problem of strongly explicit SoS lower bounds to our attention. We also thank Venkat Guruswami for helping to improve the exposition.

References

  1. Anurag Anshu, Nikolas P. Breuckmann, and Chinmay Nirkhe. NLTS Hamiltonians from Good Quantum Codes. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pages 1090-1096, New York, NY, USA, June 2023. Association for Computing Machinery. URL: https://doi.org/10.1145/3564246.3585114.
  2. Yotam Dikstein, Irit Dinur, Prahladh Harsha, and Noga Ron-Zewi. Locally testable codes via high-dimensional expanders. arXiv:2005.01045 [cs], May 2020. URL: https://arxiv.org/abs/2005.01045.
  3. Irit Dinur, Yuval Filmus, Prahladh Harsha, and Madhur Tulsiani. Explicit SoS Lower Bounds from High-Dimensional Expanders. In James R. Lee, editor, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), volume 185 of Leibniz International Proceedings in Informatics (LIPIcs), pages 38:1-38:16, Dagstuhl, Germany, 2021. Schloss Dagstuhl –- Leibniz-Zentrum für Informatik. ISSN: 1868-8969. URL: https://doi.org/10.4230/LIPIcs.ITCS.2021.38.
  4. Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, and Thomas Vidick. Good Quantum LDPC Codes with Linear Time Decoders. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pages 905-918, New York, NY, USA, June 2023. Association for Computing Machinery. URL: https://doi.org/10.1145/3564246.3585101.
  5. Irit Dinur, Siqi Liu, and Rachel Zhang. New Codes on High Dimensional Expanders, August 2023. ISSN: 1433-8092. URL: https://eccc.weizmann.ac.il/report/2023/127/.
  6. Lior Eldar and Aram W. Harrow. Local Hamiltonians Whose Ground States are Hard to Approximate. 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pages 427-438, October 2017. arXiv: 1510.02082. URL: https://doi.org/10.1109/FOCS.2017.46.
  7. Noah Fleming, Pravesh Kothari, and Toniann Pitassi. Semialgebraic Proofs and Efficient Algorithm Design. Foundations and Trends® in Theoretical Computer Science, 14(1-2):1-221, December 2019. Publisher: Now Publishers, Inc. URL: https://doi.org/10.1561/0400000086.
  8. Louis Golowich and Tali Kaufman. NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes, November 2023. arXiv:2311.09503 [quant-ph]. URL: https://doi.org/10.48550/arXiv.2311.09503.
  9. Holger F. Hofmann and Shigeki Takeuchi. Violation of local uncertainty relations as a signature of entanglement. Physical Review A, 68(3):032103, September 2003. Publisher: American Physical Society. URL: https://doi.org/10.1103/PhysRevA.68.032103.
  10. Max Hopkins. Personal Communication, 2023. Google Scholar
  11. Max Hopkins and Ting-Chun Lin. Explicit Lower Bounds Against Omega(n)-Rounds of Sum-of-Squares. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 662-673. IEEE Computer Society, October 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00069.
  12. Gleb Kalachev and Pavel Panteleev. Two-sided Robustly Testable Codes, August 2023. arXiv:2206.09973 [cs, math]. URL: https://doi.org/10.48550/arXiv.2206.09973.
  13. Anthony Leverrier and Gilles Zémor. Quantum Tanner codes. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 872-883. IEEE Computer Society, October 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00117.
  14. Anthony Leverrier and Gilles Zémor. Decoding Quantum Tanner Codes. IEEE Transactions on Information Theory, 69(8):5100-5115, August 2023. Conference Name: IEEE Transactions on Information Theory. URL: https://doi.org/10.1109/TIT.2023.3267945.
  15. Anthony Leverrier and Gilles Zémor. Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings, pages 1216-1244. Society for Industrial and Applied Mathematics, January 2023. URL: https://doi.org/10.1137/1.9781611977554.ch45.
  16. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, September 1988. URL: https://doi.org/10.1007/BF02126799.
  17. A. Lubotzky and B. Weiss. Groups and Expanders. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 10:95-109, 1993. URL: http://ma.huji.ac.il/~alexlub/PAPERS/groups%20and%20expanders/groupsAndExpanders.pdf.
  18. M. Morgenstern. Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q. Journal of combinatorial theory. Series B, 62(1):44-62, 1994. Place: SAN DIEGO Publisher: Elsevier Inc. URL: https://doi.org/10.1006/jctb.1994.1054.
  19. Chinmay Nirkhe. Making the Leap to Quantum PCPs, July 2023. URL: https://simons.berkeley.edu/talks/chinmay-nirkhe-ibm-2023-07-12.
  20. Pavel Panteleev and Gleb Kalachev. Asymptotically good Quantum and locally testable classical LDPC codes. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, pages 375-388, New York, NY, USA, June 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3519935.3520017.
  21. Grant Schoenebeck. Linear Level Lasserre Lower Bounds for Certain k-CSPs. In 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pages 593-602, October 2008. ISSN: 0272-5428. URL: https://doi.org/10.1109/FOCS.2008.74.
  22. Madhur Tulsiani. CSP gaps and reductions in the lasserre hierarchy. In Proceedings of the forty-first annual ACM symposium on Theory of computing, STOC '09, pages 303-312, New York, NY, USA, May 2009. Association for Computing Machinery. URL: https://doi.org/10.1145/1536414.1536457.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact