Constraints on phantom codes from automorphism group bounds
Arthur S. Morris, Daniel Malz
Abstract
Executing a logical quantum circuit fault-tolerantly incurs a large spacetime overhead. Recent work has proposed and investigated phantom codes, defined by the property that every in-block logical circuit can be implemented with a physical permutation, a property that has the potential to greatly reduce the depth of compiled circuits. Here we show that phantomness comes at the cost of low encoding rate. Specifically, we prove that any binary phantom code encoding logical qubits into physical qubits with distance obeys the bound for all . For we explicitly construct a nonstabiliser phantom code that violates the bound and has a transversal non-Clifford gate. We further show that, within the class of nontrivial CSS phantom codes with , there is a unique family of codes saturating this bound. In addition, we prove that this logarithmic ceiling cannot be circumvented by permitting additional local unitary gates, or by making use of subsystem codes: any subspace or subsystem code admitting a -transversal implementation of every logical circuit is constrained to satisfy the same bound. These bounds follow from a general theorem relating the length of a quantum code to the structure of its automorphism group, a result which may find applications beyond phantom codes.
AI Impact Assessments
(3 models)Scientific Impact Assessment
Core Contribution
This paper resolves an open question raised by Koh et al. (2026) regarding phantom codes — quantum error-correcting codes where every in-block logical CNOT circuit can be implemented by a physical qubit permutation. The central result is a tight bound: any binary phantom code encoding logical qubits into physical qubits with distance must satisfy for all . This establishes that phantomness is fundamentally incompatible with high encoding rates.
The paper's approach is distinctive: it derives the bound from a general structural theorem (Theorem 1) relating the length of a quantum code to the minimal permutation degree of quotients of its automorphism group. This is a clean group-theoretic argument that connects code properties to representation-theoretic invariants, specifically using Cooperstein's result that and the classification of minimal faithful permutation representations.
Methodological Rigor
The mathematical framework is rigorous and well-constructed. The proof strategy proceeds through several clean steps: (1) identifying the permutation group implementing logical CNOTs and its kernel , (2) recognizing that is simple and non-abelian for , (3) applying minimal permutation degree bounds via Proposition 1 (Kovács-Praeger). The handling of the compact Lie group structure of the automorphism group, particularly Lemma 1 (the exception via classification of closed subgroups of SO(3)), demonstrates sophisticated mathematical technique.
The exceptional case arising from the isomorphism is handled constructively: the authors build an explicit nonstabiliser phantom code using the incidence geometry of PG(3,2). This construction is detailed and verified (distance computation, transformation properties, non-Clifford transversal gate). The proof that no Pauli stabiliser phantom code exists (Theorem S4) adds important context.
The uniqueness result (Theorem 4) for punctured hypercube codes among CSS phantom codes leverages Bardoe-Sin's classification of -invariant submodules, showing the argument draws on deep results from representation theory of finite groups over finite fields.
Potential Impact
Direct impact on fault-tolerant quantum computing: The logarithmic bound definitively rules out phantom codes as a route to high-rate fault-tolerant computation. This is practically important because phantom codes were recently proposed as a way to dramatically reduce circuit depth by implementing entangling gates through qubit relabeling — particularly attractive for trapped-ion and neutral-atom platforms with reconfigurable connectivity.
Broader theoretical implications: Theorem 1 provides a general tool for bounding code lengths from automorphism group structure. This could find applications beyond phantom codes, for instance in analyzing codes with large symmetry groups used for other fault-tolerant gate implementations. The result complements recent no-go theorems (Eastin-Knill, Chakraborty-Gottesman) constraining transversal and multi-copy gate implementations.
The PG(3,2) code: The explicit nonstabiliser code with a transversal non-Clifford gate () and maximal permutation automorphism group is independently interesting. Nonstabiliser codes with useful transversal gates are rare in the literature.
Qudit generalization: The extension to Galois qudits (Theorem S6) using broadens applicability.
Timeliness & Relevance
This work is highly timely. Phantom codes were introduced very recently (Koh et al., January 2026), and the question of whether the observed logarithmic scaling was fundamental or an artifact of known constructions was explicitly posed as open. Simultaneously, there is intense activity on fault-tolerant logical gate implementation in qLDPC codes, code automorphisms, and reducing spacetime overhead. By proving that phantom codes cannot achieve constant rate, this paper redirects research attention toward hybrid approaches (e.g., code switching) or partial phantom properties.
Strengths
1. Clean resolution of an open problem with a tight bound and matching constructions.
2. General theorem (Theorem 1) with potential for reuse across quantum coding theory.
3. Robustness of the bound: extending to phantom-LU codes (Theorem 5) and subsystem codes (PLUS codes) eliminates natural escape routes.
4. Rich supplementary material: the 20-page SM includes complete proofs, the explicit PG(3,2) code construction with incidence tables, uniqueness proof, and qudit extensions.
5. Novel code construction: the nonstabiliser phantom code exploiting the exceptional isomorphism .
Limitations
1. The bound does not address whether qLDPC phantom codes exist at *suboptimal* rates (e.g., ), which remains open.
2. The exception, while handled, means the bound is not entirely uniform.
3. The practical implications for hybrid schemes (code switching between phantom and high-rate codes) are mentioned but not developed.
4. Extension to non-Galois qudit dimensions remains open.
5. The distance of all known tight phantom codes is only , and the interplay between phantomness and higher distance remains underexplored beyond citing existing results.
Generated Apr 17, 2026
Comparison History (38)
Paper 2 has higher likely impact: it delivers rigorous, broadly applicable no-go style bounds linking code length/rate to automorphism-group structure, constraining an actively explored route to reducing fault-tolerant overhead. The results are theorem-driven, extend to subspace/subsystem codes and extra local unitaries, identify a unique saturating family, and include an explicit exceptional construction (k=4) with a transversal non-Clifford gate—useful for both theory and practice. Paper 1 is innovative but its single-copy tomography claims may face physical/operational limitations and narrower immediate applicability.
Paper 2 has higher potential impact because it introduces a highly generalizable framework to discover hidden symmetries across quantum many-body systems. Identifying symmetries is a fundamental challenge in condensed matter and theoretical physics. By successfully applying its novel 'cross spectral form factor' to significant models like the Fermi-Hubbard model, it demonstrates broad, practical utility. In contrast, while Paper 1 provides rigorous theoretical bounds, it primarily establishes limits on a specific, niche approach (phantom codes) within quantum error correction, resulting in a narrower scope of impact.
Paper 2 establishes fundamental bounds on phantom codes—a new and actively investigated concept in fault-tolerant quantum computing—with broad implications for circuit compilation and code design. It provides both impossibility results and explicit constructions, and its general automorphism group theorem has potential applications beyond phantom codes. Paper 1 sharpens existing logarithmic trace inequalities with optimal constants, which is technically strong but incremental (improving prefactors). Paper 2 addresses a more structurally novel question with wider potential impact on quantum error correction practice and theory.
Paper 1 presents a highly significant experimental breakthrough in quantum computing and communication by achieving terahertz-bandwidth quantum teleportation. By bypassing traditional electronic bottlenecks, it experimentally validates a pathway to ultrafast quantum processors and a telecom-compatible quantum internet. Paper 2 offers valuable theoretical bounds on phantom codes in quantum error correction, but represents a more specialized, constraint-focused result. The broad applicability, experimental realization of a long-sought goal, and potential to radically accelerate quantum information processing give Paper 1 a substantially higher potential scientific and technological impact.
Paper 1 proposes a novel, robust paradigm for quantum metrology that surpasses the Heisenberg limit without requiring delicate entangled states. This practical approach overcomes major scaling hurdles, offering broad, near-term impact in integrated photonics and ultra-sensitive measurements. Paper 2 presents valuable theoretical constraints on phantom codes for quantum error correction, but its impact is narrower, primarily serving as a negative bound for a specific subfield.
Paper 2 addresses a fundamental challenge in fault-tolerant quantum computing by establishing rigorous bounds on phantom codes and linking code length to automorphism group structure. Its findings have broad implications for quantum error correction, a critical bottleneck in realizing scalable quantum computers. While Paper 1 offers valuable insights into quantum sensing and thermometry, Paper 2's theoretical constraints and general theorems provide foundational knowledge that will broadly impact the highly active and high-stakes field of quantum information theory and architecture design.
Paper 1 offers a highly practical and computationally cheap method to optimize decoding for Bivariate Bicycle codes, directly applicable to IBM's near-term quantum hardware roadmap. While Paper 2 provides rigorous theoretical bounds on phantom codes, Paper 1 addresses an immediate, real-world bottleneck in practical quantum error correction, giving it a much higher potential for immediate, widespread technological application and impact in the race to build fault-tolerant quantum computers.
Paper 1 offers a tangible, practical advancement in Quantum Phase Estimation, a cornerstone algorithm for quantum chemistry. By significantly reducing resource overhead (CX count, depth) and demonstrating the approach on actual quantum hardware, it directly addresses a critical bottleneck in near-term quantum simulation. While Paper 2 provides important theoretical bounds on a specific class of quantum codes, Paper 1's immediate applicability to prominent problems like FeMoco simulation gives it higher potential for broad, real-world scientific impact.
Paper 2 establishes fundamental bounds on phantom codes with broad implications for fault-tolerant quantum computing. It proves a logarithmic ceiling on encoding rates, constructs novel codes with non-Clifford transversal gates, and derives a general theorem connecting code length to automorphism group structure with applications beyond the immediate context. Paper 1 provides a technical improvement to a specific bound in decoded quantum interferometry, which, while rigorous, addresses a narrower problem. Paper 2's results constrain an active research direction in quantum error correction and have wider methodological impact across quantum coding theory.
Paper 2 likely has higher impact: it addresses the timely, high-profile question of whether tabletop gravity-mediated entanglement experiments can distinguish quantum vs classical gravity, and provides a broadly applicable theoretical bridge showing classical–quantum dynamics can emerge from decohered fully quantum models, including non-Markovian effects and a clear validity criterion. This has immediate implications for experimental interpretation and spans quantum foundations, open quantum systems, and quantum gravity phenomenology. Paper 1 is rigorous and novel within quantum error correction, but its main result is a strong limitation (log-rate ceiling) on a niche code class, narrowing practical applicability.
Paper 1 establishes fundamental, rigorous bounds on phantom codes in quantum error correction, a critical bottleneck for fault-tolerant quantum computing. By proving a logarithmic ceiling on encoding rates and connecting code length to automorphism group structure, it provides broad theoretical implications. Paper 2, while interesting, focuses on a more specialized nonequilibrium phenomenon in a specific 1D spin chain model, which likely has a narrower immediate impact compared to foundational results in quantum error correction.
Paper 1 delivers a rigorous, broadly applicable no-go-style result: a tight logarithmic upper bound on encoding rate for phantom codes (with a notable k=4 exception and explicit construction), and shows the bound persists under added local unitaries and subsystem-code generalizations. This substantially constrains a recently proposed fault-tolerance paradigm and introduces an automorphism-group theorem likely reusable beyond the immediate setting. Paper 2 is promising for robust control, but its abstract-level claims hinge on a framework and error-suppression order whose ultimate impact depends on practical implementability and experimental validation. Paper 1’s definitive constraints and general theorem suggest higher near-term scientific impact.
Paper 2 likely has higher impact: it delivers rigorous, general no-go bounds (and a notable k=4 exception with an explicit nonstabiliser construction) on a recently proposed fault-tolerant coding paradigm, directly informing feasibility and resource overhead in quantum computing. The results are broadly applicable via an automorphism-group theorem that can extend beyond phantom codes, and are timely given intense interest in reducing compilation depth and transversal gate sets. Paper 1 is innovative but simulation/SFA-based and more specialized to strong-field AMO physics, with less immediate cross-field uptake.
Paper 2 addresses a highly relevant and active area: fault-tolerant quantum computing and quantum error correction. By proving a fundamental limit on the encoding rate of phantom codes, it directly impacts the design of future quantum architectures and circuits. Its general theorem on automorphism groups also suggests broader applicability within coding theory. In contrast, Paper 1 deals with a foundational and abstract theoretical physics problem (quantum recurrence time), which, while mathematically rigorous, likely has fewer immediate practical applications and a narrower immediate impact.
Paper 2 establishes fundamental theoretical bounds on phantom codes with rigorous mathematical proofs, including a general theorem relating code length to automorphism group structure that has broad applicability beyond the specific context. It resolves open questions about encoding rates, constructs novel codes (nonstabilizer phantom code with transversal non-Clifford gate), and the results constrain an active area of quantum error correction research. Paper 1, while valuable as a circuit-level implementation of a quantum algorithm, is more incremental—implementing an existing framework with practical modifications—and its impact is contingent on fault-tolerant hardware availability.
Paper 1 likely has higher impact: it delivers a strong, general no-go style bound (logarithmic ceiling on encoding rate) for an emerging code class, extends to subsystem codes and added unitaries, and derives results from a broader automorphism-group theorem with potential reuse across quantum coding theory. The explicit k=4 counterexample with a transversal non-Clifford gate is also notable. Paper 2 proposes useful linear-optical postselection schemes, but appears more incremental and application-specific, with impact depending on experimental feasibility and success probabilities.
Paper 2 establishes fundamental theoretical bounds on phantom codes with rigorous mathematical proofs, including a general theorem connecting code length to automorphism group structure with broad applicability beyond phantom codes. It addresses the critical problem of fault-tolerant quantum computation overhead, provides tight bounds (with explicit constructions saturating them), and discovers a novel non-stabilizer code with transversal non-Clifford gates. Paper 1, while useful, presents incremental improvements to variational quantum circuits for metrology. Paper 2's fundamental constraints and general mathematical framework are likely to have broader and more lasting impact across quantum error correction and coding theory.
Paper 2 establishes fundamental bounds on phantom codes—a recently proposed approach to reduce fault-tolerant quantum computing overhead—proving a logarithmic ceiling on encoding rate. It provides rigorous no-go results with broad applicability (the automorphism group theorem extends beyond phantom codes), constructs novel counterexamples including a non-stabilizer code with transversal non-Clifford gates, and directly addresses a critical bottleneck in quantum error correction. Paper 1 offers interesting observations about mixed dynamics in an Ising model but is more incremental, mapping known phenomena (kicked top dynamics) to symmetry sectors without comparably transformative implications.
Paper 1 offers a practical hybrid approach combining quantum error correction and mitigation, directly addressing the critical resource overhead bottlenecks of near-term quantum computing. Its method significantly reduces runtime, offering immediate real-world utility. Paper 2 provides important fundamental bounds on phantom codes, but as a negative theoretical constraint, its broader practical impact is likely more limited compared to the actionable algorithmic improvement in Paper 1.
Paper 2 establishes fundamental bounds on phantom codes—a recently proposed approach to reducing fault-tolerant circuit overhead—proving a logarithmic ceiling on encoding rate. This result has immediate practical implications for quantum error correction architecture design, resolves open questions about phantom code scalability, and introduces general automorphism group techniques applicable beyond phantom codes. Paper 1 develops a rigorous but more incremental witness-based framework connecting CV and DV resources. While mathematically thorough, Paper 2's results are more likely to redirect research efforts and have broader impact in the rapidly growing quantum error correction community.