Entanglement-Assisted Quantum Turbo Codes
From MaRDI portal
Publication:5346124
DOI10.1109/TIT.2013.2292052zbMATH Open1364.81101DBLPjournals/tit/WildeHB14arXiv1010.1256OpenAlexW2040653896WikidataQ59832544 ScholiaQ59832544MaRDI QIDQ5346124FDOQ5346124
Authors: Mark M. Wilde, Min-Hsiu Hsieh, Zunaira Babar 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1010.1256
Cited In (22)
- Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity
- Maximal entanglement EAQECCs from cyclic and constacyclic codes over \(\mathbb{F}_q+v_1\mathbb{F}_q+\cdots +v_{s-1}\mathbb{F}_q\)
- Maximal entanglement-assisted quantum error correction codes from the skew group ring \(\mathbb{F}_4\rtimes_\varphi G\) by a heuristic search scheme
- Extended quasi-cyclic constructions of quantum codes and entanglement-assisted quantum codes
- Quantum codes and entanglement-assisted quantum codes derived from one-generator quasi-twisted codes
- Entanglement-assisted quantum MDS codes from constacyclic codes with large minimum distance
- Entanglement-assisted quantum MDS codes from negacyclic codes
- Entanglement-assisted quantum codes from matrix-product codes
- On the construction of new toric quantum codes and quantum burst-error-correcting codes
- On cyclic and negacyclic codes with one-dimensional hulls and their applications
- A construction of quantum turbo product codes based on CSS-type quantum convolutional codes
- Non-binary entanglement-assisted stabilizer codes
- Maximal entanglement entanglement-assisted quantum codes constructed from linear codes
- Constructing quantum error-correcting codes that require a variable amount of entanglement
- Several new families of MDS EAQECCs with much larger dimensions and related application to EACQCs
- Entanglement-Assisted Quantum Error-Correcting Codes
- Two families of entanglement-assisted quantum MDS codes from constacyclic codes
- Title not available (Why is that?)
- Construction of some new entanglement-assisted quantum error-correcting codes of large lengths
- Entanglement-assisted quantum codes from arbitrary binary linear codes
- Two families of entanglement-assisted quantum MDS codes from cyclic codes
- Some new families of entanglement-assisted quantum MDS codes derived from negacyclic codes
This page was built for publication: Entanglement-Assisted Quantum Turbo Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346124)
