Export citation

Export citation

Choose format for download:

Download Citation

    Combinatorial Approach to Circuit Complexity: From Approximate Quantum Codes to Lieb-Schultz-Mattis Constraints

    Jinmin Yi1,2,*, Ruizhi Liu3,1, and Zhi Li4,†

    • *Contact author: jyi@pitp.ca
    • †Contact author: zli@ibm.com

    Phys. Rev. Lett. 137, 210401 – Published 19 November, 2026

    DOI: https://doi.org/10.1103/kfd4-91m9

    Abstract

    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 trade-off 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.

    Physics Subject Headings (PhySH)

    Authorization Required

    We need you to provide your credentials before accessing this content.

    Supplemental Material (Subscription Required)

    References (Subscription Required)

    Outline

    Information

    Sign In to Your Journals Account

    Filter

    Filter

    Article Lookup

    Enter a citation