Entanglement-assisted concatenated quantum codes.

  title={Entanglement-assisted concatenated quantum codes.},
  author={Jihao Fan and Jun Li and Yongbin Zhou and Min-Hsiu Hsieh and H. Vincent Poor},
  journal={Proceedings of the National Academy of Sciences of the United States of America},
  volume={119 24},
  • Jihao Fan, Jun Li, H. Poor
  • Published 16 February 2022
  • Physics, Computer Science
  • Proceedings of the National Academy of Sciences of the United States of America
Entanglement-assisted concatenated quantum codes (EACQCs), constructed by concatenating two quantum codes, are proposed. These EACQCs show significant advantages over standard concatenated quantum codes (CQCs). First, we prove that, unlike standard CQCs, EACQCs can beat the nondegenerate Hamming bound for entanglement-assisted quantum error-correction codes (EAQECCs). Second, we construct families of EACQCs with parameters better than the best-known standard quantum error-correction codes… 

Figures and Tables from this paper


Correcting Quantum Errors with Entanglement
The entanglement-assisted quantum codes described do not require the dual-containing constraint necessary for standard quantum error–correcting codes, thus allowing us to “quantize” all of classical linear coding theory.
A Characterization of Entanglement-Assisted Quantum Low-Density Parity-Check Codes
As in classical coding theory, quantum analogs of low-density parity-check (LDPC) codes have offered good error correction performance and low decoding complexity by employing the
Efficient Quantum Polar Codes Requiring No Preshared Entanglement
An explicit quantum coding scheme which achieves a communication rate not less than the coherent information when used to transmit the quantum information over a noisy quantum channel and which can be used for secret key distillation as well as private channel coding is constructed.
High Performance Entanglement-Assisted Quantum LDPC Codes Need Little Entanglement
It is shown that the above conjecture is wrong by providing families of EAQECCs with an entanglement consumption rate that diminishes linearly as a function of the code length, and indicates that EAZECCs are not only theoretically interesting, but also physically implementable.
Constructions of q-ary entanglement-assisted quantum MDS codes with minimum distance greater than q+1
This paper constructs five classes of entanglement-assisted quantum MDS (EAQMDS) codes based on classical MDS codes by exploiting one or more pre-shared maximally entangled states, and shows that these EAQM DS codes have much larger minimum distance than the standard quantum M DS codes of the same length.
Asymmetric Entanglement-Assisted Quantum Error-Correcting Codes and BCH Codes
The concept of asymmetric entanglement-assisted quantum error-correcting code (asymmetric EAQECC) is introduced and a Gilbert-Varshamov bound is presented.
Catalytic Quantum Error Correction
The theory of entanglement-assisted quantum error-correcting (EAQEC) codes is developed, a generalization of the stabilizer formalism to the setting in which the sender and receiver have access to presharedEntanglement, which greatly simplifies their construction.
Exact performance of concatenated quantum codes
This paper describes a procedure for deriving the map between physical and effective channels that results from a given coding and recovery procedure, and shows that the map for a concatenation of codes is given by the composition of the maps for the constituent codes.
Optimal entanglement formulas for entanglement-assisted quantum coding
We provide several formulas that determine the optimal number of entangled bits (ebits) that a general entanglement-assisted quantum code requires. Our first theorem gives a formula that applies to
Entanglement-assisted quantum error-correcting codes with imperfect ebits
It is shown that any (nondegenerate) standard stabilizer code can be transformed into an EAQEC code that can correct errors on the qubits of both sender and receiver, and hence the decoding techniques of standard stabilizers codes can be applied.