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
The Theory of Information and Coding
McEliece, R. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511606267 · Cited by 986
The Private Classical Capacity and Quantum Capacity of a Quantum Channel
Devetak, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839515 · Cited by 823 · cited 1×
“set this theory on a firm foundation [4] in an attempt to construct explicit quantum codes that come close to achieving the quantum capacity of a quantum channel [5].”
Capacity of the noisy quantum channel
Lloyd, S. (1997) · Physical Review A · doi:10.1103/physreva.55.1613 · Cited by 783 · cited 2×
“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.”
Stabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753 · cited 1×
“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].”
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Bennett, C. H., Shor, P. W., Smolin, J. A., & Thapliyal, A. V. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.802612 · Cited by 698 · cited 1×
“One possibility is simply to change the paradigm for quantum error correction, by allowing the sender and the receiver access to shared entanglement before communication begins.”
BackgroundEntanglement-Assisted Classical Capacity of Noisy Quantum Channels
Bennett, C. H., Shor, P. W., Smolin, J. A., & Thapliyal, A. V. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.3081 · Cited by 610 · cited 1×
“The set C (L) of harmful, undetected errors consists of all operators P that have a zero 4 syndrome, yet change the quantum information in the encoded state: C (L) ≡ {P : P = (L : Sz : Ic)V, Sz ∈ {I, Z}a} , where L 6= Ik.”
A soft-input soft-output APP module for iterative decoding of concatenated codes
Benedetto, S., Divsalar, D., Montorsi, G., & Pollara, F. (1997) · IEEE Communications Letters · doi:10.1109/4234.552145 · Cited by 549 · 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.”
Fundamentals of Convolutional Coding
Johannesson, R., & Zigangirov, K. S. (1999) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470544693 · Cited by 540
Correcting Quantum Errors with Entanglement
Brun, T., Devetak, I., & Hsieh, M.-H. (2006) · Science · doi:10.1126/science.1131563 · Cited by 473 · cited 12×
“The encoder V of an EAQ code produces an encoded state by acting on a set of k information qubits in a state |ψ〉, a ancilla qubits, and c ebits:∣∣ψ〉AB ≡ V A(|ψ〉A ⊗ |0a〉A ⊗ ∣∣Φ+c 〉AB), where |0a〉A ≡ |0〉⊗a ,∣∣Φ+c 〉AB ≡ (∣∣Φ+〉AB)⊗c ,∣∣Φ+〉AB ≡ 1√ 2 ( |00〉AB + |11〉AB ) , n = k + a+ c, and the sender Alice possesses c halve…”
InfluentialSelf-citationThe Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information
Devetak, I., & Shor, P. W. (2005) · Communications in Mathematical Physics · doi:10.1007/s00220-005-1317-6 · Cited by 445 · cited 1×
“Another variation is an encoder that encodes both classical bits and qubits, and we might wonder if these could be simultaneously recursive and non-catastrophic (such codes are known as “classically-enhanced” codes [83] and are based on trade-off coding ideas from quantum Shannon theory [84]).”
Weight distributions for turbo codes using random and nonrandom permutations
Dolinar, S. J., & Divsalar, D. (1995) · Cited by 436
Sparse-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 · cited 1×
“[55], [56], [57], [7], [58], [59], [60], [61]).”
DiVincenzo, D. P., Leung, D. W., & Terhal, B. M. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.985948 · Cited by 362 · cited 1×
“Alice first encodes her stream of information qubits with the outer encoder, performs a quantum interleaver on all of the qubits, and then encodes the resulting stream with the inner encoder.”
Stabilizer Formalism for Operator Quantum Error Correction
Poulin, D. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.230504 · Cited by 342 · cited 2×
“[6] is a subsystem convolutional code (based on the idea of a subsystem quantum code [79]–[81] that is useful in faulttolerant quantum computation [82]).”
Quantum-channel capacity of very noisy channels
DiVincenzo, D. P., Shor, P. W., & Smolin, J. A. (1998) · Physical Review A · doi:10.1103/physreva.57.830 · Cited by 297 · cited 3×
“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].”
Unified and Generalized Approach to Quantum Error Correction
Kribs, D., Laflamme, R., & Poulin, D. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.180501 · Cited by 283 · cited 1×
“[6] is a subsystem convolutional code (based on the idea of a subsystem quantum code [79]–[81] that is useful in faulttolerant quantum computation [82]).”
Divincenzo, D. P., Leung, D., & Terhal, B. M. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 281
The mother of all protocols: restructuring quantum information’s family tree
Abeyesinghe, A., Devetak, I., Hayden, P., & Winter, A. (2009) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2009.0202 · Cited by 246 · cited 1×
“The father protocol is a quantum communication protocol that achieves the entanglement-assisted quantum capacity [58]–[60], while attempting to minimize its entanglement consumption rate.”
A Resource Framework for Quantum Shannon Theory
Devetak, I., Harrow, A. W., & Winter, A. J. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928980 · Cited by 208 · cited 2×
“Suppose now that we change the resources in the encoder so that all of the classical bits and gauge qubits become ancilla qubits.”
BackgroundSubsystem Fault Tolerance with the Bacon-Shor Code
Aliferis, P., & Cross, A. W. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.220502 · Cited by 203 · cited 1×
“[6] is a subsystem convolutional code (based on the idea of a subsystem quantum code [79]–[81] that is useful in faulttolerant quantum computation [82]).”
Optimal entanglement formulas for entanglement-assisted quantum coding
Wilde, M. M., & Brun, T. A. (2008) · Physical Review A · doi:10.1103/physreva.77.064302 · Cited by 190 · cited 1×
“Poulin et al. set this theory on a firm foundation [7] in an attempt to construct explicit quantum codes that come close to achieving the quantum capacity of a quantum channel [8], [9], [10], [11].”
Self-citationInterleaver design for turbo codes
Barbulescu, A. S., & Pietrobon, S. S. (1994) · Electronics Letters · doi:10.1049/el:19941434 · Cited by 172
A Decoupling Approach to the Quantum Capacity
Hayden, P., Horodecki, M., Winter, A., & Yard, J. (2008) · Open Systems & Information Dynamics · doi:10.1142/s1230161208000043 · Cited by 170 · cited 1×
“set this theory on a firm foundation [6] in an attempt to construct explicit quantum codes that come close to achieving the quantum capacity of a quantum channel [7]–[10].”
Interleaver design for turbo codes
Sadjadpour, H. R., Sloane, N. J. A., Salehi, M., & Nebe, G. (2001) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.924867 · Cited by 161
Turbo 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×
“given information qubit is not reused in the other constituent decoder [1], [50].”
BackgroundA fast algorithm for computing distance spectrum of convolutional codes
Cedervall, M., & Johannesson, R. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.45271 · Cited by 150 · cited 1×
“Note that there are faster ways of computing the distance spectrum for classical convolutional codes [43], and it remains open to determine how to exploit these techniques for quantum convolutional encoders.”
Degenerate Quantum Codes for Pauli Channels
Smith, G., & Smolin, J. A. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.030501 · Cited by 142 · cited 1×
“The quantum hashing bound determines the rate at which a random quantum code can operate reliably for a particular depolarizing parameter p, but note that it does not give the ultimate capacity limit because degeneracy can improve performance [33], [55]–[57].”
Quantum Analog of the MacWilliams Identities for Classical Coding Theory
Shor, P., & Laflamme, R. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.1600 · Cited by 139 · cited 1×
“We found all of these examples by picking encoders uniformly at random from the Clifford group, according to the algorithm in Section VI-A.2 of Ref.”
General entanglement-assisted quantum error-correcting codes
Hsieh, M.-H., Devetak, I., & Brun, T. A. (2007) · Physical Review A · doi:10.1103/physreva.76.062313 · Cited by 139 · cited 1×
“…a ancilla qubits, and c ebits:∣∣ψ〉AB ≡ V A(|ψ〉A ⊗ |0a〉A ⊗ ∣∣Φ+c 〉AB), where |0a〉A ≡ |0〉⊗a ,∣∣Φ+c 〉AB ≡ (∣∣Φ+〉AB)⊗c ,∣∣Φ+〉AB ≡ 1√ 2 ( |00〉AB + |11〉AB ) , n = k + a+ c, and the sender Alice possesses c halves of the entangled pairs while the receiver Bob possesses the other c halves (see Figure 1).”
Self-citationEntanglement required in achieving entanglement-assisted channel capacities
Bowen, G. (2002) · Physical Review A · doi:10.1103/physreva.66.052313 · Cited by 130 · cited 1×
“The set C (L) of harmful, undetected errors consists of all operators P that have a zero 4 syndrome, yet change the quantum information in the encoded state: C (L) ≡ {P : P = (L : Sz : Ic)V, Sz ∈ {I, Z}a} , where L 6= Ik.”
Devetak, I., Harrow, A. W., & Winter, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.230504 · Cited by 124 · cited 2×
“One can also consider a “hashing region” of rates that are achievable for entanglement-assisted quantum communication [58], [59], [64]—this region is the more relevant benchmark for an entanglement-assisted code that does not consume the maximal amount of entanglement.”
Description of a Quantum Convolutional Code
Ollivier, H., & Tillich, J. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.177902 · Cited by 117 · cited 1×
“The structure of a quantum serial turbo code is similar to its classical counterpart—one quantum convolutional encoder [11], [12] followed by a quantum interleaver and another quantum convolutional encoder.”
Convolutional and Tail-Biting Quantum Error-Correcting Codes
Forney, G. D., Grassl, M., & Guha, S. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.890698 · Cited by 117 · cited 1×
“The structure of a quantum serial turbo code is similar to its classical counterpart—one quantum convolutional encoder [11], [12] followed by a quantum interleaver and another quantum convolutional encoder.”
Poulin, D., Tillich, J.-P., & Ollivier, H. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2018339 · Cited by 116
Entanglement-Assisted Communication of Classical and Quantum Information
Hsieh, M.-H., & Wilde, M. M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2053903 · Cited by 112 · cited 4×
“It would be interesting to explore the performance of the other suggested code structures in Section X to determine if they could come close to achieving the optimal rates from quantum Shannon theory [61], [62].”
InfluentialSelf-citationOptimal and efficient decoding of concatenated quantum block codes
Poulin, D. (2006) · Physical Review A · doi:10.1103/physreva.74.052333 · Cited by 105 · cited 1×
“The seed transformation for our first example is as follows: Z I I I Z I I I Z X I I I X I I I X → Z I X X Z Y X Y Z X X X Y I Y Y X Y , (4) 7 where the first input qubit is the memory qubit, the second input qubit is the information qubit, the third is Alice’s half of the ebit, the first output…”
Entanglement increases the error-correcting ability of quantum error-correcting codes
Lai, C., & Brun, T. A. (2013) · Physical Review A · doi:10.1103/physreva.88.012320 · Cited by 101
Coding theorems for turbo code ensembles
Jin, H., & McEliece, R. J. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003833 · Cited by 94
Operator quantum error correction
Kribs, D., & Poulin, D. (2013) · Quantum Error Correction · doi:10.1017/cbo9781139034807.008 · Cited by 92 · cited 1×
“[7] is a subsystem convolutional code (based on the idea of a subsystem quantum code [67], [68], [69] that is useful in fault-tolerant quantum computation [70]).”
Combined turbo codes and interleaver design
Yuan, J., Vucetic, B. S., & Feng, W. (1999) · IEEE Transactions on Communications · doi:10.1109/26.764913 · Cited by 92
Entanglement-assisted quantum quasicyclic low-density parity-check codes
Hsieh, M.-H., Brun, T. A., & Devetak, I. (2009) · Physical Review A · doi:10.1103/physreva.79.032340 · Cited by 85 · cited 1×
“[55], [56], [57], [7], [58], [59], [60], [61]).”
Self-citationDuality 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-citationOn the minimum distance of parallel and serially concatenated codes
Kahalé, N., & Urbanke, R. L. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.1998.708611 · Cited by 84 · cited 3×
“The distance spectrum F (w) of an EAQ convolutional encoder is the number of admissable paths beginning and ending in memory states that are part of a zero physical-weight cycle, where the physical weight of each admissable path is w and the logical weight is greater than zero.”
High Performance Entanglement-Assisted Quantum LDPC Codes Need Little Entanglement
Hsieh, M.-H., Yen, W.-T., & Hsu, L.-Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2104590 · Cited by 83 · cited 1×
“recently constructed a class of entanglement-assisted codes that exploit one ebit and still have good performance [86].”
Self-citationA Father Protocol for Quantum Broadcast Channels
Dupuis, F., Hayden, P., & Li, K. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046217 · Cited by 78 · cited 1×
“There are four memory states because there is only one memory qubit, and there are 16 edges because there are four memory states and four logical operators for one information qubit and one ebit.”
Quantum Quasi-Cyclic LDPC Codes
Hagiwara, M., & Imai, H. (2007) · 2007 IEEE International Symposium on Information Theory · doi:10.1109/isit.2007.4557323 · Cited by 75 · cited 1×
“[55], [56], [57], [7], [58], [59], [60], [61]).”
Entanglement-assisted quantum convolutional coding
Wilde, M. M., & Brun, T. A. (2010) · Physical Review A · doi:10.1103/physreva.81.042333 · Cited by 75 · cited 1×
“There are four memory states because there is only one memory qubit, and there are 16 edges because there are four memory states and four logical operators for one information qubit and one ebit.”
Self-citationLower bounds on the nonzero capacity of Pauli channels
Fern, J., & Whaley, K. B. (2008) · Physical Review A · doi:10.1103/physreva.78.062335 · Cited by 73 · cited 1×
“note that it does not give the ultimate capacity limit because degeneracy can improve performance [31], [46], [47], [48].”
Operator quantum error correction
Kribs, D. W., Laflamme, R., Poulin, D., & Lesosky, M. (2006) · Quantum Information and Computation · doi:10.26421/qic6.4-5-6 · Cited by 73
Quantum Quasi-Cyclic LDPC Codes
Hagiwara, M., & Imai, H. (2007) · CERN Document Server (European Organization for Nuclear Research) · Cited by 73
Quantum Error-Correcting Codes Need Not Completely Reveal the Error Syndrome
Shor, P. W., & Smolin, J. A. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9604006 · Cited by 68
Entanglement-assisted quantum low-density parity-check codes
Fujiwara, Y., Clark, D., Vandendriessche, P., Boeck, M. D., & Tonchev, V. D. (2010) · Physical Review A · doi:10.1103/physreva.82.042338 · Cited by 68
Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
Hsieh, M.-H., & Wilde, M. M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054532 · Cited by 68 · cited 1×
“Additionally, we can remove the X operators Lxc from the definition of C (L) because they no longer play a role as a logical operator, and we can remove the X operators Gx from the definition of C (L) because they are acting on ancilla qubits.”
MethodSelf-citationEntanglement-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 · cited 1×
“simulations of such entanglement-assisted codes, and they have also studied the case in which a standard stabilizer code is used to protect the ebits [78].”
Near‐Capacity Variable‐Length Coding: Regular and Exit‐Chart‐Aided Irregular Designs
Hanzo, L., Maunder, R. G., Wang, J., & Yang, L. (2010) · Wiley eBooks · doi:10.1002/9780470666425 · Cited by 62 · 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.”
A 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 60 · cited 1×
“[55], [56], [57], [7], [58], [59], [60], [61]).”
Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes
Grassl, M., & Rötteler, M. (2006) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2006.261956 · Cited by 58 · cited 1×
“There are four memory states because there is only one memory qubit, and there are 16 edges because there are four memory states and four logical operators for one information qubit and one ebit.”
Trading classical communication, quantum communication, and entanglement in quantum Shannon Theory
Hsieh, M.-H., & Wilde, M. M. (2010) · Civil War Book Review · Cited by 57
Self-citationEfficient Quantum Stabilizer Codes: LDPC and LDPC-Convolutional Constructions
Tan, P., & Li, J. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034794 · Cited by 54 · cited 1×
“[55], [56], [57], [7], [58], [59], [60], [61]).”
Rapid carrier acquisition from baud-rate samples
Yuan, W. S., & Georghiades, C. N. (1999) · IEEE Transactions on Communications · doi:10.1109/26.764936 · Cited by 54
The quantum dynamic capacity formula of a quantum channel
Wilde, M. M., & Hsieh, M. H. (2012) · Civil War Book Review · Cited by 49
Self-citationQuantum Error Correction Beyond the Bounded Distance Decoding Limit
Kasai, K., Hagiwara, M., Imai, H., & Sakaniwa, K. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2167593 · Cited by 44 · cited 1×
“[55], [56], [57], [7], [58], [59], [60], [61]).”
Classical enhancement of quantum-error-correcting codes
Kremsky, I., Hsieh, M.-H., & Brun, T. A. (2008) · Physical Review A · doi:10.1103/physreva.78.012341 · Cited by 44 · cited 1×
“Another variation is an encoder that encodes both classical bits and qubits, and we might wonder if these could be simultaneously recursive and non-catastrophic (such codes are known as “classically-enhanced” codes [83] and are based on trade-off coding ideas from quantum Shannon theory [84]).”
Self-citationEncoding one logical qubit into six physical qubits
Shaw, B., Wilde, M. M., Oreshkov, O., Kremsky, I., & Lidar, D. A. (2008) · Physical Review A · doi:10.1103/physreva.78.012337 · Cited by 43 · cited 1×
“This possibility has long been one of the important practical questions concerning the entanglement-assisted paradigm, and some researchers have provided partial answers [62], [63], [64], [65].”
Self-citationThe quantum dynamic capacity formula of a quantum channel
Wilde, M. M., & Hsieh, M.-H. (2012) · Quantum Information Processing · doi:10.1007/s11128-011-0310-6 · Cited by 43 · cited 1×
“Its entanglement consumption rate is provably optimal for certain channels such as the dephasing channel [61]–[63], but it is not necessarily optimal for the depolarizing channel.”
Self-citation1 Quantum Error Correction beyond the Bounded Distance Decoding LimitPreprint
Kasai, K., Hagiwara, M., Imai, H., Fellow, L., Sakaniwa, K., & Member, S. (2016) · Cited by 38
Near-Capacity Variable-Length Coding: Regular and EXIT-Chart-Aided Irregular Designs
Hanzo, L. (2010) · Cited by 29
Quantum-shift-register circuits
Wilde, M. M. (2009) · Physical Review A · doi:10.1103/physreva.79.062325 · Cited by 29 · cited 1×
“There are four memory states because there is only one memory qubit, and there are 16 edges because there are four memory states and four logical operators for one information qubit and one ebit.”
Self-citationUnified quantum convolutional coding
Wilde, M. M., & Brun, T. A. (2008) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2008.4595008 · Cited by 24 · cited 1×
“[71], [73].”
Self-citationEntanglement-Assisted Quantum Error-Correcting Codes
Devetak, I., Brun, T. A., & Hsieh, M.-H. (2009) · New Trends in Mathematical Physics · doi:10.1007/978-90-481-2810-5_14 · Cited by 22 · cited 3×
“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.”
Self-citationMinimal-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 · cited 1×
“Also, a first principles approach gives control over the number of memory qubits used by the constituent quantum convolutional encoders [31], and this is an important parameter contributing”
Self-citationNonlocal quantum information in bipartite quantum error correction
Wilde, M. M., & Fattal, D. A. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0175-0 · Cited by 19
Self-citationCorrectable noise of quantum-error-correcting codes under adaptive concatenation
Fern, J. (2008) · Physical Review A · doi:10.1103/physreva.77.010301 · Cited by 17 · cited 1×
“The quantum hashing bound determines the rate at which a random quantum code can operate reliably for a particular depolarizing parameter p, but note that it does not give the ultimate capacity limit because degeneracy can improve performance [33], [55]–[57].”
Unified Quantum Convolutional CodingPreprint
Wilde, M. M., & Brun, T. A. (2008) · Cited by 17
Self-citationQuantum convolutional coding with shared entanglement: general structure
Wilde, M. M., & Brun, T. A. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0179-9 · Cited by 16 · cited 1×
“…stringent requirement is necessary due to the coset structure of EAQ codes.7 One might think that quasi-recursiveness is a sufficient requirement for good performance, but our simulation results in Section VI indicate that recursiveness is indeed necessary because a turbo code has a significant…”
BackgroundSelf-citationQuantum Convolutional Coding with Shared Entanglement: General StructurePreprint
Wilde, M. M., & Brun, T. A. (2010) · Cited by 15
Self-citationRecursive 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
Self-citationRecursive quantum convolutional encoders are catastrophic: A simple proof
Houshmand, M., & Wilde, M. M. (2013) · Civil War Book Review · Cited by 13
Self-citationMinimal-memory, noncatastrophic, polynomial-depth quantum convolutional encoders
Houshmand, M., Hosseini-Khayat, S., & Wilde, M. M. (2013) · Civil War Book Review · Cited by 12
Self-citationExtra shared entanglement reduces memory demand in quantum convolutional coding
Wilde, M. M., & Brun, T. A. (2009) · Physical Review A · doi:10.1103/physreva.79.032313 · Cited by 11 · cited 1×
“There are four memory states because there is only one memory qubit, and there are 16 edges because there are four memory states and four logical operators for one information qubit and one ebit.”
Self-citationMinimal-memory requirements for pearl-necklace encoders of quantum convolutional codes
Houshmand, M., Hosseini-Khayat, S., & Wilde, M. M. (2012) · Civil War Book Review · Cited by 11
Self-citationNonlocal quantum information in bipartite quantum error correction
Wilde, M. M., & Fattal, D. A. (2010) · Civil War Book Review · Cited by 11
Self-citationInterleaved concatenated codes: New perspectives on approaching the Shannon limit
Viterbi, A. J., Viterbi, A. M., & Sindhushayana, N. T. (1997) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.94.18.9525 · Cited by 10 · cited 1×
“[7] is the same for an EAQ convolutional encoder because it depends on the iterative decoding algorithm used to decode the code, and we can exploit the same iterative decoding algorithm as in Ref.”
Entanglement-enhanced quantum error-correcting codes
Dong, Y., Deng, X., Jiang, M., Chen, Q., & Yu, S. (2009) · Physical Review A · doi:10.1103/physreva.79.042342 · Cited by 9 · cited 1×
“ation PTO3R inner / PTO3REA outer even though it uses more ebits than this latter combination. the entanglement-assisted paradigm, and some researchers have provided partial answers [73], [74], [75], [76], [78]. We briefly review some of these contributions. Shaw et al. first observed that the [[7;1;3]] Steane code is e…”
Entanglement generation with a quantum channel and a shared state
Wilde, M. M., & Hsieh, M.-H. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513540 · Cited by 9 · cited 1×
“errors and entanglement errors occur [75].”
Self-citationMinimal-memory realization of pearl-necklace encoders of general quantum convolutional codes
Houshmand, M., & Hosseini-Khayat, S. (2011) · Physical Review A · doi:10.1103/physreva.83.022308 · Cited by 8
Convolutional and Block Quantum Error-Correcting Codes
Grassl, M. (2006) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw2.2006.323775 · Cited by 5 · cited 1×
“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].”
Minimal-Memory Requirements for Pearl-Necklace Encoders of Quantum Convolutional Codes
Houshmand, M., Hosseini-Khayat, S., & Wilde, M. M. (2010) · IEEE Transactions on Computers · doi:10.1109/tc.2010.226 · Cited by 4 · cited 1×
“We can always rearrange a Grassl-Rötteler pearl-necklace encoder as a convolutional encoder [34], [35], [36], but it is not clear that every convolutional encoder admits a form as a GrasslRötteler pearl necklace encoder.”
Self-citation
Research works printed but not linked: 8
- preskill, 1999, Quantum Computation Lecture Notes, 15
- wilde, 2010, EA-Turbo
- babar, 2013, Convergence analysis of quantum turbo codes using EXIT charts
- poulin, 2009, Iterative Quantum Coding Schemes LDPC and Turbo Codes
- ollivier, 2008, Quantum turbo codes
- tillich, 2009, Quantum Codes Suitable for Iterative Decoding
- shor, 2002, The quantum channel capacity and coherent information, MSRI Workshop Quantum Comput
- mceliece, 1998, Communications and Coding (P G Farrell 60th Birthday Celebration), 121
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-citation
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.