Entanglement-assisted quantum turbo codes
arXiv:1010.1256 · doi:10.1109/TIT.2013.2292052
Abstract
An unexpected breakdown in the existing theory of quantum serial turbo coding is that a quantum convolutional encoder cannot simultaneously be recursive and non-catastrophic. These properties are essential for quantum turbo code families to have a minimum distance growing with blocklength and for their iterative decoding algorithm to converge, respectively. Here, we show that the entanglement-assisted paradigm simplifies the theory of quantum turbo codes, in the sense that an entanglement-assisted quantum (EAQ) convolutional encoder can possess both of the aforementioned desirable properties. We give several examples of EAQ convolutional encoders that are both recursive and non-catastrophic and detail their relevant parameters. We then modify the quantum turbo decoding algorithm of Poulin et al., in order to have the constituent decoders pass along only "extrinsic information" to each other rather than a posteriori probabilities as in the decoder of Poulin et al., and this leads to a significant improvement in the performance of unassisted quantum turbo codes. Other simulation results indicate that entanglement-assisted turbo codes can operate reliably in a noise regime 4.73 dB beyond that of standard quantum turbo codes, when used on a memoryless depolarizing channel. Furthermore, several of our quantum turbo codes are within 1 dB or less of their hashing limits, so that the performance of quantum turbo codes is now on par with that of classical turbo codes. Finally, we prove that entanglement is the resource that enables a convolutional encoder to be both non-catastrophic and recursive because an encoder acting on only information qubits, classical bits, gauge qubits, and ancilla qubits cannot simultaneously satisfy them.
arXiv comment31 pages, software for simulating EA turbo codes is available at http://code.google.com/p/ea-turbo/ and a presentation is available at http://markwilde.com/publications/10-10-EA-Turbo.ppt ; v2, revisions based on feedback from journal; v3, modification of the quantum turbo decoding algorithm that leads to improved performance over results in v2 and the results of Poulin et al. in arXiv:0712.2888
References in corpus (52)
- Mixed State Entanglement and Quantum Error Correction
- Good Quantum Error-Correcting Codes Exist
- The capacity of the noisy quantum channel
- Stabilizer Codes and Quantum Error Correction
- Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
- Correcting Quantum Errors with Entanglement
- Sparse Graph Codes for Quantum Error-Correction
- Quantum Data Hiding
- Stabilizer Formalism for Operator Quantum Error Correction
- Quantum Channel Capacity of Very Noisy Channels
- A Unified and Generalized Approach to Quantum Error Correction
- The mother of all protocols: Restructuring quantum information's family tree
- A Resource Framework for Quantum Shannon Theory
- Subsystem fault tolerance with the Bacon-Shor code
- Optimal Entanglement Formulas for Entanglement-Assisted Quantum Coding
- A decoupling approach to the quantum capacity
- Degenerate Quantum Codes for Pauli Channels
- General entanglement-assisted quantum error-correcting codes
- A family of quantum protocols
- Entanglement required in achieving entanglement-assisted channel capacities
- Description of a quantum convolutional code
- Entanglement-assisted communication of classical and quantum information
- Optimal and Efficient Decoding of Concatenated Quantum Block Codes
- Convolutional and tail-biting quantum error-correcting codes
- Entanglement Increases the Error-Correcting Ability of Quantum Error-Correcting Codes
- Entanglement-Assisted Quantum Quasi-Cyclic Low-Density Parity-Check Codes
- Duality in Entanglement-Assisted Quantum Error Correction
- A father protocol for quantum broadcast channels
- High performance entanglement-assisted quantum LDPC codes need little entanglement
- Quantum Quasi-Cyclic LDPC Codes
- New lower bounds on the non-zero capacity of Pauli Channels
- Entanglement-assisted quantum low-density parity-check codes
- Quantum Error-Correcting Codes Need Not Completely Reveal the Error Syndrome
- Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
- Entanglement-Assisted Quantum Error-Correcting Codes with Imperfect Ebits
- Entanglement-Assisted Quantum Convolutional Coding
- Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes
- The quantum dynamic capacity formula of a quantum channel
- Quantum Error Correction beyond the Bounded Distance Decoding Limit
- Encoding One Logical Qubit Into Six Physical Qubits
- Classical Enhancement of Quantum Error-Correcting Codes
- Quantum Shift Register Circuits
- Unified Quantum Convolutional Coding
- Nonlocal quantum information in bipartite quantum error correction
- Correctable noise of Quantum Error Correcting Codes under adaptive concatenation
- Minimal-memory, non-catastrophic, polynomial-depth quantum convolutional encoders
- Quantum Convolutional Coding with Shared Entanglement: General Structure
- Extra Shared Entanglement Reduces Memory Demand in Quantum Convolutional Coding
- Recursive quantum convolutional encoders are catastrophic: A simple proof
- Entanglement generation with a quantum channel and a shared state
- Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes
- Minimal memory requirements for pearl-necklace encoders of quantum convolutional codes
Cited by in corpus (29)
- A Survey on Quantum Channel Capacities
- Catalytic quantum error correction
- Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators
- Multiplicativity of completely bounded -norms implies a strong converse for entanglement-assisted capacity
- Duality in Entanglement-Assisted Quantum Error Correction
- EXIT-Chart Aided Near-Capacity Quantum Turbo Code Design
- The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
- How Much Entanglement Does a Quantum Code Need?
- Performance of surface codes in realistic quantum hardware
- Near-Hashing-Bound Multiple-Rate Quantum Turbo Short-Block Codes
- Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems
- On the MacWilliams Identity for Classical and Quantum Convolutional Codes
- Multi-qubit time-varying quantum channels for NISQ-era superconducting quantum processors
- Two families of Entanglement-assisted quantum MDS codes from constacyclic codes
- Entanglement-assisted concatenated quantum codes
- Quantum outage probability for time-varying quantum channels
- Local Dimension Invariant Qudit Stabilizer Codes
- Asymmetric Quantum Concatenated and Tensor Product Codes with Large Z-Distances
- Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
- Entanglement-assisted quantum MDS codes from constacyclic codes with large minimum distance
- Singleton Bounds for Entanglement-Assisted Classical and Quantum Error Correcting Codes
- Two families of Entanglement-assisted Quantum MDS Codes from cyclic Codes
- Decoherence and Quantum Error Correction for Quantum Computing and Communications
- Entanglement-assisted Quantum Codes from Algebraic Geometry Codes
- Constructions of q-ary entanglement-assisted quantum MDS codes with minimum distance greater than q + 1
- Entanglement-Assisted Capacity of Quantum Channels with Side Information
- Entanglement-assisted codeword stabilized quantum codes with imperfect ebits
- Construction and Performance of Quantum Burst Error Correction Codes for Correlated Errors
- Extended quasi-cyclic constructions of quantum codes and entanglement-assisted quantum codes