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
- Authors: Yingkai Ouyang
- 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
- $\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) - 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.