Fault-tolerant preparation of arbitrary logical states in the cat code

• URL: http://arxiv.org/abs/2602.17438v1
• Date: Thu, 19 Feb 2026 15:07:46 GMT
• Title: Fault-tolerant preparation of arbitrary logical states in the cat code
• Authors: Zi-Jie Chen, Weizhou Cai, Liang-Xu Xie, Qing-Xuan Jie, Xu-Bo Zou, Guang-Can Guo, Luyan Sun, Chang-Ling Zou,
• Abstract summary: We present a complete framework for the fault-tolerant preparation of arbitrary logical states encoded in the four-legged cat code.<n>This framework is engineered to suppress the dominant incoherent errors, including excitation decay and dephasing in both the bosonic mode and the ancilla.<n>A scaling analysis confirms that the logical error rate grows nearly quadratically with the physical error rate, confirming that all first-order errors are fully suppressed.
• Score: 2.188273064906527
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Preparing high-fidelity logical states is a central challenge in fault-tolerant quantum computing, yet existing approaches struggle to balance control complexity against resource overhead. Here, we present a complete framework for the fault-tolerant preparation of arbitrary logical states encoded in the four-legged cat code. This framework is engineered to suppress the dominant incoherent errors, including excitation decay and dephasing in both the bosonic mode and the ancilla via error detection. Numerical simulations with experimentally realistic parameters on a 3D superconducting cavity platform yield logical infidelities on the order of $10^{-4}$. A scaling analysis confirms that the logical error rate grows nearly quadratically with the physical error rate, confirming that all first-order errors are fully suppressed. Our protocol is compatible with current hardware and is scalable to multiple bosonic modes, providing a resource-efficient foundation for magic state preparation and higher-level concatenated quantum error correction.

Related papers

• Quantum Error Correction on Error-mitigated Physical Qubits [0.0]
  We present a framework for applying quantum error mitigation techniques directly to physical qubits to suppress logical errors.<n>We show that a-3 code with physical-level PEC achieves lower distance than ungated code while using 40% and fewer fewer rates.<n>These results establish physical QEM as a widely compatible and 64% fault-tolerant architecture.
  arXiv  Detail & Related papers  (2026-01-26T11:33:01Z)
• Synthesis of Fault-tolerant State Preparation Circuits using Steane-type Error Detection [4.561664406615985]
  We propose a general, automated synthesis methodology for fault-tolerant state preparation circuits.<n>We apply the proposed methods to arbitrary Calderbank-Shor-Steane (CSS) codes up to a distance of seven.
  arXiv  Detail & Related papers  (2026-01-19T19:00:03Z)
• Fault-Tolerant Quantum Error Correction: Implementing Hamming-Based Codes with Advanced Syndrome Extraction Techniques [0.0]
  We show that intelligent ancilla management improves error suppression by up to 2.4$times$ compared to standard approaches.<n>Our implementations achieve logical error rates as low as $5.1 times 10-5$ under realistic noise conditions.<n>These results provide immediately deployable tools for near-term quantum devices.
  arXiv  Detail & Related papers  (2026-01-10T00:10:52Z)
• Reinforcement Learning Control of Quantum Error Correction [108.70420561323692]
  Quantum computer learns to self-improve directly from its errors and never stops computing.<n>This work enables a new paradigm: a quantum computer that learns to self-improve directly from its errors and never stops computing.
  arXiv  Detail & Related papers  (2025-11-11T17:32:25Z)
• Demonstrating dynamic surface codes [118.67046728951689]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.<n>Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Scaling and logic in the color code on a superconducting quantum processor [109.61104855764401]
  We present a demonstration of the color code on a superconducting processor, achieving logical error suppression and performing logical operations.<n>We inject magic states, a key resource for universal computation, achieving fidelities exceeding 99% with post-selection.<n>This work establishes the color code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors.
  arXiv  Detail & Related papers  (2024-12-18T19:00:05Z)
• Robust and Deterministic Preparation of Bosonic Logical States in a Trapped Ion [0.0]
  We demonstrate high-fidelity and deterministic preparation of non-classical bosonic states in the mechanical motion of a trapped ion. Our approach implements error-suppressing pulses through optimized dynamical modulation of laser-driven spin-motion interactions.
  arXiv  Detail & Related papers  (2023-10-24T06:30:06Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Overcoming leakage in scalable quantum error correction [128.39402546769284]
  Leakage of quantum information out of computational states into higher energy states represents a major challenge in the pursuit of quantum error correction (QEC) Here, we demonstrate the execution of a distance-3 surface code and distance-21 bit-flip code on a Sycamore quantum processor where leakage is removed from all qubits in each cycle. We report a ten-fold reduction in steady-state leakage population on the data qubits encoding the logical state and an average leakage population of less than $1 times 10-3$ throughout the entire device.
  arXiv  Detail & Related papers  (2022-11-09T07:54:35Z)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)
• Optical demonstration of quantum fault-tolerant threshold [2.6098148548199047]
  A major challenge in practical quantum computation is the ineludible errors caused by the interaction of quantum systems with their environment. Fault-tolerant schemes, in which logical qubits are encoded by several physical qubits, enable correct output of logical qubits under the presence of errors. Here, we experimentally demonstrate the existence of the threshold in a special fault-tolerant protocol.
  arXiv  Detail & Related papers  (2020-12-16T13:23:29Z)
• Fault-Tolerant Operation of a Quantum Error-Correction Code [1.835073691235972]
  Quantum error correction protects fragile quantum information by encoding it into a larger quantum system. Fault-tolerant circuits contain the spread of errors while operating the logical qubit. We show that fault-tolerant circuits enable highly accurate logical primitives in current quantum systems.
  arXiv  Detail & Related papers  (2020-09-24T04:31:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.