Protection of Exponential Operation using Stabilizer Codes in the Early Fault Tolerance Era

• URL: http://arxiv.org/abs/2602.13399v1
• Date: Fri, 13 Feb 2026 19:02:58 GMT
• Title: Protection of Exponential Operation using Stabilizer Codes in the Early Fault Tolerance Era
• Authors: Dawei Zhong, Todd A. Brun,
• Abstract summary: We develop a scheme to encode exponential maps of the form $exp(-iP)$ into stabilizer codes with simple circuit structures and low qubit overhead.<n>Under the level of physical noise of current devices, our encoding scheme is 4--7 times less noisy than the unencoded operation.
• Score: 1.52239054391996
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correction offers a promising path to suppress errors in quantum processors, but the resources required to protect logical operations from noise, especially non-Clifford operations, pose a substantial challenge to achieve practical quantum advantage in the early fault-tolerant quantum computing (EFTQC) era. In this work, we develop a systematic scheme to encode exponential maps of the form $\exp(-iθP)$ into stabilizer codes with simple circuit structures and low qubit overhead. We provide encoded circuits with small first-order logical error rate after postselection for the [[n, n-2, 2]] quantum error-detecting codes and the [[5, 1, 3]], [[7, 1, 3]], and [[15, 7, 3]] quantum error-correcting codes. Detailed analysis shows that under the level of physical noise of current devices, our encoding scheme is 4--7 times less noisy than the unencoded operation, while at most 3% of runs need to be discarded.

Related papers

• Fail fast: techniques to probe rare events in quantum error correction [0.9159338434295846]
  We develop three techniques to characterize the rare-event regime for general quantum low-density parity-check codes under circuit noise.<n>We observe strong low-error-rate performance with the recently proposed Relay decoder.
  arXiv  Detail & Related papers  (2025-11-19T06:57:29Z)
• Fault-tolerant quantum computing with a high-rate symplectic double code [0.0]
  We propose a fault-tolerant encoder for a symplectic double code.<n>The advantage of this code is its compactness, in addition to its high encoding rate.<n>We also develop an arbitrary-state encoder that enables the injection of arbitrary quantum states into the code space.
  arXiv  Detail & Related papers  (2025-09-18T22:03:30Z)
• Efficient and Universal Neural-Network Decoder for Stabilizer-Based Quantum Error Correction [44.698141103370546]
  GraphQEC is a code-agnostic decoder leveraging machine-learning on the graph structure of stabilizer codes with linear time complexity.<n>Our approach represents the first universal solution for real-time quantum error correction across arbitrary stabilizer codes.
  arXiv  Detail & Related papers  (2025-02-27T10:56:53Z)
• Near-optimal decoding algorithm for color codes using Population Annealing [44.99833362998488]
  We implement a decoder that finds the recovery operation with the highest success probability. We study the decoder performance on a 4.8.8 color code lattice under different noise models.
  arXiv  Detail & Related papers  (2024-05-06T18:17:42Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• 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)
• Low-overhead quantum error correction codes with a cyclic topology [0.0]
  We show an approach to construct the quantum circuit of a correction code with ancillas entangled with non-neighboring data qubits.<n>We introduce a neural network-based decoding algorithm supported by an improved lookup table decoder.
  arXiv  Detail & Related papers  (2022-11-06T12:22:23Z)
• Realization of real-time fault-tolerant quantum error correction [0.0]
  We use a ten qubit QCCD trapped-ion quantum computer to encode a single logical qubit. We measure an average logical SPAM error of $1.7(6) times 10-3$, compared to the average physical SPAM error $2.4(8) times 10-3$ of our qubits.
  arXiv  Detail & Related papers  (2021-07-15T17:57:59Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)
• Efficiently computing logical noise in quantum error correcting codes [0.0]
  We show that measurement errors on readout qubits manifest as a renormalization on the effective logical noise. We derive general methods for reducing the computational complexity of the exact effective logical noise by many orders of magnitude.
  arXiv  Detail & Related papers  (2020-03-23T19:40:56Z)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48:53Z)

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.