Quantum error-correcting codes via inner products and error bases

• URL: http://arxiv.org/abs/2506.04530v1
• Date: Thu, 05 Jun 2025 00:46:35 GMT
• Title: Quantum error-correcting codes via inner products and error bases
• Authors: Jorge R. Bolaños-Servín, Yuriko Pitones, Josué I. Rios-Cangas,
• Abstract summary: We address the problem of state communication in finite-level quantum systems through noise-affected channels.<n>Our approach is based on a self-consistent theory of decoding inner products associated with the code and error (or noise) bases defined on corrupting subspaces.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we address the problem of state communication in finite-level quantum systems through noise-affected channels. Our approach is based on a self-consistent theory of decoding inner products associated with the code and error (or noise) bases defined on corrupting subspaces. This viewpoint yields new necessary and sufficient conditions for the existence of quantum error-correcting codes in terms of these inner products. The obtained results extend the foundations of quantum error correction beyond classical analogies, highlighting the structural insights offered by operator theory and the underlying product space.

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)
• Advantage of Quantum Neural Networks as Quantum Information Decoders [1.1842028647407803]
  We study the problem of decoding quantum information encoded in the groundspaces of topological stabilizer Hamiltonians. We first prove that the standard stabilizer-based error correction and decoding schemes work adequately perturbed well in such quantum codes. We then prove that Quantum Neural Network (QNN) decoders provide an almost quadratic improvement on the readout error.
  arXiv  Detail & Related papers  (2024-01-11T23:56:29Z)
• 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)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Quantum Error Correction: Noise-adapted Techniques and Applications [2.122752621320654]
  Theory of quantum error correction provides a scheme by which the effects of such noise on quantum states can be mitigated. We focus on recent theoretical advances in the domain of noise-adapted QEC, and highlight some key open questions. We conclude with a review of the theory of quantum fault tolerance which gives a quantitative estimate of the physical noise threshold below which error-resilient quantum computation is possible.
  arXiv  Detail & Related papers  (2022-07-31T05:23:50Z)
• 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)
• 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)
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions [62.997667081978825]
  We present a study of crosstalk errors in a quantum-computing architecture based on a single string of ions confined by a radio-frequency trap, and manipulated by individually-addressed laser beams. This type of errors affects spectator qubits that, ideally, should remain unaltered during the application of single- and two-qubit quantum gates addressed at a different set of active qubits. We microscopically model crosstalk errors from first principles and present a detailed study showing the importance of using a coherent vs incoherent error modelling and, moreover, discuss strategies to actively suppress this crosstalk at the gate level.
  arXiv  Detail & Related papers  (2020-12-21T14:20:40Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• 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)
• Non-Pauli topological stabilizer codes from twisted quantum doubles [0.7734726150561088]
  We show that Abelian twisted quantum double models can be used for quantum error correction. The resulting codes are defined by non-Pauli commuting stabilizers, with local systems that can either be qubits or higher dimensional quantum systems.
  arXiv  Detail & Related papers  (2020-01-30T19:00:06Z)

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.