Phantom codes: Entangling logical qubits without physical operations

Phantom codes: Entangling logical qubits without physical operations

by Centre for Quantum Technologies

Formal & Physical Sciences Computing & Cybersecurity UYComputer scienceUYXNatural computing
🎙 Centre for Quantum Technologies 👥 8K 📅 July 21, 2026 ⏱ 40 min 👁 189 📄 original study 🧭 2026-08-15
Available in: English (current) Français

Keywords

phantom codeslogical entangling gatesquantum error correctionCSS codesfault-tolerant quantum computing

Summary

The talk presents phantom codes, a new class of quantum error-correcting codes that enable logical entangling gates (specifically CNOT) between all logical qubits in a code block purely through physical qubit relabeling, achieving perfect fidelity with no spatial or temporal overhead. The speaker, Jin Ming Koh from Harvard, begins by motivating the need for quantum error correction and the overhead challenges in current architectures. He then introduces the concept of phantom codes, illustrating with a simple 4-qubit code where a physical swap induces a logical CNOT. The talk details systematic methods to identify phantom codes: exhaustive enumeration of all 27 billion inequivalent CSS codes up to n=14, SAT-based searches up to n=21, and analytical constructions using quantum Reed-Muller codes and binarization of qudit codes. The speaker also characterizes additional fault-tolerant logical Clifford and non-Clifford operations supported by these codes. Through end-to-end noisy simulations, he demonstrates that phantom codes offer one-to-two orders of magnitude reduction in logical infidelity compared to the surface code for tasks like GHZ-state preparation and Trotterized many-body simulation, at comparable qubit overhead. The work establishes phantom codes as a viable architectural route to fault-tolerant quantum computation, particularly for workloads with dense local entangling structure, and introduces general tools for exploring the landscape of quantum error-correcting codes.

209 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk provides high-value information by introducing a novel concept (phantom codes) that could significantly reduce the overhead of logical entangling gates in fault-tolerant quantum computing. The argumentation is solid: the speaker presents a clear definition, provides concrete examples, and supports claims with both numerical enumerations and analytical proofs. The logical flow is rigorous, moving from motivation to construction methods to performance simulations. The speaker acknowledges limitations (e.g., only CNOT gates are possible on CSS codes) and discusses trade-offs, enhancing credibility. The end-to-end simulations with realistic error rates strengthen the practical relevance of the proposed codes.

Scientific Rigor, Source Quality, Title Accuracy

The scientific rigor is high: the work is based on original research, with detailed mathematical derivations and exhaustive computational searches. The speaker cites relevant literature (e.g., IBM’s enumeration approach) and provides a preprint on arXiv (https://arxiv.org/abs/2601.20927 ) as a source. The title accurately reflects the content, focusing on the key innovation of entangling logical qubits without physical operations. The presentation is technical and assumes familiarity with quantum error correction, but the arguments are well-structured and supported by evidence.

189 words

Title / Content Match

The title accurately reflects the content: the talk introduces phantom codes, which enable logical entangling gates via qubit relabeling without physical operations.

Quality & Reliability

9/10

The talk presents original research with rigorous mathematical derivations, exhaustive numerical enumeration, and analytical constructions, backed by a preprint on arXiv. The speaker is from Harvard University, and the work involves collaborators from ETH Zurich and Maryland. The presentation is detailed and technical, with clear logical flow and evidence for claims.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

Concurring Sources

  • Quantum error correction — General background on quantum error correction, consistent with the talk's motivation.
  • Surface code — The benchmark code used in simulations, providing context for the comparison.

Contribution & Novelties

The talk introduces phantom codes, a novel class of quantum error-correcting codes that enable logical entangling gates via qubit relabeling, achieving perfect fidelity with zero overhead. This is a significant conceptual advance, as it challenges the conventional wisdom that logical entangling gates require physical operations. The systematic enumeration and construction methods provide a general framework for discovering codes with desired gate properties. The demonstrated advantages over surface codes in simulations suggest practical implications for reducing overhead in fault-tolerant quantum computing.

Pour aller plus loin :

  • Quantum error correction — Provides background on the principles and challenges of quantum error correction.
  • Surface code — The standard quantum error-correcting code, used as a benchmark in the talk.
  • CSS codes — The class of codes studied, named after Calderbank, Shor, and Steane.
  • Quantum Reed-Muller codes — Classical error-correcting codes used in the analytical construction of phantom codes.
  • SAT solver — The computational method used to search for phantom codes beyond exhaustive enumeration.

159 words

Radar Profile

The radar profile shows high scores across all dimensions, with particularly strong performance in technical depth and information quality. The talk is highly specialized, targeting an expert audience, and provides substantial novel contributions. The balance between theoretical and numerical approaches is well-maintained, indicating a comprehensive and rigorous study.

Reliability 9/10

💬 No comments were provided for analysis.