Demonstrating real-time and low-latency quantum error correction with superconducting qubits

• URL: http://arxiv.org/abs/2410.05202v1
• Date: Mon, 7 Oct 2024 17:07:18 GMT
• Title: Demonstrating real-time and low-latency quantum error correction with superconducting qubits
• Authors: Laura Caune, Luka Skoric, Nick S. Blunt, Archibald Ruban, Jimmy McDaniel, Joseph A. Valery, Andrew D. Patterson, Alexander V. Gramolin, Joonas Majaniemi, Kenton M. Barnes, Tomasz Bialas, Okan Buğdaycı, Ophelia Crawford, György P. Gehér, Hari Krovi, Elisha Matekole, Canberk Topal, Stefano Poletto, Michael Bryant, Kalan Snyder, Neil I. Gillespie, Glenn Jones, Kauser Johar, Earl T. Campbell, Alexander D. Hill,
• Abstract summary: We demonstrate low-latency feedback with a scalable FPGA decoder integrated into a superconducting quantum processor. We observe logical error suppression as the number of decoding rounds is increased. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments.
• Score: 52.08698178354922
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correction (QEC) will be essential to achieve the accuracy needed for quantum computers to realise their full potential. The field has seen promising progress with demonstrations of early QEC and real-time decoded experiments. As quantum computers advance towards demonstrating a universal fault-tolerant logical gate set, implementing scalable and low-latency real-time decoding will be crucial to prevent the backlog problem, avoiding an exponential slowdown and maintaining a fast logical clock rate. Here, we demonstrate low-latency feedback with a scalable FPGA decoder integrated into the control system of a superconducting quantum processor. We perform an 8-qubit stability experiment with up to $25$ decoding rounds and a mean decoding time per round below $1$ ${\mu}s$, showing that we avoid the backlog problem even on superconducting hardware with the strictest speed requirements. We observe logical error suppression as the number of decoding rounds is increased. We also implement and time a fast-feedback experiment demonstrating a decoding response time of $9.6$ ${\mu}s$ for a total of $9$ measurement rounds. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments that go beyond purely keeping logical qubits alive and into demonstrating building blocks of fault-tolerant computation, such as lattice surgery and magic state teleportation.

Related papers

• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• Transversal CNOT gate with multi-cycle error correction [1.7359033750147501]
  A scalable and programmable quantum computer holds the potential to solve computationally intensive tasks that computers cannot accomplish within a reasonable time frame, achieving quantum advantage. The vulnerability of the current generation of quantum processors to errors poses a significant challenge towards executing complex and deep quantum circuits required for practical problems. Our work establishes the feasibility of employing logical CNOT gates alongside error detection on a superconductor-based processor using current generation quantum hardware.
  arXiv  Detail & Related papers  (2024-06-18T04:50:15Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook [0.8066496490637088]
  We highlight some of the key challenges facing the implementation of real-time decoders. We lay out our perspective for the future development and provide a possible roadmap for the field of real-time decoding.
  arXiv  Detail & Related papers  (2023-02-28T19:51:03Z)
• 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)
• Parallel window decoding enables scalable fault tolerant quantum computation [2.624902795082451]
  We present a methodology that parallelizes the decoding problem and achieves almost arbitrary syndrome processing speed. Our parallelization requires some classical feedback decisions to be delayed, leading to a slow-down of the logical clock speed. Using known auto-teleportation gadgets the slow-down can be eliminated altogether in exchange for increased qubit overhead.
  arXiv  Detail & Related papers  (2022-09-18T12:37:57Z)
• Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment [1.2189422792863451]
  We perform quantum error correction on superconducting qubits connected in a heavy-hexagon lattice. Full processor can encode a logical qubit with distance three and perform several rounds of fault-tolerant syndrome measurements. We show that the logical error varies depending on the use of a perfect matching decoder.
  arXiv  Detail & Related papers  (2022-03-14T15:44:11Z)
• 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)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• NISQ+: Boosting quantum computing power by approximating quantum error correction [6.638758213186185]
  We design a method to boost the computational power of near-term quantum computers. By approximating fully-fledged error correction mechanisms, we can increase the compute volume. We demonstrate a proof-of-concept that approximate error decoding can be accomplished online in near-term quantum systems.
  arXiv  Detail & Related papers  (2020-04-09T20:17:28Z)

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.