[2601.20927] Entangling logical qubits without physical operations
Abstract:Fault-tolerant logical entangling gates are essential for scalable quantum computing, but are limited by the error rates and overheads of physical two-qubit gates and measurements. To address this limitation, we introduce phantom codes-quantum error-correcting codes that realize entangling gates between all logical qubits in a code block purely through relabelling of physical qubits during compilation, yielding perfect fidelity with no spatial or temporal overhead. We present a systematic study of such codes. First, we identify phantom codes using complementary numerical and analytical approaches. We exhaustively enumerate all $2.71 \times 10^{10}$ inequivalent CSS codes up to $n=14$ and identify additional instances up to $n=21$ via SAT-based methods. We then construct higher-distance phantom-code families using quantum Reed-Muller codes and the binarization of qudit codes. Across all identified codes, we characterize other supported fault-tolerant logical Clifford and non-Clifford operations. Second, through end-to-end noisy simulations with state preparation, full QEC cycles, and realistic physical error rates, we demonstrate scalable advantages of phantom codes over the surface code across multiple tasks. We observe a one-to-two order-of-magnitude reduction in logical infidelity at comparable qubit overhead for GHZ-state preparation and Trotterized many-body simulation tasks, given a modest preselection acceptance rate. Our work establishes phantom codes as a viable architectural route to fault-tolerant quantum computation with scalable benefits for workloads with dense local entangling structure, and introduces general tools for systematically exploring the broader landscape of quantum error-correcting codes.
# link_10j622jbkqw.pdf ## Metadata - PDFFormatVersion=1.5 - IsLinearized=false - IsAcroFormPresent=false - IsXFAPresent=false - IsCollectionPresent=false - IsSignaturesPresent=false - Author=Jin Ming Koh; Anqi Gong; Andrei C. Diaconu; Daniel Bochen Tan; Alexandra A. Geim; Michael J. Gullans; Norman Y. Yao; Mikhail D. Lukin; Shayan Majidy - Creator=arXiv GenPDF (tex2pdf:57610bf) - Custom.DOI=https://doi.org/10.48550/arXiv.2601.20927 - Custom.License=http://creativecommons.org/licenses/by/4.0/ - Custom.PTEX.Fullbanner=This is pdfTeX, Version 3.141592653-2.6-1.40.25 (TeX Live 2023) kpathsea versi
Explore this link on the map →saved by
related reading
- [2503.10935] Bias-preserving and error-detectable entangling operations in a superconducting dual-rail systemarxiv.org
- [2507.20100] Circuit simulation of readout process toward large-scale superconducting quantum circuitsarxiv.org
- Making quantum error correction workresearch.google
- Quantum computing for the very curiousquantum.country
- Shtetl-Optimized >> Blog Archive >> And yet quantum computing continues to progressscottaaronson.blog
- [1907.11157] Quantum Error Correction: An Introductory Guidearxiv.org
- quantum-computation-and-quantum-information-nielsen-chuang.pdfprofmcruz.wordpress.com
- Shtetl-Optimized >> Blog Archive >> Quantum computing bombshells that are not April Foolsscottaaronson.blog
- A tutorial quantum interpreter in 150 lines of Lispstylewarning.com
- Run your first circuit on hardware | IBM Quantum Documentationqiskit.org
- [2407.03270] Lattices, Gates, and Curves: GKP codes as a Rosetta stonearxiv.org
- Quantum computing - Wikipediaen.wikipedia.org