Hierarchical quantum decoders

• URL: http://arxiv.org/abs/2601.21715v1
• Date: Thu, 29 Jan 2026 13:42:58 GMT
• Title: Hierarchical quantum decoders
• Authors: Nirupam Basak, Ankith Mohan, Andrew Tanggara, Tobias Haug, Goutam Paul, Kishor Bharti,
• Abstract summary: We propose a family of tunable quantum decoders with a trade-off between speed and accuracy.<n>This work bridges the gap between fast decodings and rigorous optimal decoding.
• Score: 3.312392076411996
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Decoders are a critical component of fault-tolerant quantum computing. They must identify errors based on syndrome measurements to correct quantum states. While finding the optimal correction is NP-hard and thus extremely difficult, approximate decoders with faster runtime often rely on uncontrolled heuristics. In this work, we propose a family of hierarchical quantum decoders with a tunable trade-off between speed and accuracy while retaining guarantees of optimality. We use the Lasserre Sum-of-Squares (SOS) hierarchy from optimization theory to relax the decoding problem. This approach creates a sequence of Semidefinite Programs (SDPs). Lower levels of the hierarchy are faster but approximate, while higher levels are slower but more accurate. We demonstrate that even low levels of this hierarchy significantly outperform standard Linear Programming relaxations. Our results on rotated surface codes and honeycomb color codes show that the SOS decoder approaches the performance of exact decoding. We find that Levels 2 and 3 of our hierarchy perform nearly as well as the exact solver. We analyze the convergence using rank-loop criteria and compare the method against other relaxation schemes. This work bridges the gap between fast heuristics and rigorous optimal decoding.

Related papers

• Optimal Decoding with the Worm [4.970364068620607]
  We propose a new decoder for matchable'' qLDPC codes that uses a MarkovChain MonteCarlo algorithm.<n>The algorithm is applicable to decoding random errors for the surface code, the honeycomb Floquet code, and hyperbolic surface codes with constant rate.
  arXiv  Detail & Related papers  (2026-03-05T17:51:27Z)
• Faster Optimal Decoder for Graph Codes with a Single Logical Qubit [3.530759252061682]
  We develop a class of stabilizer quantum error-correcting codes constructed from graph states.<n>We propose a faster decoder exploiting the structural properties of the underlying graph states.
  arXiv  Detail & Related papers  (2026-02-16T13:22:19Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  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.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Quantum-enhanced belief propagation for LDPC decoding [0.0]
  We introduce the quantum-enhanced belief propagation algorithm, which acts as a pre-processing step to belief propagation.<n>We study the possibility of having shared variational parameters between syndromes and, in this case, code lengths.
  arXiv  Detail & Related papers  (2024-12-11T18:14:18Z)
• Generalizing the matching decoder for the Chamon code [1.8416014644193066]
  We implement variations of a matching decoder for a three-dimensional, non-CSS, low-density parity check code known as the Chamon code.<n>We find that a generalized matching decoder that is augmented by a belief-propagation step prior to matching gives a threshold of 10.5% for depolarizing noise.
  arXiv  Detail & Related papers  (2024-11-05T19:00:12Z)
• Localized statistics decoding for quantum low-density parity-check codes [3.716393259548592]
  We introduce localized statistics decoding for arbitrary quantum low-density parity-check codes.<n>Our decoder is more amenable to implementation on specialized hardware, positioning it as a promising candidate for decoding real-time syndromes from experiments.
  arXiv  Detail & Related papers  (2024-06-26T18:00:09Z)
• Dependency-Aware Compilation for Surface Code Quantum Architectures [7.543907169342984]
  We study the problem of compiling quantum circuits for quantum computers implementing surface codes.<n>We solve this problem efficiently and near-optimally with a novel algorithm.<n>Our evaluation shows that our approach is powerful and flexible for compiling realistic workloads.
  arXiv  Detail & Related papers  (2023-11-29T19:36:19Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes [6.175503577352742]
  We propose a differentiable iterative decoder for quantum low-density parity-check (LDPC) codes. The proposed algorithm is composed of classical belief propagation (BP) decoding stages and intermediate graph neural network (GNN) layers.
  arXiv  Detail & Related papers  (2023-10-26T19:56:25Z)
• How to choose a decoder for a fault-tolerant quantum computer? The speed vs accuracy trade-off [48.73569522869751]
  We show how to choose the best decoder for a given quantum architecture. By analyzing the speed vs. accuracy tradeoff, we propose strategies to select the optimal stopping time. We illustrate our protocol for the surface code equipped with a desktop implementation of the PyMatching decoder.
  arXiv  Detail & Related papers  (2023-10-23T19:30:08Z)
• 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)
• 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)
• 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.