Approximate quantum error correction theory of non-isometric codes

• URL: http://arxiv.org/abs/2606.13559v1
• Date: Thu, 11 Jun 2026 16:42:06 GMT
• Title: Approximate quantum error correction theory of non-isometric codes
• Abstract summary: We present a general and systematic theory of non-isometric quantum error-correcting codes.<n>In particular, we employ the approximate quantum error correction framework to quantitatively study the fundamental limitations imposed by non-isometric encodings.
• Score: 4.1533777499443305
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Non-isometric encoding arises in various important contexts in quantum error correction, most notably in the finite-energy, non-ideal codewords inevitable in experimental realizations of continuous-variable codes, and holographic quantum gravity. In this work, we present a general and systematic theory of non-isometric quantum error-correcting codes. In particular, we employ the approximate quantum error correction framework to quantitatively study the fundamental limitations imposed by non-isometric encodings on the accuracy of quantum error correction and implementation of logical operations. We apply our theory to analyze GKP and tiger codes under energy constraints, and discuss the implications to holography.

Related papers

• Structure Theorem for Quantum Replacer Codes [5.5807436820313345]
  Quantum replacer codes are codes that can be protected from errors induced by a given set of quantum replacer channels.<n>We prove a structure theorem for such codes that synthesizes a variety of special cases with earlier theoretical work in quantum error correction.
  arXiv  Detail & Related papers  (2025-05-10T14:22:31Z)
• Compilation of a simple chemistry application to quantum error correction primitives [44.99833362998488]
  We estimate the resources required to fault-tolerantly perform quantum phase estimation on a minimal chemical example. We find that implementing even a simple chemistry circuit requires 1,000 qubits and 2,300 quantum error correction rounds.
  arXiv  Detail & Related papers  (2023-07-06T18:00:10Z)
• 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)
• Error Correction for Reliable Quantum Computing [0.0]
  We study a phenomenon exclusive to the quantum paradigm, known as degeneracy, and its effects on the performance of sparse quantum codes. We present methods to improve the performance of a specific family of sparse quantum codes in various different scenarios.
  arXiv  Detail & Related papers  (2022-02-17T11:26:52Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• On the logical error rate of sparse quantum codes [0.26249027950824505]
  We present an efficient coset-based method inspired by classical coding strategies to estimate degenerate errors. We show that the proposed method presents a computational advantage for the family of Calderbank-Shor-Steane codes.
  arXiv  Detail & Related papers  (2021-08-24T11:09:41Z)
• Linear programming bounds for quantum channels acting on quantum error-correcting codes [9.975163460952047]
  We introduce corresponding quantum weight enumerators that naturally generalize the Shor-Laflamme quantum weight enumerators. An exact weight enumerator completely quantifies the quantum code's projector, and is independent of the underlying noise process. Our framework allows us to establish the non-existence of certain quantum codes that approximately correct amplitude damping errors.
  arXiv  Detail & Related papers  (2021-08-10T03:56:25Z)
• Counteracting dephasing in Molecular Nanomagnets by optimized qudit encodings [60.1389381016626]
  Molecular Nanomagnets may enable the implementation of qudit-based quantum error-correction codes. A microscopic understanding of the errors corrupting the quantum information encoded in a molecular qudit is essential.
  arXiv  Detail & Related papers  (2021-03-16T19:21:42Z)
• New perspectives on covariant quantum error correction [3.3811802886738462]
  We prove new and powerful lower bounds on the infidelity of covariant quantum error correction. Explicit lower bounds are derived for both erasure and depolarizing noises. We also present a type of covariant codes which nearly saturates these lower bounds.
  arXiv  Detail & Related papers  (2020-05-25T04:33:59Z)
• 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)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48:53Z)

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.