Stabilizer Formalism for Operator Algebra Quantum Error Correction

• URL: http://arxiv.org/abs/2304.11442v2
• Date: Thu, 15 Feb 2024 18:54:30 GMT
• Title: Stabilizer Formalism for Operator Algebra Quantum Error Correction
• Authors: Guillaume Dauphinais, David W. Kribs and Michael Vasmer
• Abstract summary: We introduce a stabilizer formalism for the general quantum error correction framework called operator algebra quantum error correction (OAQEC) We formulate a theorem that fully characterizes the Pauli errors that are correctable for a given code. We show how some recent hybrid subspace code constructions are captured by the formalism.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a stabilizer formalism for the general quantum error correction framework called operator algebra quantum error correction (OAQEC), which generalizes Gottesman's formulation for traditional quantum error correcting codes (QEC) and Poulin's for operator quantum error correction and subsystem codes (OQEC). The construction generates hybrid classical-quantum stabilizer codes and we formulate a theorem that fully characterizes the Pauli errors that are correctable for a given code, generalizing the fundamental theorems for the QEC and OQEC stabilizer formalisms. We discover hybrid versions of the Bacon-Shor subsystem codes motivated by the formalism, and we apply the theorem to derive a result that gives the distance of such codes. We show how some recent hybrid subspace code constructions are captured by the formalism, and we also indicate how it extends to qudits.

Related papers

• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Quantum Error Transmutation [1.8719295298860394]
  We introduce a generalisation of quantum error correction, relaxing the requirement that a code should identify and correct a set of physical errors on the Hilbert space of a quantum computer exactly. We call these quantum error transmuting codes. They are of particular interest for the simulation of noisy quantum systems, and for use in algorithms inherently robust to errors of a particular character.
  arXiv  Detail & Related papers  (2023-10-16T11:09:59Z)
• 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)
• Measurement based estimator scheme for continuous quantum error correction [52.77024349608834]
  Canonical discrete quantum error correction (DQEC) schemes use projective von Neumann measurements on stabilizers to discretize the error syndromes into a finite set. Quantum error correction (QEC) based on continuous measurement, known as continuous quantum error correction (CQEC), can be executed faster than DQEC and can also be resource efficient. We show that by constructing a measurement-based estimator (MBE) of the logical qubit to be protected, it is possible to accurately track the errors occurring on the physical qubits in real time.
  arXiv  Detail & Related papers  (2022-03-25T09:07:18Z)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• Quantum minimal surfaces from quantum error correction [0.0]
  We show that complementary state-specific reconstruction of logical (bulk) operators is equivalent to the existence of a quantum minimal surface prescription for physical (boundary) entropies. We also formalize a definition of bulk reconstruction that we call "state-specific product unitary" reconstruction.
  arXiv  Detail & Related papers  (2021-09-29T18:00:00Z)
• Short Codes for Quantum Channels with One Prevalent Pauli Error Type [6.548580592686076]
  We investigate the design of stabilizer QECC able to correct a given number eg of generic Pauli errors, plus eZ Pauli errors of a specified type. These codes can be of interest when the quantum channel is asymmetric in that some types of error occur more frequently than others.
  arXiv  Detail & Related papers  (2021-04-09T13:51:51Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Algebraic Quantum Codes: Linking Quantum Mechanics and Discrete Mathematics [0.6091702876917279]
  We present a general framework of quantum error-correcting codes (QECCs) as a subspace of a complex Hilbert space. We illustrate how QECCs can be constructed using techniques from algebraic coding theory. We discuss secondary constructions for QECCs, leading to propagation rules for the parameters of QECCs.
  arXiv  Detail & Related papers  (2020-11-13T16:25:31Z)
• Modifying method of constructing quantum codes from highly entangled states [0.0]
  We provide explicit constructions for codewords, encoding procedure and stabilizer formalism of the QECCs. We modify the method to produce another set of stabilizer QECCs that encode a logical qudit into a subspace spanned by AME states.
  arXiv  Detail & Related papers  (2020-05-04T12:28:58Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.