Related papers: Class of codes correcting absorptions and emissions

Class of codes correcting absorptions and emissions

URL: http://arxiv.org/abs/2410.03562v1
Date: Fri, 4 Oct 2024 16:14:03 GMT
Title: Class of codes correcting absorptions and emissions
Authors: Arda Aydin, Alexander Barg,
Abstract summary: We construct a family of quantum codes that protect against all emission, absorption, dephasing, and raising/lowering errors up to an arbitrary fixed order. We derive simplified error correction conditions for a general AE code and show that any permutation-invariant code that corrects $le t$ errors can be mapped to an AE code.
Score: 59.90381090395222
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We construct a general family of quantum codes that protect against all emission, absorption, dephasing, and raising/lowering errors up to an arbitrary fixed order. Such codes are known in the literature as absorption-emission (AE) codes. We derive simplified error correction conditions for a general AE code and show that any permutation-invariant code that corrects $\le t$ errors can be mapped to an AE code that corrects up to order-$t$ transitions. Carefully tuning the parameters of permutationally invariant codes, we construct several examples of efficient AE codes, hosted in systems with low total angular momentum. Our results also imply that spin codes can be mapped to AE codes, enabling us to characterize logical operators for certain subclasses of such codes.

Related papers

Unified and Generalized Approach to Entanglement-Assisted Quantum Error Correction [0.1398098625978622]
We introduce a framework for entanglement-assisted quantum error correcting codes called EAQEC, EAOQEC, and EACQ under a single umbrella. The unification is arrived at by viewing entanglement-assisted codes from the operator algebra quantum error correction perspective. We show how EACQ codes form a proper subclass of the entanglement-assisted subspace codes defined by EAOAQEC.
arXiv Detail & Related papers (2024-11-21T18:24:03Z)
Decoding Quasi-Cyclic Quantum LDPC Codes [23.22566380210149]
Quantum low-density parity-check (qLDPC) codes are an important component in the quest for fault tolerance. Recent progress on qLDPC codes has led to constructions which are quantumally good, and which admit linear-time decoders to correct errors affecting a constant fraction of codeword qubits. In practice, the surface/toric codes, which are the product of two repetition codes, are still often the qLDPC codes of choice.
arXiv Detail & Related papers (2024-11-07T06:25:27Z)
Learning Linear Block Error Correction Codes [62.25533750469467]
We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
arXiv Detail & Related papers (2024-05-07T06:47: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)
Machine Learning-Aided Efficient Decoding of Reed-Muller Subcodes [59.55193427277134]
Reed-Muller (RM) codes achieve the capacity of general binary-input memoryless symmetric channels. RM codes only admit limited sets of rates. Efficient decoders are available for RM codes at finite lengths.
arXiv Detail & Related papers (2023-01-16T04:11:14Z)
Grand Unification of continuous-variable codes [0.0]
Quantum error correction codes in continuous variables (also called CV codes, or single-mode bosonic codes) have been identified to be a technologically viable option for building fault-tolerant quantum computers. Best-known examples are the GKP code and the cat-code, both of which were shown to have some advantageous properties over any discrete-variable, or qubit codes. It was recently shown that the cat-code, as well as other kinds of CV codes, belong to a set of codes with common properties called rotation-symmetric codes.
arXiv Detail & Related papers (2022-06-03T18:00:01Z)
Bias-tailored quantum LDPC codes [3.565124653091339]
We introduce a bias-tailored lifted product code construction that provides the framework to expand bias-tailoring methods. We show that bias-tailored quantum low density parity check codes can be similarly bias-tailored. Our Monte Carlo simulations, performed under asymmetric noise, show that bias-tailored codes achieve several orders of magnitude improvement in their error suppression.
arXiv Detail & Related papers (2022-02-03T17:11:10Z)
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)
Permutation-Invariant Quantum Codes for Deletion Errors [3.8073142980733]
This paper presents conditions for constructing permutation-invariant quantum codes for deletion errors. Our codes give the first example of quantum codes that can correct two or more deletion errors.
arXiv Detail & Related papers (2021-02-05T06:17:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.