Quantum memory based on concatenating surface codes and quantum Hamming codes

• URL: http://arxiv.org/abs/2407.16176v1
• Date: Tue, 23 Jul 2024 04:47:14 GMT
• Title: Quantum memory based on concatenating surface codes and quantum Hamming codes
• Authors: Menglong Fang, Daiqin Su,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Designing quantum error correcting codes that promise a high error threshold, low resource overhead and efficient decoding algorithms is crucial to achieve large-scale fault-tolerant quantum computation. The concatenated quantum Hamming code is one of the potential candidates that allows for constant space overhead and efficient decoding. We study the concatenation of surface codes with quantum Hamming codes as a quantum memory, and estimate its error threshold, resource overhead and decoding time. A high error threshold is achieved, which can in principle be pushed up to the threshold of the surface code. Furthermore, the concatenated codes can suppress logical errors to a much lower level than the surface codes, under the assumption of comparable amount of resource overhead. The advantage in suppressing errors starts to show for a quantum memory of intermediate scale. Concatenating surface codes with quantum Hamming codes therefore provides a promising avenue to demonstrate small-scale fault-tolerant quantum circuits in the near future, and also paves a way for large-scale fault-tolerant quantum computation.

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)
• Near-optimal decoding algorithm for color codes using Population Annealing [44.99833362998488]
  We implement a decoder that finds the recovery operation with the highest success probability. We study the decoder performance on a 4.8.8 color code lattice under different noise models.
  arXiv  Detail & Related papers  (2024-05-06T18:17:42Z)
• Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing [0.0]
  We propose high-rate small-size quantum error-detecting codes as a new family of high-rate quantum codes. Their simple structure allows for a geometrical interpretation using hypercubes corresponding to logical qubits. We achieve high error thresholds even in a circuit-level noise model.
  arXiv  Detail & Related papers  (2024-03-24T07:46:26Z)
• Small Quantum Codes from Algebraic Extensions of Generalized Bicycle Codes [4.299840769087443]
  Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance. We devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes.
  arXiv  Detail & Related papers  (2024-01-15T10:38:13Z)
• 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 computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
  This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
  arXiv  Detail & Related papers  (2022-12-03T06:16:07Z)
• 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)
• 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)
• 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)
• Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes [4.340338299803562]
  We propose a decoding algorithm for quantum codes based on quaternary BP with additional memory effects (called MBP) For MBP on the surface and toric codes over depolarizing errors, we observe error thresholds of 16% and 17.5%, respectively.
  arXiv  Detail & Related papers  (2021-04-28T09:30:04Z)
• 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.