Quantum XYZ cyclic codes for biased noise

• URL: http://arxiv.org/abs/2501.16827v1
• Date: Tue, 28 Jan 2025 10:06:31 GMT
• Title: Quantum XYZ cyclic codes for biased noise
• Authors: Zhipeng Liang, Fusheng Yang, Zhengzhong Yi, Xuan Wang,
• Abstract summary: In some quantum computing architectures, Pauli noise is highly biased. Tailoring Quantum error-correcting codes to the biased noise may benefit reducing the physical qubit overhead without reducing the logical error rate. We propose a family of quantum XYZ cyclic codes, which are the only one family of quantum cyclic codes with code distance increasing with code length.
• Score: 5.197632326399701
• License:
• Abstract: In some quantum computing architectures, Pauli noise is highly biased. Tailoring Quantum error-correcting codes to the biased noise may benefit reducing the physical qubit overhead without reducing the logical error rate. In this paper, we propose a family of quantum XYZ cyclic codes, which are the only one family of quantum cyclic codes with code distance increasing with code length to our best knowledge and have good error-correcting performance against biased noise. Our simulation results show that the quantum XYZ cyclic codes have $50\%$ code-capacity thresholds for all three types of pure Pauli noise and around $13\%$ code-capacity threshold for depolarizing noise. In the finite-bias regime, when the noise is biased towards Pauli $Z$ errors with noise bias ratios $\eta_Z=1000$, the corresponding code-capacity threshold is around $49\%$. Besides, we show that to reach the same code distance, the physical qubit overhead of XYZ cyclic code is much less than that of the XZZX surface code.

Related papers

• Demonstrating dynamic surface codes [138.1740645504286]
  We experimentally demonstrate three time-dynamic implementations of the surface code. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• 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)
• Noise-adapted qudit codes for amplitude-damping noise [6.320926638892934]
  We propose a class of qudit error correcting codes tailored to protect against amplitude-damping noise. Specifically, we construct a class of four-qudit codes that satisfies the error correction conditions for all single-qudit and a few two-qudit damping errors. For the $d=2$ case, our QEC scheme is identical to the known example of the $4$-qubit code and the associated syndrome-based recovery.
  arXiv  Detail & Related papers  (2024-06-04T16:07:26Z)
• Fault-tolerant hyperbolic Floquet quantum error correcting codes [0.0]
  We introduce a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes" One of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a $[[400,52,8]]$ code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.
  arXiv  Detail & Related papers  (2023-09-18T18:00:02Z)
• Noisy decoding by shallow circuits with parities: classical and quantum [0.0]
  We show that any classical circuit can correctly recover only a vanishingly small fraction of messages, if the codewords are sent over a noisy channel with positive error rate. We give a simple quantum circuit that correctly decodes the Hadamard code with probability $Omega(varepsilon2)$ even if a $(1/2 - varepsilon)$-fraction of a codeword is adversarially corrupted.
  arXiv  Detail & Related papers  (2023-02-06T15:37:32Z)
• 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)
• Tailored XZZX codes for biased noise [60.12487959001671]
  We study a family of codes having XZZX-type stabilizer generators. We show that these XZZX codes are highly qubit efficient if tailored to biased noise.
  arXiv  Detail & Related papers  (2022-03-30T17:26:31Z)
• 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)
• The XZZX Surface Code [2.887393074590696]
  We show that a variant of the surface code -- the XZZX code -- offers remarkable performance for fault-tolerant quantum computation. The error threshold of this code matches what can be achieved with random codes (hashing) for every single-qubit Pauli noise channel. We show that it is possible to maintain all of these advantages when we perform fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2020-09-16T18:00:01Z)
• 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.