Entanglement-Assisted Concatenated Quantum Codes: Parameters and Asymptotic Performance

• URL: http://arxiv.org/abs/2501.04921v1
• Date: Thu, 09 Jan 2025 02:22:21 GMT
• Title: Entanglement-Assisted Concatenated Quantum Codes: Parameters and Asymptotic Performance
• Authors: Jihao Fan, Wei Cheng, Gaojun Luo, Zhou Li, Meng Cao,
• Abstract summary: Entanglement-assistedd quantum codes (EACQCs) are constructed by concatenating two entanglement-assisted quantum error-correcting codes (EAQECCs) By selecting the inner and outer component codes carefully, it is able to construct state-of-the-art EACQCs with parameters better than previous quantum codes.
• Score: 33.75746203222285
• License:
• Abstract: Entanglement-assisted concatenated quantum codes (EACQCs) are constructed by concatenating two entanglement-assisted quantum error-correcting codes (EAQECCs). By selecting the inner and outer component codes carefully, it is able to construct state-of-the-art EACQCs with parameters better than previous quantum codes. In this work, we use almost maximum-distance-separable (MDS) codes and $\hbar$-MDS codes as the outer codes to construct EACQCs. Because the range of code length of almost MDS and $\hbar$-MDS codes is much more free than that of the commonly used MDS codes. We derive several families of new EACQCs with parameters better than the previously best known EAQECCs and standard quantum error-correcting codes (QECCs) of the same length and net transmissions. Moreover, we demonstrate that EACQCs are with maximal entanglement if both the inner and outer component codes are with maximal entanglement. As a result, we construct three new maximal-entanglement EACQCs which have optimal parameters. In addition, we present several new maximal-entanglement EACQCs whose minimum distance is only one less than the minimum distance of the optimal codes. In particular, we propose two new families of asymptotically good maximal-entanglement EACQCs with explicit constructions by using entanglement-assisted quantum algebraic geometry codes as the outer codes. At last, we prove that EACQCs can attain the quantum Gilbert-Varshamov bound for EAQECCs asymptotically.

Related papers

• Geometry of symplectic group and optimal EAQECC codes [4.992350404374237]
  A new type of link between geometry of symplectic group and entanglement-assisted (EA) quantum error-correcting codes (EAQECCs) is presented.
  arXiv  Detail & Related papers  (2025-01-26T09:58:20Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• m-QMDS codes over mixed alphabets via orthogonal arrays [1.5916374873447232]
  We propose a general method to construct $m$-QMDS codes over mixed alphabets. The codes have more flexibility in the choice of parameters, such as the alphabet sizes, length and dimension of the encoding state.
  arXiv  Detail & Related papers  (2024-06-15T13:23:17Z)
• The Road to Near-Capacity CV-QKD Reconciliation: An FEC-Agnostic Design [53.67135680812675]
  A new codeword-based QKD reconciliation scheme is proposed. Both the authenticated classical channel (ClC) and the quantum channel (QuC) are protected by separate forward error correction (FEC) coding schemes. The proposed system makes QKD reconciliation compatible with a wide range of FEC schemes.
  arXiv  Detail & Related papers  (2024-03-24T14:47:08Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• Quantum Error Correction via Noise Guessing Decoding [0.0]
  Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
  arXiv  Detail & Related papers  (2022-08-04T16:18:20Z)
• Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems [71.78056556634196]
  This paper unifiedly addresses two kinds of key quantum secure tasks, i.e., quantum versions of secret sharing (SS) and symmetric private information retrieval (SPIR) In particular, two kinds of quantum extensions of SS are known; One is the classical-quantum (CQ) setting, in which the secret to be sent is classical information and the shares are quantum systems. We newly introduce the third setting, i.e., the entanglement-assisted (EA) setting, which is defined by modifying the CQ setting with allowing prior entanglement between the dealer and the end-user who recovers the secret by
  arXiv  Detail & Related papers  (2022-05-29T10:28:04Z)
• 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)
• Asymmetric Quantum Concatenated and Tensor Product Codes with Large Z-Distances [27.90363292358871]
  We present a new construction of asymmetric quantum codes (AQCs) by combining classical tensord codes (CCs) with tensor product codes (TPCs) Most AQCTPCs are highly degenerate, which means they can correct many more errors than their classical counterparts. We generalize our concatenation scheme by using the generalized CCs and TPCs.
  arXiv  Detail & Related papers  (2020-12-01T02:43:24Z)

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.