Soft information decoding with superconducting qubits

• URL: http://arxiv.org/abs/2411.16228v1
• Date: Mon, 25 Nov 2024 09:41:25 GMT
• Title: Soft information decoding with superconducting qubits
• Authors: Maurice D. Hanisch, Bence Hetényi, James R. Wootton,
• Abstract summary: "Soft decoding" can raise the threshold by 25%, yielding up to 30 times lower error rates. We show that a single byte of information per measurement suffices to reach optimal decoding.
• Score: 0.0
• License:
• Abstract: Quantum error correction promises a viable path to fault-tolerant computations, enabling exponential error suppression when the device's error rates remain below the protocol's threshold. This threshold, however, strongly depends on the classical method used to decode the syndrome measurements. These classical algorithms traditionally only interpret binary data, ignoring valuable information contained in the complete analog measurement data. In this work, we leverage this richer "soft information" to decode repetition code experiments implemented on superconducting hardware. We find that "soft decoding" can raise the threshold by 25%, yielding up to 30 times lower error rates. Analyzing the trade-off between information volume and decoding performance we show that a single byte of information per measurement suffices to reach optimal decoding. This underscores the effectiveness and practicality of soft decoding on hardware, including in time-sensitive contexts such as real-time decoding.

Related papers

• Local Clustering Decoder: a fast and adaptive hardware decoder for the surface code [0.0]
  We introduce the Local Clustering Decoder as a solution that simultaneously achieves the accuracy and speed requirements of a real-time decoding system. Our decoder is implemented on FPGAs and exploits hardware parallelism to keep pace with the fastest qubit types. It enables one million error-free quantum operations with 4x fewer physical qubits when compared to standard non-adaptive decoding.
  arXiv  Detail & Related papers  (2024-11-15T16:43:59Z)
• Optimization of decoder priors for accurate quantum error correction [1.6681232959590244]
  We introduce a reinforcement learning inspired method for calibrating priors that aims to minimize the logical error rate. Our method significantly improves the decoding accuracy in repetition and surface code memory experiments executed on Google's Sycamore processor.
  arXiv  Detail & Related papers  (2024-06-04T18:26:09Z)
• Learning Linear Block Error Correction Codes [62.25533750469467]
  We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
  arXiv  Detail & Related papers  (2024-05-07T06:47:12Z)
• 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)
• Data-driven decoding of quantum error correcting codes using graph neural networks [0.0]
  We explore a model-free, data-driven, approach to decoding, using a graph neural network (GNN) We show that the GNN-based decoder can outperform a matching decoder for circuit level noise on the surface code given only simulated data. The results show that a purely data-driven approach to decoding may be a viable future option for practical quantum error correction.
  arXiv  Detail & Related papers  (2023-07-03T17:25:45Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• 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)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Improved quantum error correction using soft information [0.0]
  We consider methods to incorporate all of this richer information, typically called soft information, into the decoding of quantum error correction codes. We demonstrate these soft decoders outperform the standard (hard) decoders that can only access the binary measurement outcomes. We also introduce a soft measurement error model with amplitude damping, in which measurement time leads to a trade-off between measurement resolution and additional disturbance of the qubits.
  arXiv  Detail & Related papers  (2021-07-28T18:35:06Z)
• Efficient Concatenated Bosonic Code for Additive Gaussian Noise [0.0]
  Bosonic codes offer noise resilience for quantum information processing. We propose using a Gottesman-Kitaev-Preskill code to detect discard error-prone qubits and a quantum parity code to handle residual errors. Our work may have applications in a wide range of quantum computation and communication scenarios.
  arXiv  Detail & Related papers  (2021-02-02T08:01:30Z)

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.