Order-of-magnitude extension of qubit lifetimes with a decoherence-free subspace quantum error correction code

• URL: http://arxiv.org/abs/2503.22107v1
• Date: Fri, 28 Mar 2025 02:58:34 GMT
• Title: Order-of-magnitude extension of qubit lifetimes with a decoherence-free subspace quantum error correction code
• Authors: Shival Dasu, Ben Criger, Cameron Foltz, Justin A. Gerber, Christopher N. Gilbreth, Kevin Gilmore, Craig A. Holliman, Nathan K. Lysne, Alistair. R. Milne, Daichi Okuno, Grahame Vittorini, David Hayes,
• Abstract summary: We report on a robust quantum memory design using a decoherence-free subspace quantum error correction code.<n>The resulting encoding scheme is characterized for long probe times, and shown to extend the memory time by over an order of magnitude compared to physical qubits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Constructing an efficient and robust quantum memory is central to the challenge of engineering feasible quantum computer architectures. Quantum error correction codes can solve this problem in theory, but without careful design it can introduce daunting requirements that call for machines many orders of magnitude larger than what is available today. Bringing these requirements down can often be achieved by tailoring the codes to mitigate the specific forms of noise known to be present. Using a Quantinuum H1 quantum computer, we report on a robust quantum memory design using a concatenated code, with the low-level code designed to mitigate the dominant source of memory error, and a higher-level error correction scheme to enable robust computation. The resulting encoding scheme, known as a decoherence-free subspace quantum error correction code, is characterized for long probe times, and shown to extend the memory time by over an order of magnitude compared to physical qubits.

Related papers

• Hardware-Efficient Fault Tolerant Quantum Computing with Bosonic Grid States in Superconducting Circuits [0.0]
  This perspective manuscript describes how bosonic codes, particularly grid state encodings, offer a pathway to scalable fault-tolerant quantum computing. By leveraging the large Hilbert space of bosonic modes, quantum error correction can operate at the single physical unit level. We argue that it offers the shortest path to achieving fault tolerance in gate-based quantum computing processors with a MHz logical clock rate.
  arXiv  Detail & Related papers  (2024-09-09T17:20:06Z)
• Quantum memory based on concatenating surface codes and quantum Hamming codes [0.0]
  We study the concatenation of surface codes with quantum Hamming codes as a quantum memory. A high error threshold is achieved, which can in principle be pushed up to the threshold of the surface code. The advantage in suppressing errors starts to show for a quantum memory of intermediate scale.
  arXiv  Detail & Related papers  (2024-07-23T04:47:14Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• 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)
• Advantage of Quantum Neural Networks as Quantum Information Decoders [1.1842028647407803]
  We study the problem of decoding quantum information encoded in the groundspaces of topological stabilizer Hamiltonians. We first prove that the standard stabilizer-based error correction and decoding schemes work adequately perturbed well in such quantum codes. We then prove that Quantum Neural Network (QNN) decoders provide an almost quadratic improvement on the readout error.
  arXiv  Detail & Related papers  (2024-01-11T23:56:29Z)
• Single-shot decoding of good quantum LDPC codes [38.12919328528587]
  We prove that quantum Tanner codes facilitate single-shot quantum error correction (QEC) of adversarial noise. We show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round.
  arXiv  Detail & Related papers  (2023-06-21T18:00:01Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08: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)
• Quantum Error Correction via Noise Guessing Decoding [0.0]
  Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
  arXiv  Detail & Related papers  (2022-08-04T16:18:20Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• 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)
• 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)

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.