Bounds on concatenated entanglement-assisted quantum error-correcting codes

• URL: http://arxiv.org/abs/2412.16082v1
• Date: Fri, 20 Dec 2024 17:30:39 GMT
• Title: Bounds on concatenated entanglement-assisted quantum error-correcting codes
• Authors: Nihar Ranjan Dash, Sanjoy Dutta, R. Srikanth, Subhashish Banerjee,
• Abstract summary: Entment-assisted quantum error-correcting codes (EAQECCs) make use of pre-shared entanglement to enhance the rate of error correction and communication. We show how the order of concatenation affects the number of ebits consumed, the logical error probability, the pseudo-threshold, and the violation of the quantum Hamming bound.
• Score: 0.0
• License:
• Abstract: Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of pre-shared entanglement to enhance the rate of error correction and communication. We study the concatenation of EAQECCs, in specific showing how the order of concatenation affects the number of ebits consumed, the logical error probability, the pseudo-threshold, and the violation of the quantum Hamming bound. We find that if the quaternary code from which an EAQECC is derived saturates the Griesmer (resp., Plotkin) bound, then the derived code will saturate the Griesmer (resp., linear Plotkin) bound for EAQECCs. We present families of concatenated EAQECCs that saturate the quantum Singleton, Griesmer, and linear Plotkin bounds for EAQECCs.

Related papers

• Verifying Fault-Tolerance of Quantum Error Correction Codes [7.796308340803447]
  Large-scale fault-tolerant quantum computing still relies on quantum error correction code (QECC) to suppress noise. This paper formalizes the fault-tolerance of QECC implementations within the language of quantum programs.
  arXiv  Detail & Related papers  (2025-01-24T10:28:24Z)
• 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)
• Reliable Quantum Communications based on Asymmetry in Distillation and Coding [35.693513369212646]
  We address the problem of reliable provision of entangled qubits in quantum computing schemes. We combine indirect transmission based on teleportation and distillation; (2) direct transmission, based on quantum error correction (QEC) Our results show that ad-hoc asymmetric codes give, compared to conventional QEC, a performance boost and codeword size reduction both in a single link and in a quantum network scenario.
  arXiv  Detail & Related papers  (2023-05-01T17:13:23Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• 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)
• Entanglement-assisted concatenated quantum codes [77.34669920414821]
  Entanglement-assistedd quantum codes (EACQCs) constructed by concatenating two quantum codes are proposed. EACQCs show several advantages over the standard quantum codes (CQCs) EACQCs are not only competitive in quantum communication but also applicable in fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2022-02-16T14:14:02Z)
• 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)
• 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)
• Linear programming bounds for quantum amplitude damping codes [9.975163460952047]
  We introduce quantum weight enumerators for amplitude damping (AD) errors and work within the framework of approximate quantum error correction. This allows us to establish a linear program that is infeasible only when AQEC AD codes with corresponding parameters do not exist.
  arXiv  Detail & Related papers  (2020-01-12T18:46:59Z)

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.