Phantom codes: Entangling logical qubits without physical operations

Phantom codes: Entangling logical qubits without physical operations

🎙 Shayan Majidy 👥 342 📅 July 5, 2026 ⏱ 49 min 👁 85 📄 original study 🧭 2026-08-16
Available in: English (current) Français

Keywords

phantom codesquantum error correctionlogical entangling gatespermutationoverhead reduction

Summary

The talk introduces phantom codes, a new class of quantum error-correcting codes that enable entangling gates between logical qubits purely through physical qubit relabelling, eliminating the need for physical two-qubit gates or measurements. The speaker begins with a primer on quantum error correction, covering key concepts like non-local encoding, stabilizer measurements, error discretization, thresholds, and fault-tolerant computation. He then motivates the need for reducing overhead and discusses the strategy of specializing codes for target algorithms. The core of the talk presents the definition of phantom codes, their properties, and the methods used to construct them: exhaustive enumeration of CSS codes up to n=14, SAT-based search up to n=21, and analytic constructions using quantum Reed-Muller codes and binarization. The speaker demonstrates through end-to-end noisy simulations that phantom codes offer a one-to-two order-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. He also discusses the limitations and practical considerations, such as the exponential growth of physical qubits with logical qubits and the recommended range of k=4-6 for optimal use. The talk concludes with an overview of additional results and tools developed for implementing non-LDPC codes.

197 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk provides significant value by introducing a novel concept that could substantially reduce the overhead of fault-tolerant quantum computing. The argumentation is solid, grounded in rigorous numerical and analytical methods. The speaker clearly explains the intuition behind phantom codes, using analogies like entanglement redistribution, and supports claims with concrete data from exhaustive enumeration and simulations. The presentation is well-structured, building from fundamentals to advanced results, and addresses potential misconceptions. The speaker also acknowledges limitations, such as the exponential overhead in physical qubits, and suggests practical usage scenarios. Overall, the value is high, and the argumentation is convincing.

Scientific Rigor, Source Quality, Title Accuracy

The scientific rigor is high, with the speaker presenting original research that appears to be thorough, including exhaustive enumeration and end-to-end simulations. The sources cited are primarily the speaker’s own work and well-known references in the field, such as the surface code and prior experiments. The title accurately reflects the content, focusing on the key innovation of phantom codes. The talk is a seminar presentation, so it lacks formal peer review, but the methodology and results appear sound. The speaker’s credentials and the inclusion of a detailed paper (70 pages) add to the credibility. The adéquation between title and content is excellent.

215 words

Title / Content Match

The title accurately reflects the core concept of phantom codes, which enable entangling gates via relabelling without physical operations.

Quality & Reliability

8/10

Presentation of original research with rigorous methodology, including exhaustive enumeration and SAT-based search, backed by end-to-end simulations. The speaker is a recognized researcher with strong credentials. However, the video is a seminar recording with limited peer review in the presentation itself.

Key Moments

Cited Sources

  • Building Quantum Computers — Textbook co-authored by the speaker, mentioned in introduction
  • Surface code — Reference for comparison in simulations
  • Quantum Reed-Muller codes — Used for analytic construction of phantom codes
  • Kaiman code — Mentioned as a known phantom code with limited logical qubits
  • Hypercube code — Mentioned as a known phantom code with distance 2

Concurring Sources

  • Hypercube code — Mentioned as a known phantom code, supporting the concept.
  • Kaiman code — Another known phantom code, supporting the concept.

Contribution & Novelties

The talk introduces phantom codes, a novel class of quantum error-correcting codes that enable entangling gates between all logical qubits in a code block purely through physical qubit relabelling, achieving perfect fidelity with zero spatial or temporal overhead. This is a significant conceptual advance, as it challenges the conventional need for physical two-qubit gates for logical entangling operations. The systematic study includes exhaustive enumeration of CSS codes up to n=14, SAT-based search up to n=21, and analytic constructions, providing a comprehensive landscape of such codes. The demonstration of scalable advantages over the surface code in realistic noisy simulations for specific tasks highlights practical potential. The work also introduces general tools for exploring the broader space of quantum error-correcting codes.

Pour aller plus loin :

163 words

Radar Profile

The radar profile shows high scores in quantity and quality of information, with a very high technical level. The overall reliability is strong, reflecting the rigorous methodology and credible presentation. The profile suggests a content that is dense and specialized, suitable for an expert audience.

Reliability 8/10