Quantum Turbo Decoding for Quantum Channels Exhibiting Memory
Open accessThe DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Abstract
Inspired by the success of classical turbo codes, quantum turbo codes (QTCs) have also been conceived for near-hashing-bound transmission of quantum information over memoryless quantum channels. However, in real physical situations, the memoryless channel assumption may not be well justified, since the channel often exhibits memory of previous error events. Here, we investigate the performance of QTCs over depolarizing channels exhibiting memory and we show that they suffer from a performance degradation at low depolarizing probability values. In order to circumvent the performance degradation issue, we conceive a new coding scheme termed quantum turbo coding scheme exploiting error-correlation (QTC-EEC) that is capable of utilizing the error-correlation while performing the iterative decoding at the receiver. The proposed QTC-EEC can achieve convergence threshold at a higher depolarizing probability for channels with a higher value of correlation parameter and achieve performance near to the capacity. Finally, we propose a joint decoding and estimation scheme for our QTC-EEC relying on the correlation estimation (QTC-EEC-E) designed for more realistic quantum systems with unknown correlation parameter. Simulation results reveal that the proposed QTC-EEC-E can achieve the same performance as that of the ideal system of known correlation parameter and hence demonstrate the accurate estimation of the proposed QTC-EEC-E.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
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×
“Inspired by the near-capacity performance of the classical turbo codes [6], quantum serial turbo codes or also known as quantum turbo codes (QTCs) were conceived in [7] and [8] and later extended for entanglement-assisted coding schemes in [9]–[12].”
BackgroundMixed-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 resultant CM Q (0, p) value is the same as the hashing bound of CQ(p) = 1 − Hb(p) − p · log2(3), which sets the lower bound of communicating over a memoryless depolarizing channel [44].”
BackgroundScheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479 · cited 2×
“The first quantum code was introduced by Shor in 1995 [2] that was only capable of correcting a single qubit error in a ninequbit block code.”
BackgroundMethodQuantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2011) · Cited by 2,724
Convergence behavior of iteratively decoded parallel concatenated codes
ten Brink, S. (2001) · IEEE Transactions on Communications · doi:10.1109/26.957394 · Cited by 2,386 · cited 2×
“The performance curves can be improved to closely approach p = pE by increasing the number of iterations and by using higher interleaving depths [48].”
MethodDecoherence-Free Subspaces for Quantum Computation
Lidar, D. A., Chuang, I. L., & Whaley, K. B. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.2594 · Cited by 1,858 · cited 2×
“[36] proposed concatenated coding schemes relying on the 3-qubit repetition code and a specific code based on the decoherence-free subspace formalism of [5] which was investigated in the context of a bit-flip (or a phase-flip) quantum channel.”
BackgroundMethodDynamical Decoupling of Open Quantum Systems
Viola, L., Knill, E., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.2417 · Cited by 1,808 · cited 2×
“More explicitly, the [3,1,3] QCC employed as both the outer and inner component codes correspond to the code configuration termed as ‘‘PTO1R’’ in [10].”
MethodQuantum Communication through an Unmodulated Spin Chain
Bose, S. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.207901 · Cited by 1,407 · cited 1×
“Physical examples of channels exhibiting a memory in quantum information processing are constituted by unmodulated spin chains [18], [19], micromasers [20], and fibre optics [21], [22].”
BackgroundZanardi, P., & Rasetti, M. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.3306 · Cited by 1,315
General state changes in quantum theory
Kraus, K. (1971) · Annals of Physics · doi:10.1016/0003-4916(71)90108-4 · Cited by 747 · cited 1×
“For a memoryless Pauli channel, the completely positive trace-preserving mapping of an input quantum state having a density operator ρ in its operator-sum (or Kraus) representation [38] is given by [39]:”
MethodSparse-Graph Codes for Quantum Error Correction
MacKay, D. J. C., Mitchison, G., & McFadden, P. L. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834737 · Cited by 376
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.1203 · Cited by 330 · cited 2×
“For a recent review on quantum channels with memory please refer to [16].”
BackgroundEntanglement-enhanced information transmission over a quantum channel with correlated noise
Macchiavello, C., & Palma, G. M. (2002) · Physical Review A · doi:10.1103/physreva.65.050301 · Cited by 276 · cited 6×
“· qAN |AN−1 and therefore, the completely positive trace-preserving mapping for channels with memory can be represented as [23], [28]”
BackgroundInfluentialKretschmann, D., & Werner, R. F. (2005) · Physical Review A · doi:10.1103/physreva.72.062323 · Cited by 236 · cited 3×
“In 2005, a unified framework for quantum channels exhibiting memory was developed by Kretschmann and Werner [17], where the upper bounds of classical and of quantum channel capacities were derived for various scenarios, depending on whether the transmitter, the receiver or the eavesdropper has the control on the initi…”
BackgroundInfluentialQuantum Computing and Communications: An Engineering Approach
Imre, S., & Balázs, F. (2004) · Wiley eBooks · doi:10.1002/9780470869048 · Cited by 163 · cited 3×
“More explicitly, the [3,1,3] QCC employed as both the outer and inner component codes correspond to the code configuration termed as ‘‘PTO1R’’ in [10].”
BackgroundMethodTurbo Coding, Turbo Equalisation and Space–Time Coding
Hanzo, L., Liew, T. H., Yeap, B. L., Tee, R. Y. S., & Ng, S. X. (2011) · Wiley eBooks · doi:10.1002/9780470978481 · Cited by 155 · cited 1×
“EXIT-charts constitute an essential tool that has been widely used for the design of near-capacity classical codes as a benefit of its capability of visualizing the convergence behavior of iterative decoding schemes [48], [49].”
MethodSelf-citationBanaszek, K., Dragan, A., Wasilewski, W., & Radzewicz, C. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.257901 · Cited by 128 · cited 1×
“Physical examples of channels exhibiting a memory in quantum information processing are constituted by unmodulated spin chains [18], [19], micromasers [20], and fibre optics [21], [22].”
BackgroundPoulin, D., Tillich, J.-P., & Ollivier, H. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2018339 · Cited by 116
Hanzo, L., Liew, T. H., Yeap, B. L., Tee, R. Y. S., & Ng, S. X. (2011) · ePrints Soton (University of Southampton) · Cited by 103
Self-citationEntanglement-Assisted Quantum Turbo Codes
Wilde, M. M., Hsieh, M.-H., & Babar, Z. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2292052 · Cited by 102 · cited 10×
“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-citationTransition behavior in the channel capacity of two-quibit channels with memory
Macchiavello, C., Palma, G. M., & Virmani, S. (2004) · Physical Review A · doi:10.1103/physreva.69.010303 · Cited by 100 · cited 1×
“This work was then extended to quasiclassical depolarizing channels [24], to Pauli channels [25], to more than two successive uses of Pauli channels [26] and to superdense-coded qudit1 Pauli channels [27].”
BackgroundQuantum channels with a finite memory
Bowen, G., & Mancini, S. (2004) · Physical Review A · doi:10.1103/physreva.69.012306 · Cited by 99 · cited 8×
“[16] F. Caruso, V. Giovannetti, C. Lupo, and S. Mancini, “Quantum channels and memory effects,” Rev. Mod.”
BackgroundInfluentialQuantum capacity of dephasing channels with memory
D’Arrigo, A., Benenti, G., & Falci, G. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/9/310 · Cited by 96 · cited 1×
“However, at the time of writing, the exact quantum capacity for the transmission of quantum information over the quantum channels with memory has only been found for a few specific channel models, as exemplified by the dephasing channels [30], the amplitude-damping channels [43], and the bit/phase-flip channels [34].”
BackgroundEfficient Computation of EXIT Functions for Nonbinary Iterative Decoding
Kliewer, J., Ng, S. X., & Hanzo, L. (2006) · IEEE Transactions on Communications · doi:10.1109/tcomm.2006.885050 · Cited by 89 · cited 1×
“The classical nonbinary EXIT chart technique of [50] and [51] was adapted to the quantum syndrome decoding approach in [12] which was realized by exploiting the equivalent classical representation of the quantum code and based on the analogy of thememoryless depolarizing channel with the binary symmetric channel.”
MethodSelf-citationIterative source-channel decoder using extrinsic information from softbit-source decoding
Adrat, M., Vary, R., & Spittka, J. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2001.940547 · Cited by 84 · cited 1×
“The Markov decoder is based on the MAP algorithm designed for the classical soft-bit source decoding in [52] and [53], but here we consider the soft decoding benefits of error-correlation instead of source-correlation.”
MethodQuantum error correction against correlated noise
Clemens, J. P., Siddiqui, S., & Gea-Banacloche, J. (2004) · Physical Review A · doi:10.1103/physreva.69.062313 · Cited by 67 · cited 3×
“[36] proposed concatenated coding schemes relying on the 3-qubit repetition code and a specific code based on the decoherence-free subspace formalism of [5] which was investigated in the context of a bit-flip (or a phase-flip) quantum channel.”
BackgroundMethodA dynamical model for quantum memory channels
Giovannetti, V. (2005) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/38/50/008 · Cited by 63 · cited 1×
“In reality, μ can be quantified from the time delay ∆t between two successive channel uses and the typical relaxation time constant τ of the channel environment, which can be expressed as μ ' exp(−∆t/τ ) [40], [41].”
BackgroundExploiting entanglement in communication channels with correlated noise
Ball, J. L., Dragan, A., & Banaszek, K. (2004) · Physical Review A · doi:10.1103/physreva.69.042324 · Cited by 60 · cited 1×
“Physical examples of channels exhibiting a memory in quantum information processing are constituted by unmodulated spin chains [18], [19], micromasers [20], and fibre optics [21], [22].”
BackgroundJoint source-channel turbo coding for binary Markov sources
Zhu, G.-C., & Alajaji, F. (2006) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2006.1633359 · Cited by 60 · cited 1×
“The modification of the degenerate MAP algorithm is based on a similar technique of modifying the MAP algorithm for correlated binary sources in the classical domain [45]–[47].”
MethodMemory effects in spin-chain channels for information transmission
Bayat, A., Burgarth, D. K., Mancini, S., & Bose, S. (2008) · Physical Review A · doi:10.1103/physreva.77.050306 · Cited by 58 · cited 1×
“Physical examples of channels exhibiting a memory in quantum information processing are constituted by unmodulated spin chains [18], [19], micromasers [20], and fibre optics [21], [22].”
BackgroundCombining hidden Markov source models and parallel concatenated codes
Garcia‐Frias, J., & Villasenor, J. D. (1997) · IEEE Communications Letters · doi:10.1109/4234.602600 · Cited by 57
A Proposed Quantum Low Density Parity Check CodePreprint
Postol, M. S. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0108131 · Cited by 56 · cited 1×
“Another near-capacity quantum code family is constituted by low density parity check (QLDPC) codes [13]–[15].”
BackgroundConvergence of non-binary iterative decoding
Grant, A. J. (2002) · IEEE Global Telecommunications Conference (GLOBECOM) · doi:10.1109/glocom.2001.965633 · Cited by 52 · cited 1×
“The classical nonbinary EXIT chart technique of [50] and [51] was adapted to the quantum syndrome decoding approach in [12] which was realized by exploiting the equivalent classical representation of the quantum code and based on the analogy of thememoryless depolarizing channel with the binary symmetric channel.”
MethodEXIT-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 · cited 6×
“Hence, QTCs with a QCC as the inner code have a bounded minimum distance and the EXIT curve for the inner decoder is only capable to reach (x, y) = (1, 1) point at very low values of p, whereas the classical recursive inner codes can reach (x, y) = (1, 1) point for any p value [12].”
BackgroundMethodInfluentialSelf-citationA class of quantum LDPC codes: construction and performances under iterative decoding
Camara, T., Ollivier, H., & Tillich, J. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557324 · Cited by 51 · cited 1×
“Another near-capacity quantum code family is constituted by low density parity check (QLDPC) codes [13]–[15].”
BackgroundA dynamical model for quantum memory channels
Giovannetti, V. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 50
Quantum stabilizer codes for correlated and asymmetric depolarizing errors
Cafaro, C., & Mancini, S. (2010) · Physical Review A · doi:10.1103/physreva.82.012306 · Cited by 48 · cited 1×
“There have been several studies on the performance of the existing QECCs in the context of quantum channels exhibiting memory, specifically using the 3-qubit repetition code [31], [32], [35], [36], CSS codes [36] and stabilizer codes [33].”
BackgroundEnhancement of Transmission Rates in Quantum Memory Channels with Damping
Benenti, G., D’Arrigo, A., & Falci, G. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.020502 · Cited by 46 · cited 1×
“Physical examples of channels exhibiting a memory in quantum information processing are constituted by unmodulated spin chains [18], [19], micromasers [20], and fibre optics [21], [22].”
BackgroundDaems, D. (2007) · Physical Review A · doi:10.1103/physreva.76.012310 · Cited by 43 · cited 1×
“This work was then extended to quasiclassical depolarizing channels [24], to Pauli channels [25], to more than two successive uses of Pauli channels [26] and to superdense-coded qudit1 Pauli channels [27].”
BackgroundThe 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 · cited 19×
“In this work, we employ an [nout, kout,mout] QCC as the outer code and an [nin, kin,min] QCC as the inner code.”
BackgroundMethodInfluentialSelf-citationBennett, C. H., & Shor, P. W. (2004) · Science · doi:10.1126/science.1092381 · Cited by 40
Entanglement boosts quantum turbo codes
Wilde, M. M., & Hsieh, M.-H. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6034165 · Cited by 38
Poulin, D., Tillich, J., & Ollivier, H. (2008) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2008.4594998 · Cited by 34 · cited 4×
“Sincemost of the existingQECCs includingQTCs[7]–[12] are designed for memoryless channels, these QECCs may not”
BackgroundInfluentialEXIT-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 · cited 2×
“The distance from the limit given as pE/p∗ [37] is then determined as tabulated in Table 1 for the depolarizing channels associated with μ = {0, 0.”
Self-citationOptimal superdense coding over memory channels
Shadman, Z., Kampermann, H., Bruß, D., & Macchiavello, C. (2011) · Physical Review A · doi:10.1103/physreva.84.042309 · Cited by 28 · cited 1×
“This work was then extended to quasiclassical depolarizing channels [24], to Pauli channels [25], to more than two successive uses of Pauli channels [26] and to superdense-coded qudit1 Pauli channels [27].”
BackgroundMemory effects in attenuation and amplification quantum processes
Lupo, C., Giovannetti, V., & Mancini, S. (2010) · Physical Review A · doi:10.1103/physreva.82.032312 · Cited by 21 · cited 1×
“In reality, μ can be quantified from the time delay ∆t between two successive channel uses and the typical relaxation time constant τ of the channel environment, which can be expressed as μ ' exp(−∆t/τ ) [40], [41].”
BackgroundEntanglement-assisted classical capacity of quantum channels with correlated noise
Arshed, N., & Toor, A. H. (2006) · Physical Review A · doi:10.1103/physreva.73.014304 · Cited by 18
Entanglement and optimal strings of qubits for memory channels
Karimipour, V., & Memarzadeh, L. (2006) · Physical Review A · doi:10.1103/physreva.74.062311 · Cited by 17 · cited 1×
“This work was then extended to quasiclassical depolarizing channels [24], to Pauli channels [25], to more than two successive uses of Pauli channels [26] and to superdense-coded qudit1 Pauli channels [27].”
Spatio-Temporal Iterative Source–Channel Decoding Aided Video Transmission
Huo, Y., Zhu, C. Z., & Hanzo, L. (2013) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2012.2227072 · Cited by 16
Self-citationQuantum capacity of an amplitude-damping channel with memory
Jahangir, R., Arshed, N., & Toor, A. H. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0883-y · Cited by 15 · cited 1×
“However, at the time of writing, the exact quantum capacity for the transmission of quantum information over the quantum channels with memory has only been found for a few specific channel models, as exemplified by the dephasing channels [30], the amplitude-damping channels [43], and the bit/phase-flip channels [34].”
BackgroundExploitation of 2D binary source correlation using turbo block codes with fine-tuning
Izhar, M. A. M., Fisal, N., Zhou, X., Anwar, K., & Matsumoto, T. (2013) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/1687-1499-2013-89 · Cited by 11 · cited 1×
“The modification of the degenerate MAP algorithm is based on a similar technique of modifying the MAP algorithm for correlated binary sources in the classical domain [45]–[47].”
MethodRepetition versus noiseless quantum codes for correlated errors
Cafaro, C., & Mancini, S. (2010) · Physics Letters A · doi:10.1016/j.physleta.2010.04.047 · Cited by 10 · cited 1×
“There have been several studies on the performance of the existing QECCs in the context of quantum channels exhibiting memory, specifically using the 3-qubit repetition code [31], [32], [35], [36], CSS codes [36] and stabilizer codes [33].”
BackgroundMEMORY EFFECTS IN A MARKOV CHAIN DEPHASING CHANNEL
D’Arrigo, A., Leo, E. D., Benenti, G., & Falci, G. (2008) · International Journal of Quantum Information · doi:10.1142/s0219749908003918 · Cited by 9 · cited 1×
“There have been several studies on the performance of the existing QECCs in the context of quantum channels exhibiting memory, specifically using the 3-qubit repetition code [31], [32], [35], [36], CSS codes [36] and stabilizer codes [33].”
BackgroundQuantum capacity of Pauli channels with memory
Huang, P. F., He, G., Lu, Y., & Zeng, G. (2010) · Physica Scripta · doi:10.1088/0031-8949/83/01/015005 · Cited by 8 · cited 4×
“These coherent information contributions can be computed using the equations below [34]:”
BackgroundMethodInfluentialCONCATENATION OF ERROR AVOIDING WITH ERROR CORRECTING QUANTUM CODES FOR CORRELATED NOISE MODELS
Cafaro, C., & Mancini, S. (2011) · International Journal of Quantum Information · doi:10.1142/s0219749911007216 · Cited by 8 · cited 11×
“There have been several studies on the performance of the existing QECCs in the context of quantum channels exhibiting memory, specifically using the 3-qubit repetition code [31], [32], [35], [36], CSS codes [36] and stabilizer codes [33].”
BackgroundMethodInfluential
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
“Furthermore, the extension of classical turbo codes to quantum turbo codes with error correction for frequency selective channels has been proposed in [34].”
BackgroundDecoding algorithms for surface codes
deMarti iOlius, A., Fuentes, P., Orús, R., Crespo, P. M., & Etxezarreta Martinez, J. (2024) · Quantum · doi:10.22331/q-2024-10-10-1498 · Cited by 60
“Modifications of decoders to take into account correlated noise have been already proposed for quantum turbo codes over channels with memory, resulting in a considerably improved performance of the code when compared to the decoder that is blind to the correlation (Mohd Izhar et al., 2018).”
BackgroundExperimental characterization of a non-Markovian quantum process
Goswami, K., Giarmatzi, C., Monterola, C. P., Shrapnel, S., Romero, J., & Costa, F. (2021) · Physical Review A · doi:10.1103/physreva.104.022432 · Cited by 44
Martínez, J. E., Fuentes, P., Crespo, P. M., & Garcia‐Frias, J. (2020) · IEEE Access · doi:10.1109/access.2020.3025619 · Cited by 40
“For this type of channel, the correlation between the single qubit Pauli operators of the set P 1 can be described by means of a 4-state Markov chain [68]–[71].”
BackgroundMethodInfluentialToward Quantum-Native Communication Systems: State-of-the-Art, Trends, and Challenges
Zhou, X., Shen, A., Hu, S., Ni, W., Wang, X., & Hossain, E. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3575842 · Cited by 66
“Hence, Izhar et al. [279] examined quantum turbo codes (QTCs) in the face of depolarizing channels exhibiting memory and proposed a QTC scheme capable of exploiting error correlation during decoding.”
Metadata
- Authors
- Mohd Izhar, M. A., Babar, Z., Nguyen, H. V., Botsinis, P., Alanis, D., Chandra, D., Ng, S. X., & Hanzo, L.
- Affiliations
- University of Southampton (GB)
- University of Surrey (GB)
- ORCID
- Venue
- IEEE Access
- Published
- 2018
- Volume
- 6
- Pages
- 12369-12381
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2793613756
- Cited by
- 9
- References
- 56
- Citations by year
- 2025: 1 · 2024: 1 · 2023: 1 · 2022: 1 · 2021: 2 · 2020: 1 · 2019: 2
- FWCI
- 0.70
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- IEEE Access (publishedVersion, cc-by)
- ePrints Soton (University of Southampton) (acceptedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Greater South Information System
- Funders
- Ministry of Higher Education, Malaysia
- UTM Razak School of Engineering and Advanced Technology, Universiti Teknologi Malaysia, through HIGDR (R.K130000.7740.4J314)
- European Research Council through the Advanced Fellow Grant
- Royal Society’s Wolfson Research Merit Award
- 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
- depolarizing channel, error correlation, iterative decoding, convergence threshold, correlation parameter estimation, quantum information transfer
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.