Avoiding coherent errors with rotated concatenated stabilizer codes

• URL: http://arxiv.org/abs/2010.00538v2
• Date: Wed, 2 Jun 2021 13:05:28 GMT
• Title: Avoiding coherent errors with rotated concatenated stabilizer codes
• Abstract summary: We integrate stabilizer codes with constant-excitation codes by code concatenation. We analyze this code's potential as a quantum memory.
• Score: 6.85316573653194
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Coherent errors, which arise from collective couplings, are a dominant form of noise in many realistic quantum systems, and are more damaging than oft considered stochastic errors. Here, we propose integrating stabilizer codes with constant-excitation codes by code concatenation. Namely, by concatenating an $[[n,k,d]]$ stabilizer outer code with dual-rail inner codes, we obtain a $[[2n,k,d]]$ constant-excitation code immune from coherent phase errors and also equivalent to a Pauli-rotated stabilizer code. When the stabilizer outer code is fault-tolerant, the constant-excitation code has a positive fault-tolerant threshold against stochastic errors. Setting the outer code as a four-qubit amplitude damping code yields an eight-qubit constant-excitation code that corrects a single amplitude damping error, and we analyze this code's potential as a quantum memory.

Related papers

• Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes [45.91504150103373]
  We study a quantum error mitigation method known as probabilistic error cancellation in the context of the Gottesman-Kitaev-Preskill code.<n>We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations.
  arXiv  Detail & Related papers  (2026-09-15T12:29:45Z)
• Learning unknown stabilizer codes using product measurements [3.058685580689604]
  We present an algorithm that learns the stabilizer generators of any stabilizer code from $N$ copies of stabilizer states in its codespace.<n>We derive a lower bound on $N$ needed to recover the stabilizer generators with high probability, together with a bound on the algorithm's overall probability of success.
  arXiv  Detail & Related papers  (2026-09-04T11:08:46Z)
• Biased-Noise Quantum Reed-Solomon Codes and a Tornado Concatenation for Cat Qubits [0.9485024320296608]
  We build a bit-flip-only quantum Reed-Solomon (RS) code.<n>Errors are decoded by an optimal bounded-distance syndrome-lookup table.<n>Monte-Carlo simulation shows that at a physical bit-flip rate $p = 0.1$ the Tornado code reaches a logical error rate $p_L approx 5.3 times 10-3$, below both parent codes.
  arXiv  Detail & Related papers  (2026-07-14T09:42:53Z)
• Entanglement-assisted continuous-variable concatenated codes for encoding qubits or oscillators [0.0]
  We propose an EA version of the qubit-into-oscillatorsd code that chains an EA-stabilizer code with a GKP code.<n>We present a GKP coded with a three-qubit EA repetition code that uses two maximally entangled modes (emodes) and suppresses the variances of both position and momentum quadrature errors of a data mode.
  arXiv  Detail & Related papers  (2026-06-08T11:57:00Z)
• Error Correction of Beamsplitter-Generated Entangled GKP States [56.80803785296797]
  A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code.<n>We generate entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter.<n>We generate all four Bell states with an average fidelity of 69%, and demonstrate an extension of the entangled state lifetime through the use of quantum error correction.
  arXiv  Detail & Related papers  (2026-05-08T17:01:19Z)
• Asymptotically good bosonic Fock state codes: Exact and approximate [53.57134948897163]
  We show the equivalence of exact and approximate error correction for Fock state codes against random photon losses.<n>We also obtain families of good qudit PI codes as well as codes in monolithic nuclear state spaces.
  arXiv  Detail & Related papers  (2026-03-16T12:27:24Z)
• Stairway Codes: Floquetifying Bivariate Bicycle Codes and Beyond [41.99844472131922]
  Floquet codes define fault-tolerant protocols through periodic measurement sequences.<n>We introduce Stairway codes, a family of high-rate Floquet protocols.<n>We demonstrate logical error rates surpassing those of other Floquet codes at comparable encoding rates.
  arXiv  Detail & Related papers  (2026-02-27T19:00:00Z)
• Romanesco codes: Bias-tailored qLDPC codes from fractal codes [0.0]
  We introduce and analyze a family of Clifford-deformed bicycle codes that are tailored for biased noise.<n>Our qLDPC codes are defined on a bipartite hexagonal lattice with limited-range gates and low-weight stabilizers.<n>We find small examples with high encoding rate that perform well for a large range of bias.
  arXiv  Detail & Related papers  (2025-05-30T18:06:24Z)
• Quantum Dual Extended Hamming Code Immune to Collective Coherent Errors [0.5439020425819]
  We propose a new family of excitation stabilizer codes with parameters $[[2r+1, 2r-(r+1), 4]]$. Compared to the existing $[[20,1,4]]$ CE stabilizer code, our smallest instance, the $[[8,1,4]]$ CE stabilizer code, significantly reduces the number of physical qubits required.
  arXiv  Detail & Related papers  (2025-03-07T09:05:43Z)
• Efficient and Universal Neural-Network Decoder for Stabilizer-Based Quantum Error Correction [44.698141103370546]
  GraphQEC is a code-agnostic decoder leveraging machine-learning on the graph structure of stabilizer codes with linear time complexity.<n>Our approach represents the first universal solution for real-time quantum error correction across arbitrary stabilizer codes.
  arXiv  Detail & Related papers  (2025-02-27T10:56:53Z)
• Hardware-efficient quantum error correction via concatenated bosonic qubits [41.6475446744259]
  Quantum computers will need to incorporate quantum error correction, where a logical qubit is redundantly encoded in many noisy physical qubits.<n>Here, using a microfabricated superconducting quantum circuit, we realize a logical qubit memory formed from the concatenation of encoded bosonic cat qubits.<n>We study the performance and scaling of the logical qubit memory, finding that the phase-flip correcting repetition code operates below threshold.
  arXiv  Detail & Related papers  (2024-09-19T18:00:53Z)
• $\mathbb{USCD}$: Improving Code Generation of LLMs by Uncertainty-Aware Selective Contrastive Decoding [64.00025564372095]
  Large language models (LLMs) have shown remarkable capabilities in code generation. The effects of hallucinations (e.g., output noise) make it challenging for LLMs to generate high-quality code in one pass. We propose a simple and effective textbfuncertainty-aware textbfselective textbfcontrastive textbfdecoding.
  arXiv  Detail & Related papers  (2024-09-09T02:07:41Z)
• Noise-adapted qudit codes for amplitude-damping noise [6.320926638892934]
  We identify a $[4,1]$ qudit error correcting code tailored to protect against amplitude-damping noise. We show that this four-qudit code satisfies the error correction conditions for all single-qudit and a few two-qudit damping errors. We generalize this construction to a family of $[2M+2, M]$ qudit codes that can approximately correct all the single-qudit and a few two-qudit amplitude-damping errors.
  arXiv  Detail & Related papers  (2024-06-04T16:07:26Z)
• Tapestry of dualities in decohered quantum error correction codes [1.0301458191595498]
  Quantum error correction (QEC) codes protect quantum information from errors due to decoherence. Many of them also serve as prototypical models for exotic topological quantum matters. Investigating the behavior of the QEC codes under decoherence sheds light on not only the codes' robustness against errors but also new out-of-equilibrium quantum phases driven by decoherence.
  arXiv  Detail & Related papers  (2024-01-30T19:00:02Z)
• Concatenating quantum error-correcting codes with decoherence-free subspaces and vice versa [0.0]
  Quantum error-correcting codes (QECCs) and decoherence-free subspace (DFS) codes provide active and passive means to address certain types of errors. The concatenation of a QECC and a DFS code results in a degenerate code that splits into actively and passively correcting parts. We show that for sufficiently strongly correlated errors, the concatenation with the DFS as the inner code provides better entanglement fidelity.
  arXiv  Detail & Related papers  (2023-12-13T17:48:12Z)
• A family of permutationally invariant quantum codes [54.835469342984354]
  We show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes. For small $t$, these conditions can be used to construct new examples of codes by computer.
  arXiv  Detail & Related papers  (2023-10-09T02:37:23Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons [59.63080344946083]
  We show that a "dual-rail qubit" consisting of a pair of resonantly coupled transmons can form a highly coherent erasure qubit. We demonstrate mid-circuit detection of erasure errors while introducing $ 0.1%$ dephasing error per check. This work establishes transmon-based dual-rail qubits as an attractive building block for hardware-efficient quantum error correction.
  arXiv  Detail & Related papers  (2023-07-17T18:00:01Z)
• Local Probabilistic Decoding of a Quantum Code [0.0]
  flip is an extremely simple and maximally local classical decoder. Lowest-weight uncorrectable errors for this decoder are closer to correctable errors than to other uncorrectable errors. Introducing randomness into the decoder can allow it to correct these "uncorrectable" errors with finite probability.
  arXiv  Detail & Related papers  (2022-12-14T02:44:26Z)
• Error-correcting codes for fermionic quantum simulation [4.199246521960609]
  We present methodologies for fermions via qubit systems on a two-dimensional lattice algorithm. We identify a family of stabilizer codes suitable for fermion simulation. Our method can increase the code distances without decreasing the (fermionic) code rate.
  arXiv  Detail & Related papers  (2022-10-16T01:43:07Z)
• Qubit-oscillator concatenated codes: decoding formalism & code comparison [1.8759305308855916]
  Concatenating bosonic error-correcting codes with qubit codes can substantially boost the error-correcting power of the original qubit codes. GKP-stabilizer codes allow protection of a logical bosonic mode from fluctuations of the mode's conjugate variables. We develop efficient maximum-likelihood decoders for and analyze the performance of three different concatenations of codes.
  arXiv  Detail & Related papers  (2022-09-10T02:30:15Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)

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.