Combinatorial Approach to Circuit Complexity: From Approximate Quantum Codes to Lieb-Schultz-Mattis Constraints
Approximate quantum error correction (AQEC) provides a versatile framework for both quantum information processing and probing many-body entanglement. We reveal a fundamental tension between the error-correcting power of an AQEC and the hardness of code state preparation. More precisely, through a novel application of the Lovász local lemma, we establish a fundamental tradeoff between local indistinguishability and circuit complexity, showing that orthogonal short-range entangled states must be distinguishable via a local operator. These results offer a powerful tool for exploring quantum circuit complexity across diverse settings. As applications, we derive stronger constraints on the complexity of AQEC codes with transversal logical gates and establish strong complexity lower bounds for W state preparation. Our framework also provides a novel perspective for systems with Lieb-Schultz-Mattis type constraints.
Authors
- Jinmin Yi (ORCID: https://orcid.org/0000-0001-6948-2464)
- Ruizhi Liu
- Zhi Li
Institutions
- Dalhousie University (CA)
- IBM (United States) (US)
- University of Waterloo (CA)
- Perimeter Institute (CA)
- IBM Research - Thomas J. Watson Research Center (US)
Publication Details
- Journal
- Physical Review Letters
- Published
- 2026-11-19
- DOI
- https://doi.org/10.1103/kfd4-91m9
- Citations
- 7
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 6.78
Funders
- Government of Canada
- Institut Périmètre de physique théorique
- Ministry of Colleges and Universities