Fast correlated decoding of transversal logical algorithms

• URL: http://arxiv.org/abs/2505.13587v2
• Date: Fri, 20 Jun 2025 04:04:22 GMT
• Title: Fast correlated decoding of transversal logical algorithms
• Authors: Madelyn Cain, Dolev Bluvstein, Chen Zhao, Shouzhen Gu, Nishad Maskara, Marcin Kalinowski, Alexandra A. Geim, Aleksander Kubica, Mikhail D. Lukin, Hengyun Zhou,
• Abstract summary: Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
• Score: 67.01652927671279
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead. Recent advances have shown that by jointly decoding logical qubits in algorithms composed of transversal gates, the number of syndrome extraction rounds can be reduced by a factor of the code distance $d$, at the cost of increased classical decoding complexity. Here, we reformulate the problem of decoding transversal circuits by directly decoding relevant logical operator products as they propagate through the circuit. This procedure transforms the decoding task into one closely resembling that of a single-qubit memory propagating through time. The resulting approach leads to fast decoding and reduced problem size while maintaining high performance. Focusing on the surface code, we prove that this method enables fault-tolerant decoding with minimum-weight perfect matching, and benchmark its performance on example circuits including magic state distillation. We find that the threshold is comparable to that of a single-qubit memory, and that the total decoding run time can be, in fact, less than that of conventional lattice surgery. Our approach enables fast correlated decoding, providing a pathway to directly extend single-qubit QEC techniques to transversal algorithms.

Related papers

• Scalable decoding protocols for fast transversal logic in the surface code [2.5631808142941415]
  We introduce two new, windowed decoding protocols for coherence logic in the surface code.<n>We show that, with a very small space overhead, our scalable decoders unlock an order of magnitude speed-up for connectivity logic.
  arXiv  Detail & Related papers  (2025-05-29T15:41:11Z)
• Decoding across transversal Clifford gates in the surface code [0.7100520098029438]
  We show how one can decode across an arbitrary sequence of window gates for the unrotated surface code.<n>Our work highlights the complexity and interest in efficient decoding of fast logic for the surface code.
  arXiv  Detail & Related papers  (2025-05-19T18:00:02Z)
• Learning to decode logical circuits [26.510386591426112]
  We introduce a data-centric modular decoder framework, Multi-Core Circuit Decoder (MCCD)<n> MCCD handles both single-qubit and entangling gates within a unified framework.<n>Our approach represents a noise-model solution to the decoding challenge for deep logical quantum circuits.
  arXiv  Detail & Related papers  (2025-04-23T18:00:04Z)
• Scalable Constant-Time Logical Gates for Large-Scale Quantum Computation Using Window-Based Correlated Decoding [11.657137510701165]
  A crucial challenge of fault-tolerant quantum computing is reducing the overhead of implementing logical gates.<n>We propose an architecture that employs delayed fixup circuits and window-based correlated decoding.<n>This design significantly reduces both the frequency and duration of decoding, while maintaining support for constant-time and universal logical gates.
  arXiv  Detail & Related papers  (2024-10-22T12:44:41Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• Algorithmic Fault Tolerance for Fast Quantum Computing [37.448838730002905]
  We show that fault-tolerant logical operations can be performed with constant time overhead for a broad class of quantum codes. We prove that the deviation from the ideal measurement result distribution can be made exponentially small in the code distance. Our work sheds new light on the theory of fault tolerance, potentially reducing the space-time cost of practical fault-tolerant quantum computation by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-25T15:43:25Z)
• Correlated decoding of logical algorithms with transversal gates [3.6520503393751524]
  We show that logical algorithms can be substantially improved by decoding qubits jointly to account for error propagation during entangling gates.<n>We numerically verify that this approach substantially reduces the space-time cost of deep logical Clifford circuits.
  arXiv  Detail & Related papers  (2024-03-05T19:13: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)
• Error Correction Code Transformer [92.10654749898927]
  We propose to extend for the first time the Transformer architecture to the soft decoding of linear codes at arbitrary block lengths. We encode each channel's output dimension to high dimension for better representation of the bits information to be processed separately. The proposed approach demonstrates the extreme power and flexibility of Transformers and outperforms existing state-of-the-art neural decoders by large margins at a fraction of their time complexity.
  arXiv  Detail & Related papers  (2022-03-27T15:25:58Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Optimal qubit assignment and routing via integer programming [0.22940141855172028]
  We consider the problem of mapping a logical quantum circuit onto a given hardware with limited two-qubit connectivity. We model this problem as an integer linear program, using a network flow formulation with binary variables. We consider several cost functions: an approximation of the fidelity of the circuit, its total depth, and a measure of cross-talk.
  arXiv  Detail & Related papers  (2021-06-11T15:02:26Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.