Entanglement-Assisted Quantum Turbo Codes
Open accessThe DOI matches its Crossref record; 98 of the 98 references it cites were found in a registry or an index.
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 , 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 , 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Berrou, C., Glavieux, A., & Thitimajshima, P. (2002) · Proceedings of ICC '93 - IEEE International Conference on Communications · doi:10.1109/icc.1993.397441 · Cited by 6,738 · cited 1×
“…WH3 1/4 1/4 N5/7 PTO3 WH2 1/3 1/3 N3/4 PTO3 WH7 1/4 1/4 N3/4 PTO3 WH4 2/5 1/5 N3/4 PTO2 WH8 2/7 1/7 N5/7 PTO3 WH8 3/7 1/7 N3/4 PTO3 WH9 4/9 1/9 N3/4 PTO2 WH10 3/10 1/10 N5/7 WH11 WH3 1/2 1/4 N1/3 TABLE III VARIOUS COMBINATIONS OF ENCODERS FOR QUANTUM TURBO CODES AND THEIR MINIMUM DISTANCE SCALING.”
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
Bennett, C. H., & Wiesner, S. J. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2881 · Cited by 5,470 · cited 2×
“Also, the code loses its coset structure, so that C (I) is equal to the identity operator, C (L) is equivalent to just one logical operator, and the definition of the code’s minimum distance is the same as the classical definition.”
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272 · cited 1×
“The benchmarks for the performance of any standard or entanglement-assisted quantum code on a depolarizing channel are the hashing bounds [21], [54].”
Near optimum error correcting coding and decoding: turbo-codes
Berrou, C., & Glavieux, A. (1996) · IEEE Transactions on Communications · doi:10.1109/26.539767 · Cited by 2,761 · cited 1×
“first observed that the [[7, 1, 3]] Steane code is equivalent to a [[6, 1, 3; 1]] entanglementassisted code that can also correct a single error on Bob’s half of the ebit.”
Error Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677 · cited 1×
“That is, one could use the parity check matrix of a classical turbo code to build an EAQTC according to the well-known CSS construction [27], [28] and its entanglementassisted generalization [19], [20].”
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“That is, one could use the parity check matrix of a classical turbo code to build an EAQTC according to the well-known CSS construction [27], [28] and its entanglementassisted generalization [19], [20].”
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
Benedetto, S., Divsalar, D., Montorsi, G., & Pollara, F. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.669119 · Cited by 1,261
Unveiling turbo codes: some results on parallel concatenated coding schemes
Benedetto, S., & Montorsi, G. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485713 · Cited by 1,142 · cited 2×
“They are “probabilistic codes,” meaning that they possess sufficient structure to ensure efficient encoding and decoding, yet they have enough randomness to allow for analysis of their performance with the probabilistic method [2], [4], [5].”
Convolutional Codes and Their Performance in Communication Systems
Viterbi, A. (1971) · IEEE Transactions on Communication Technology · doi:10.1109/tcom.1971.1090700 · Cited by 1,012
Research works printed but not linked: 9
- [64] C.-Y. Lai, T. A. Brun, and M. M. Wilde, 'Dualities and identities for entanglement-assisted quantum codes,' October 2010, arXiv:1010.5506. - · arXiv
- [65] M. M. Wilde, 'EA-Turbo,' http://code.google.com/p/ea-turbo/, September 2010, Matlab and MEX software for characterizing and simulating entanglement-assisted quantum turbo codes (source code available under a GPL license). -
- [53] Z. Babar, S. X. Ng, and L. Hanzo, 'Convergence analysis of quantum turbo codes using EXIT charts,' 2013, unpublished manuscript. -
- [15] D. Poulin, 'Iterative quantum coding schemes: LDPC and turbo codes,' Online Presentation, April 2009, slide 92. [Online]. Available: http://www.physique.usherbrooke.ca/ { ∼ } dpoulin/Documents/IDQC09 { } McGill.pdf -
- [16] H. Ollivier, D. Poulin, and J.-P. Tillich, 'Quantum turbo codes,' October 2008, unpublished manuscript. -
- [18] J.-P. Tillich, 'Quantum codes suitable for iterative decoding,' Online presentation, May 2009. [Online]. Available: http: //www.infres.enst.fr/ { ∼ } markham/QuPa/28May/exposeJPTillich.pdf -
- [8] P. W. Shor, 'The quantum channel capacity and coherent information,' in Lecture Notes, MSRI Workshop on Quantum Computation , 2002. -
- [46] R. J. McEliece, Communications and Coding (P. G. Farrell 60th birthday celebration) . New York: John Wiley & Sons, 1998, ch. How to Compute Weight Enumerators for Convolutional Codes, pp. 121-141. -
- [48] R. J. McEliece, The Theory of Information and Coding . Cambridge University Press, 2002. -
Cited by
Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
“…this quantum entangled based communication [139], [140], there are recent attempts in developing quantum entanglement-assisted quantum turbo codes [141] and the squashed entanglement of a quantum channel, which is an additive function of a tensor product of any two quantum channels [142]. b:…”
BackgroundInfluentialA Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
“It was suggested that the employment of entanglement assistance is capable of further improving the performance of QECCs [442], [540] in the context of the so-called symmetric depolarizing channel, which has been routinely used in theoretical studies.”
BackgroundMethodInfluentialCatalytic Quantum Error Correction
Brun, T. A., Devetak, I., & Hsieh, M.-H. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2313559 · Cited by 145
Self-citationLai, C., & Ashikhmin, A. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2711601 · Cited by 116
“These codes have some advantages over standard stabilizer codes [19], [20], [21], [22].”
Gupta, M. K., & Wilde, M. M. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-2212-9 · Cited by 113
“Furthermore, entanglement assistance helps to resolve technical problems that arise in the construction of quantum LDPC [23,24] and turbo codes [48].”
Self-citationFan, J., Chen, H., & Xu, J. (2016) · Quantum Information and Computation · doi:10.26421/qic16.5-6-2 · Cited by 97
“Currently, many works have focused on the construction of binary EAQECCs based on classical binary or quaternary linear codes, see [5, 6, 7, 8, 9, 10], since binary QECCs might be the most useful ones in the future quantum computers and quantum communications.”
BackgroundDuality in Entanglement-Assisted Quantum Error Correction
Lai, C., Brun, T. A., & Wilde, M. M. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2246274 · Cited by 85
Self-citationDuality of Quantum and Classical Error Correction Codes: Design Principles and Examples
Babar, Z., Chandra, D., Nguyen, H. V., Botsinis, P., Alanis, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2861361 · Cited by 82
“Similarly, EA-QCCs can be concurrently recursive as well as non-catastrophic [130], [131].”
BackgroundInfluentialSelf-citationQuantum Rate Distortion, Reverse Shannon Theorems, and Source-Channel Separation
Datta, N., Hsieh, M.-H., & Wilde, M. M. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2215575 · Cited by 75
Self-citationMitigating 5G security challenges for next-gen industry using quantum computing
Mangla, C., Rani, S., Qureshi, N. M. F., & Singh, A. D. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.07.009 · Cited by 71
“Along with entangled based communication Devetak and Shor (2005); Hsieh and Wilde (2010), quantum-entanglement-assisted turbo codes Wilde et al. (2013) and two quantum channels having additive function providing tensor product Takeoka et al. (2014).”
Entanglement-assisted quantum MDS codes from constacyclic codes with large minimum distance
Lü, L., Ma, W., Li, R., Ma, Y., Liu, Y., & Cao, H. (2018) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2018.06.012 · Cited by 69
Entanglement-assisted quantum error-correcting codes with imperfect ebits
Lai, C., & Brun, T. A. (2012) · Physical Review A · doi:10.1103/physreva.86.032319 · Cited by 66
EXIT-Chart-Aided Near-Capacity Quantum Turbo Code Design
Babar, Z., Ng, S. X., & Hanzo, L. (2015) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2014.2328638 · Cited by 51
“[10], [11] proposed to employ entanglement-assisted inner codes, which are recursive and noncatastrophic.”
BackgroundMethodResultInfluentialSelf-citationEntanglement-assisted quantum MDS codes from negacyclic codes
Lü, L., Li, R., Guo, L., Ma, Y., & Liu, Y. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1838-5 · Cited by 63
“12 (2) produces 1-ebits EA-quantum MDS codes with parameters [[106, 105, 2; 1]]23, [[106, 101, 4; 1]]23, [[106, 97, 6; 1]]23, [[106, 93, 8; 1]]23, [[106, 89, 10; 1]]23, [[106, 85, 12; 1]]23, [[106, 81, 14; 1]]23, [[106, 77, 16; 1]]23 for d even; 4-ebits EA-quantum MDS codes with parameters [[106, 90, 11; 4]]23, [[106,…”
Maximal entanglement entanglement-assisted quantum codes constructed from linear codes
Lü, L., Li, R., Guo, L., & Fu, Q. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0830-y · Cited by 62
“In [17], a [20, 5, 12] zero radical code is constructed from projective cap.”
BackgroundInfluentialTime-varying quantum channel models for superconducting qubits
Martínez, J. E., Fuentes, P., Crespo, P. M., & Garcia‐Frias, J. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00448-5 · Cited by 61
“Note that in this context these probabilities are realizations of the random processes16,24: pIðω; tÞ ¼ 1 pxðω; tÞ pyðω; tÞ pzðω; tÞ; pxðω; tÞ ¼ pyðω; tÞ ¼ 14 ð1 e t T1ðω;tÞÞ and pzðω; tÞ ¼ 14 ð1þ e t T1 ðω;tÞ 2e t2T1ðω;tÞÞ: (7) For the TVAPD channel, the TVAPDPTA approximation is described by the realizations of the…”
InfluentialCao, M. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3117562 · Cited by 61
“In [56], Wilde et al. revealed that entanglement assistance can simplify the theory of quantum turbo codes in several important manners and they also examined the effect on the performance of these codes with the help of entanglement assistance.”
Degeneracy and Its Impact on the Decoding of Sparse Quantum Codes
Fuentes, P., Martínez, J. E., Crespo, P. M., & Garcia‐Frias, J. (2021) · IEEE Access · doi:10.1109/access.2021.3089829 · Cited by 61
“Such strategies make use of pre-shared Bell states to reduce the degenerate content of a quantum code to the point that, depending on the amount of pre-shared information, the scenario becomes increasingly similar to that of classical decoding [27].”
BackgroundConstructing quantum error-correcting codes that require a variable amount of entanglement
Luo, G., Ezerman, M. F., Grassl, M., & Ling, S. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04211-x · Cited by 60
Quantum Information Processing, Sensing, and Communications: Their Myths, Realities, and Futures
Hanzo, L., Babar, Z., Cai, Z., Chandra, D., Djordjević, I. B., Koczor, B., Ng, S. X., Razavi, M., & Simeone, O. (2025) · Proceedings of the IEEE · doi:10.1109/jproc.2024.3510394 · Cited by 54
Self-citationDirect Quantum Communications in the Presence of Realistic Noisy Entanglement
Chandra, D., Cacciapuoti, A. S., Caleffi, M., & Hanzo, L. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3122786 · Cited by 54
“In quantum computing applications, the quantum information is usually protected with the aid of noise-free auxiliary qubits, which may also take form of pre-shared entanglement [19]–[21], [23]–[25].”
BackgroundMethodThe learnability of unknown quantum measurements
Cheng, H., Hsieh, M.-H., & Yeh, P. (2016) · Quantum Information and Computation · doi:10.26421/qic16.7-8-4 · Cited by 51
Self-citationDas, B. R., Hasan, S. R., Sabuj, S. R., Hossain, M. A., & Ray, S. K. (2025) · International Journal of Intelligent Networks · doi:10.1016/j.ijin.2025.06.001 · Cited by 49
The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
Babar, Z., Botsinis, P., Alanis, D., Ng, S. X., & Hanzo, L. (2015) · IEEE Access · doi:10.1109/access.2015.2405533 · Cited by 41
“…and to facilitate the design of hashing bound approaching QTCs, the application of classical non-binary EXIT charts of [97] was extended to QTCs. Decoding 2014 Wilde et al. [34] The iterative decoding algorithm of [33], [39] failed to yield performance similar to the classical turbo codes.”
BackgroundMethodInfluentialSelf-citationMartínez, J. E., Fuentes, P., Crespo, P. M., & Garcia‐Frias, J. (2020) · IEEE Access · doi:10.1109/access.2020.3025619 · Cited by 41
Performance of surface codes in realistic quantum hardware
iOlius, A. D., Martínez, J. E., Fuentes, P., Crespo, P. M., & Garcia‐Frias, J. (2022) · Physical Review A · doi:10.1103/physreva.106.062428 · Cited by 38
Quantum Error Correction Protects Quantum Search Algorithms Against Decoherence
Botsinis, P., Babar, Z., Alanis, D., Chandra, D., Nguyen, H. V., Ng, S. X., & Hanzo, L. (2016) · Scientific Reports · doi:10.1038/srep38095 · Cited by 37
“…more complex quantum error correction codes, such as the Quantum Low-Density Parity-Check (QLDPC) codes 28,49 , or the Quantum Turbo Code (QTC) 23,25,50 , may be employed for operating close to the Hashing bound in large-scale quantum systems, where multiple quantum computing algorithms will…”
BackgroundInfluentialSelf-citationSampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems
Xiong, Y., Chandra, D., Ng, S. X., & Hanzo, L. (2020) · IEEE Access · doi:10.1109/access.2020.3045016 · Cited by 36
EXIT-Chart Aided Quantum Code Design Improves the Normalised Throughput of Realistic Quantum Devices
Nguyen, H. V., Babar, Z., Alanis, D., Botsinis, P., Chandra, D., Ng, S. X., & Hanzo, L. (2016) · IEEE Access · doi:10.1109/access.2016.2591910 · Cited by 34
“Additionally, to the best of authors’ knowledge contributions on entanglement assisted quantum coding schemes [11], [12], [26] and on the quantum depolarizing channel capacity [9], [24], [25], [32] only considered symmetric quantum depolarizing channels.”
BackgroundMethodInfluentialSelf-citationEntanglement-Assisted Quantum Codes from Cyclic Codes
Pereira, F. R. F., & Mancini, S. (2022) · Entropy · doi:10.3390/e25010037 · Cited by 28
“(By the EA quantum hashing bound is intended the quantum communication rate given by 1− (1)2 [p(log2 3− log2 p) − (1− p) log2(1− p)] for a depolarizing channel characterized by depolarizing parameter p [17].”
BackgroundStabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
Shi, Y. B., Patil, A., & Guha, S. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010339 · Cited by 26
Approaching the Quantum Singleton Bound with Approximate Error Correction
Bergamaschi, T., Golowich, L., & Gunn, S. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649680 · Cited by 27
Near-Hashing-Bound Multiple-Rate Quantum Turbo Short-Block Codes
Chandra, D., Babar, Z., Ng, S. X., & Hanzo, L. (2019) · IEEE Access · doi:10.1109/access.2019.2911515 · Cited by 26
Self-citationEntanglement-assisted quantum codes from algebraic geometry codes
Pereira, F. R. F., Pellikaan, R., Guardia, G. G. L., & de Assis, F. (2019) · TU/e Research Portal · Cited by 25
Entanglement-assisted concatenated quantum codes
Fan, J., Li, J., Zhou, Y., Hsieh, M.-H., & Poor, H. V. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2202235119 · Cited by 23
“Then, we can derive an EACQC with parameters Qe = [[68, 10, 18; 8]].”
Self-citationChandra, D., Babar, Z., Nguyen, H. V., Alanis, D., Botsinis, P., Ng, S. X., & Hanzo, L. (2017) · IEEE Access · doi:10.1109/access.2017.2716367 · Cited by 22
Self-citationPereg, U., Deppe, C., & Boche, H. (2021) · mediaTUM (Technical University of Munich) · doi:10.1109/tit.2021.3050529 · Cited by 21
The Entanglement-Assisted Communication Capacity Over Quantum Trajectories
Chandra, D., Caleffi, M., & Cacciapuoti, A. S. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3122962 · Cited by 21
“Definition 4 (The Bottleneck Capacity [23], [59]): The communication capacity over classical trajectory of two quantum channels is upper-bounded by”
BackgroundMinimal-Memory, Noncatastrophic, Polynomial-Depth Quantum Convolutional Encoders
Houshmand, M., Hosseini-Khayat, S., & Wilde, M. M. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2220520 · Cited by 21
Self-citationMultiqubit time-varying quantum channels for NISQ-era superconducting quantum processors
Martínez, J. E., Fuentes, P., iOlius, A. D., Garcia‐Frias, J., Fonollosa, J. R., & Crespo, P. M. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033055 · Cited by 20
“The QTC is decoded via the decoding algorithm presented in [13, 14], which combines two Soft-In Soft-Out (SISO) decoders.”
MethodDepolarizing Channel Mismatch and Estimation Protocols for Quantum Turbo Codes
Martínez, J. E., Crespo, P. M., & Garcia‐Frias, J. (2019) · Entropy · doi:10.3390/e21121133 · Cited by 20
“Entanglement-assistance (EA) was invoked in [4] as the resource needed in order to overcome the fact that unassisted QCCs cannot be both non-catastrophic and recursive simultaneously [5].”
BackgroundMethodInfluentialLocal-dimension-invariant qudit stabilizer codes
Gunderman, L. G. (2020) · Physical Review A · doi:10.1103/physreva.101.052343 · Cited by 19
“[13] Mark M Wilde, Min-Hsiu Hsieh, and Zunaira Babar.”
BackgroundMethodFuentes, P., Martínez, J. E., Crespo, P. M., & Garcia‐Frias, J. (2020) · Physical Review A · doi:10.1103/physreva.102.012423 · Cited by 20
A Survey of Quantum Deep Reinforcement Learning for Resource Allocation in Future Wireless Networks
Astiti, N. M. E. P., & Lee, B. M. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3638435 · Cited by 18
“For instance, in digital twin-enabled IoV networks, QDRL suffers from scalability bottlenecks and reliance on the accuracy of digital twin representations, which may degrade performance in dynamic vehicular environments [190].”
InfluentialOn the MacWilliams Identity for Classical and Quantum Convolutional Codes
Lai, C., Hsieh, M.-H., & Lu, H.-F. F. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2585641 · Cited by 18
“The WAMs and free distance enumerators of QCCs are defined accordingly and the y function like the classical counterparts [27], [28], [29] .”
BackgroundSelf-citationConstruction and Performance of Quantum Burst Error Correction Codes for Correlated Errors
Fan, J., Hsieh, M.-H., Chen, H., Chen, H. H., & Li, Y. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437493 · Cited by 17
Self-citationEntanglement-Assisted Quantum Codes From Algebraic Geometry Codes
Pereira, F. R. F., Pellikaan, R., Guardia, G. G. L., & de Assis, F. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3113367 · Cited by 17
On the Performance of Interleavers for Quantum Turbo Codes
Martínez, J. E., Crespo, P. M., & Garcia‐Frias, J. (2019) · Entropy · doi:10.3390/e21070633 · Cited by 15
“However, these QTC codes present error floors that are higher than in the original distance-spectra-based codes in Reference [6].”
BackgroundMethodInfluentialTwo Families of Entanglement-Assisted Quantum MDS Codes from Constacyclic Codes
Lü, L., Ma, W., & Guo, L. (2020) · International Journal of Theoretical Physics · doi:10.1007/s10773-020-04433-0 · Cited by 15
“codes with good parameters, see [4,6–11,13–16,31–41] .”
Recursive Quantum Convolutional Encoders are Catastrophic: A Simple Proof
Houshmand, M., & Wilde, M. M. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2272932 · Cited by 14
“Quantum turbo codes have linear encoding and decoding complexity, and they are known (from numerical simulations) to exhibit good performance when the noisy channel is a depolarizing channel [8, 11].”
BackgroundSelf-citationEntanglement-assisted quantum codes from quaternary codes of dimension five
Lü, L., Li, R., & Guo, L. (2017) · International Journal of Quantum Information · doi:10.1142/s0219749917500174 · Cited by 14
Pereg, U., Deppe, C., & Boche, H. (2021) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw46852.2021.9457622 · Cited by 14
“Further work on entanglement-assisted communication can be found in [77–85] and references therein.”
BackgroundDecoherence and quantum error correction for quantum computing and communications.
Martínez, J. E., & de Navarra, U. (2022) · Depósito Académico Digital Universidad de Navarra (University of Navarra) · doi:10.15581/10171/63013 · Cited by 14
Serially Concatenated Unity-Rate Codes Improve Quantum Codes Without Coding-Rate Reduction
Babar, Z., Nguyen, H. V., Botsinis, P., Alanis, D., Chandra, D., Ng, S. X., & Hanzo, L. (2016) · IEEE Communications Letters · doi:10.1109/lcomm.2016.2593874 · Cited by 13
“However, QCCs cannot be recursive and non-catastrophic at the same time [3].”
BackgroundMethodSelf-citationDesign and Analysis of a Low-Complexity Decoding Algorithm for Spinal Codes
Hu, Y., Liu, R., Bian, H., & Lyu, D. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2901495 · Cited by 13
“Rateless codes, unlike fixed rate codes [5]–[7], do not need to frequently switch between different coding matrices and modulation modes.”
BackgroundDesign of low-density-generator-matrix–based quantum codes for asymmetric quantum channels
Fuentes, P., Martínez, J. E., Crespo, P. M., & Garcia‐Frias, J. (2021) · Physical Review A · doi:10.1103/physreva.103.022617 · Cited by 14
Recursive quantum convolutional encoders are catastrophic: A simple proof
Houshmand, M., & Wilde, M. M. (2013) · Civil War Book Review · Cited by 13
Self-citationAsymmetric Entanglement-Assisted Quantum MDS Codes Constructed from Constacyclic Codes
Chen, J., Fang, W., Zhou, S., Qiu, J. F., Zhang, C., Xu, Y., Zeng, B., & Chen, Y. (2023) · Entropy · doi:10.3390/e25121603 · Cited by 12
“…quantum error-correcting (EAQEC) codes breaks the limitation of the dual-containing condition previously required by stabilizer codes, which alleviates the challenges in determining the dual-containing condition necessary for modern codes such as LDPC codes [6] and Turbo codes [7].”
BackgroundPauli Channel Online Estimation Protocol for Quantum Turbo Codes
Martínez, J. E., Fuentes, P., Crespo, P. M., & Garcia‐Frias, J. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00023 · Cited by 12
“Based on S x 2 and S x 1 , as well as the channel depolarization probability P ch ( P 2 ) , both SISO decoders engage in degenerate iterative decoding [5], [21] to estimate the most likely error coset ˜ L 1 that has corrupted the information quantum state.”
Quantum outage probability for time-varying quantum channels
Martínez, J. E., Fuentes, P., Crespo, P. M., & Garcia‐Frias, J. (2022) · Physical Review A · doi:10.1103/physreva.105.012432 · Cited by 11
Construction of some new entanglement-assisted quantum error-correcting codes of large lengths
Cao, M., & Wei, F. (2024) · Discrete Mathematics · doi:10.1016/j.disc.2024.113969 · Cited by 10
Quantum Codes and Entanglement-Assisted Quantum Codes Derived from One-Generator Quasi-Twisted Codes
Yao, Y., Ma, Y., & Lv, J. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04732-0 · Cited by 10
Asymmetric Quantum Concatenated and Tensor Product Codes With Large Z-Distances
Fan, J., Li, J., Wang, J., Wei, Z., & Hsieh, M.-H. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3064566 · Cited by 10
Self-citationOn cyclic and negacyclic codes with one-dimensional hulls and their applications
Dougherty, S. T., & Şahinkaya, S. (2022) · Advances in Mathematics of Communications · doi:10.3934/amc.2022096 · Cited by 10
Singleton Bounds for Entanglement-Assisted Classical and Quantum Error Correcting Codes
Mamindlapally, M., & Winter, A. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3277808 · Cited by 10
“Indeed, since their proposal, EAQECC have enjoyed considerable attention from coding theorists, both in the block coding and the convolutional coding setting [2], [10], [14], [22], [23], [28], [40].”
BackgroundOn the Logical Error Rate of Sparse Quantum Codes
Fuentes, P., Martínez, J. E., Crespo, P. M., & Garcia‐Frias, J. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3196609 · Cited by 10
“turbo codes (QTC) and quantum topological codes [10], [35], [36], [37], [38].”
BackgroundQuantum Turbo Decoding for Quantum Channels Exhibiting Memory
Mohd Izhar, M. A., Babar, Z., Nguyen, H. V., Botsinis, P., Alanis, D., Chandra, D., Ng, S. X., & Hanzo, L. (2018) · IEEE Access · doi:10.1109/access.2018.2808373 · Cited by 9
“EXIT curves of the inner decoder of the existing QTC and the proposed QTC-EEC for the ‘‘PTO1R’’ configuration of [10] for transmission over depolarizing channels having different μ evaluated at p = 0.”
BackgroundMethodInfluentialSelf-citationPerformance of non-CSS LDGM-based quantum codes over the misidentified depolarizing channel
Fuentes, P., Martínez, J. E., Crespo, P. M., & Garcia‐Frias, J. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00022 · Cited by 9
“The first quantum codes based on turbo codes appeared in [5], [6], and have since been modified and improved [7]- [13].”
BackgroundEntanglement-Assisted Capacity of Quantum Channels with Side InformationPreprint
Pereg, U. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.09992 · Cited by 9
“isted capacity for transmission of classical information over a quantum channel was fully characterized by Bennet et al. [5,6]. Further work on entanglementassisted communication can be found e.g. in [30,32,20,54,14,62,49]. As for classical communication without entanglement between the encoder and the decoder, the Ho…”
MethodExtended quasi-cyclic constructions of quantum codes and entanglement-assisted quantum codes
Lv, J., Li, R., & Yao, Y. (2021) · Computational and Applied Mathematics · doi:10.1007/s40314-021-01644-x · Cited by 8
Zhang, Y., Liu, Y., Hou, X., Gao, J., & Ma, F. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03685-5 · Cited by 8
“[[40, 14, 11; 26]]17 [[40, 14, 8; 26]]17 [[50, 24, 6; 26]]132 [[50, 24, 4; 20]]132 [[18, 10, 5; 8]]52 [[18, 10, 3; 8]]52 [[76, 56, 6; 20]]132 [[76, 56, 4; 2]]132 [[38, 18, 13; 20]]52 [[38, 18, 8; 20]]52 [[66, 54, 5; 12]]172 [[66, 54, 3; 10]]172 [[20, 8, 11; 12]]72 [[20, 8, 4; 10]]72 [[168, 160, 5; 8]]172 [[168, 160, 3…”
BackgroundOn the construction of new toric quantum codes and quantum burst-error-correcting codes
Trinca, C. C., Interlando, J. C., Palazzo, R., de Andrade, A. A., & Watanabe, R. A. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03931-4 · Cited by 8
“The construction and investigation of quantum burst error-correcting codes have received far less attention compared to the development of standard quantum error-correcting codes or entanglement-assisted quantum error-correcting codes [11, 18].”
BackgroundŞahinkaya, S., Korban, A., & Üstün, D. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03500-1 · Cited by 8
“There exist an extensive literature on the constructions of good EAQEC codes, [11, 21, 27, 28, 31, 33, 35, 38, 39].”
BackgroundMaximal entanglement entanglement-assisted quantum codes from quaternary BCH codes
Lv, L., Li, R., Fu, Q., & Li, X. (2015) · IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC) · doi:10.1109/iaeac.2015.7428647 · Cited by 7
“(1) Cx = Cy if and only if there is a t ≤ m2 such that y ≡ x · 4t (mod n) or x ≡ y · 4t(mod n).”
Application of Complementary Dual AG Codes to Entanglement-Assisted Quantum Codes
Pereira, F. R. F., Pellikaan, R., Guardia, G. G. L., & de Assis, F. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849685 · Cited by 7
“Additionally, this class of codes can achieve the hashing bound [1], [2] and violate the quantum Hamming bound [3].”
BackgroundQuantum Codes: A Comprehensive Survey of Techniques, Challenges, and Future Directions
Mahmud, I., & Abdelhadi, A. (2025) · IEEE Access · doi:10.1109/access.2025.3646024 · Cited by 6
“Wilde and Hsieh [116] developed entanglement-assisted quantum turbo codes (EAQTCs) that satisfy recursion, non-catastrophic properties, and approach the hashing bound within 1 dB, supported by EXIT analysis.”
Several new families of MDS EAQECCs with much larger dimensions and related application to EACQCs
Cao, M. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04197-6 · Cited by 6
“The study of EAQECCs is currently a hot topic in coding theory and quantum information theory (see, e.g., [4, 5, 7, 8, 14, 15, 19, 20, 22, 25–28, 38–44, 46, 50, 51, 53, 54]).”
Some new families of entanglement-assisted quantum MDS codes derived from negacyclic codes
Wang, L., Wang, P., & Zhu, S. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03661-z · Cited by 6
“( See, for example, [7, 8, 10, 16–18, 22–24, 40, 43, 44] and the relevant references therein).”
Fully-Parallel Quantum Turbo Decoder
Babar, Z., Nguyen, H. V., Botsinis, P., Alanis, D., Chandra, D., Ng, S. X., Maunder, R. G., & Hanzo, L. (2016) · IEEE Access · doi:10.1109/access.2016.2581978 · Cited by 6
“In particular, for both the inner as well as the outer components, we have used the configuration termed as ‘‘PTO1R’’ in [23] and [24], whose seed transformation (decimal notation) is:”
BackgroundMethodInfluentialSelf-citationExamples of minimal-memory, non-catastrophic quantum convolutional encoders
Wilde, M. M., Houshmand, M., & Hosseini-Khayat, S. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6034166 · Cited by 5
Self-citationNew Quantum Burst-Error Correcting Codes from Interleaving Technique
Trinca, C. C., de Albuquerque, C. D., Palazzo, R., Interlando, J. C., de Andrade, A. A., & Watanabe, R. A. (2022) · Globecom · doi:10.1109/globecom48099.2022.10000761 · Cited by 5
“Hence there are counterparts of quantum random error-correcting codes [12]–[14] and quantum burst error-correcting codes [15]–[18].”
BackgroundEXIT-Chart Aided Design of Irregular Multiple-Rate Quantum Turbo Block Codes
Chandra, D., Ng, S. X., & Hanzo, L. (2023) · IEEE Access · doi:10.1109/access.2023.3312044 · Cited by 5
“Meanwhile, the QCCs that exhibit catastrophic structure require a doping mechanism or entanglement-assisted solution in order to substantially benefit from iterative decoding, since catastrophic QCCs provide zero a priori information [45],”
BackgroundXiao, H., Zhang, Z., & Chronopoulos, A. T. (2017) · The European Physical Journal C · doi:10.1140/epjc/s10052-017-5246-2 · Cited by 5
“Note that stabilizer operators must satisfy stringent commutativity constraints in order to form a valid quantum code [37,38].”
BackgroundError correction for reliable quantum computing
Fuentes, P. (2022) · Depósito Académico Digital Universidad de Navarra (University of Navarra) · doi:10.15581/10171/63067 · Cited by 5
Characterizing the Burst Error Correction Ability of Quantum Cyclic Codes
Fan, J., & Hsieh, M.-H. (2026) · IEEE Transactions on Information Theory · doi:10.1109/tit.2026.3659999 · Cited by 4
“Compared to the development of standard QECCs [20], [21], [22] or entanglement-assisted QECCs [23], [24], [25], [26], [27], [28], [29], [30], [31], the construction and investigation of QBECCs have received far less attention.”
Self-citationQuantum CSS Duadic and Triadic Codes: New Insights and Properties
Dastbasteh, R., Larrarte, O. S., Martínez, J. E., iOlius, A. D., del Moral, J. O., & Crespo, P. M. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-81824-0_5 · Cited by 4
Improved encoding structure and decoding algorithms for spinal codes
Huang, W., & Wang, L. (2022) · Journal of Systems Engineering and Electronics · doi:10.23919/jsee.2022.000084 · Cited by 4
New three- and four-dimensional toric and burst error-correcting quantum codes
Trinca, C. C., Palazzo, R., Watanabe, R. A., de Albuquerque, C. D., Interlando, J. C., & de Andrade, A. A. (2024) · Quantum Information Processing · doi:10.1007/s11128-023-04213-9 · Cited by 4
Two Families of Entanglement-Assisted Quantum MDS Codes from Cyclic Codes
Lü, L., Ma, W., Li, R., Cao, H., & Ren, J. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04802-3 · Cited by 4
Cao, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.15691 · Cited by 3
Entanglement-assisted codeword-stabilized quantum codes with imperfect ebits
Ahn, B., Shin, J., & Heo, J. (2016) · ICT Express · doi:10.1016/j.icte.2016.05.005 · Cited by 2
“[14] simulated entanglement-assisted quantum turbo codes when the ebits on Bob’s side are imperfect.”
BackgroundTwo class of entanglement-assisted quantum codes from shortened hamming codes
Qian, J., & Zhang, L. (2016) · IEEE International Conference on Signal and Image Processing (ICSIP) · doi:10.1109/siprocess.2016.7888282 · Cited by 2
“[20] showed maximal entanglement entanglement-assisted turbo codes came close to the entanglement-assisted hashing bound within a few decibels.”
BackgroundThe MacWilliams identity for quantum convolutional codes
Lai, C., & Hsieh, M.-H. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6874965 · Cited by 2
“The MacWilliams identity holds for the EAQ convolutional codes, catastrophic or noncatastrophic, recursive or nonrecursive (see Refs [28], [30] for these definitions).”
BackgroundSelf-citationA construction of quantum turbo product codes based on CSS-type quantum convolutional codes
Xiao, H., Ni, J., Xie, W., & Ouyang, S. (2016) · International Journal of Quantum Information · doi:10.1142/s0219749917500034 · Cited by 2
From Generalization of Bacon-Shor Codes to High Performance Quantum LDPC CodesPreprint
Fan, J., Li, J., Wang, Y., Li, Y., Hsieh, M.-H., & Du, J. (2021) · Research Square · doi:10.21203/rs.3.rs-690514/v1 · Cited by 2
Self-citationEntanglement-Assisted Quantum Error-Correcting CodesPreprint
Brun, T. A., & Hsieh, M.-H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.04013 · Cited by 2
Self-citationQuantum Block Turbo CodesPreprint
Jebari, K., Neto, L. A., Pyndiah, R. M., & Tocnaye, J.-L. D. B. D. L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.30775 · Cited by 2
“To transmit only the extrinsic information, we need to remove a priori information [18].”
Galois LCD codes decomposition of linear codes and their applications to EAQEC codes
Li, H., & Liu, X. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04920-5 · Cited by 1
“Some known results in [5, 34–36] suggested that the utilization of maximal entanglement may achieve a higher rate and/or better noise suppression capabilities.”
A Low Complexity Decoding Algorithm for Spinal Codes with Efficiently Distributed Symbols
Hu, Y., Liu, R., Kaushik, A., Shi, X., & Thompson, J. (2018) · NASA/ESA Conference on Adaptive Hardware and Systems (AHS) · doi:10.1109/ahs.2018.8541487 · Cited by 1
“There are some challenges associated with the traditional channel coding techniques such as Turbo codes [1], Low Density Parity Check (LDPC) codes [2] and other fixed bit rate codes [3]–[7] to simultaneously meet the requirements of a reliable and an efficient data transmission in the fast time-varying channel setup […”
Construction of Maximal Entanglement EAQECCs of Distance 4 from Caps in Projective Space PG(r,4)
Fu, Q., Li, R., Lv, L., & Liu, Y. (2017) · International Conference on Network and Information Systems for Computers (ICNISC) · doi:10.1109/icnisc.2017.00014 · Cited by 1
“Maximal entanglement EAQECCs have some advantages: (1) MEEAQECCs can have more information qubits and higher minimum distance at the cost of more ebits[2]; (2) Exploiting maximal entanglement may achieve a higher rate and/or better noise suppression capabilities[4-8]; (3) ME-EAQECCs can achieve the EA-hashing bound as…”
Background
Metadata
- Authors
- Wilde, M. M., Hsieh, M.-H., & Babar, Z.
- Affiliations
- Louisiana State University (US)
- University of Technology Sydney (AU)
- University of Southampton (GB)
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-02
- Volume
- 60
- Issue
- 2
- Pages
- 1203-1222
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2040653896
- Cited by
- 102
- References
- 98
- Citations by year
- 2026: 2 · 2025: 7 · 2024: 6 · 2023: 9 · 2022: 17 · 2021: 13 · 2020: 10 · 2019: 8 · 2018: 7 · 2017: 5 · 2016: 9 · 2015: 2 · 2014: 5
- FWCI
- 6.98
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Civil War Book Review (submittedVersion)
- UTS ePRESS (University of Technology Sydney) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Keywords
- entanglement-assisted quantum codes, minimum distance, iterative decoding, extrinsic information, depolarizing channel, ancilla qubits
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.