Quantum convolutional code

<h2 id="definition">Definition</h2>
A quantum convolutional stabilizer code acts on a <a href="/facts/Hilbert_space/aDFMh4lV">Hilbert space</a> 
 
 
 
 
 
 H
 
 
 ,
 
 
 {\displaystyle {\mathcal {H}},}

which is a <a href="/facts/Countably_infinite/Wj4DmWPv">countably infinite</a> <a href="/facts/Tensor_product/7K3pR1ap">tensor product</a> of two-dimensional <a href="/facts/Qubit/WveeEubw">qubit</a> <a href="/facts/Hilbert_space/aDFMh4lV">Hilbert spaces</a> indexed over integers ≥ 0

{
 
 
 
 H
 
 
 
 i
 
 
 }
 
 
 i
 ∈
 
 
 Z
 
 
 +
 
 
 
 
 
 
 {\displaystyle \left\{{\mathcal {H}}_{i}\right\}_{i\in \mathbb {Z} ^{+}}}
 
:

H
          
        
        =
        
          
            
              ⨂
              
                i
                =
                0
              
              
                ∞
              
            
          
        
         
        
          
            
              H
            
          
          
            i
          
        
        .
      
    
    {\displaystyle {\mathcal {H}}={\displaystyle \bigotimes \limits _{i=0}^{\infty }}\ {\mathcal {H}}_{i}.}

A sequence

A
 
 
 
 {\displaystyle \mathbf {A} }
 
 of <a href="/facts/Pauli_matrices/BdeC2wos">Pauli matrices</a> 
 
 
 
 
 
 {
 
 A
 
 i
 
 
 }
 
 
 i
 ∈
 
 
 Z
 
 
 +
 
 
 
 
 
 
 {\displaystyle \left\{A_{i}\right\}_{i\in \mathbb {Z} ^{+}}}
 
, where

A
        
        =
        
          
            
              ⨂
              
                i
                =
                0
              
              
                ∞
              
            
          
        
         
        
          A
          
            i
          
        
        ,
      
    
    {\displaystyle \mathbf {A} ={\displaystyle \bigotimes \limits _{i=0}^{\infty }}\ A_{i},}

can act on states in 
 
 
 
 
 
 H
 
 
 
 
 {\displaystyle {\mathcal {H}}}
 
. Let 
 
 
 
 
 Π
 
 
 
 Z
 
 
 +
 
 
 
 
 
 
 {\displaystyle \Pi ^{\mathbb {Z} ^{+}}}
 
 denote the set of all Pauli sequences. The support supp
 
 
 
 
 (
 
 A
 
 )
 
 
 
 {\displaystyle \left(\mathbf {A} \right)}
 
 of a Pauli sequence 
 
 
 
 
 A
 
 
 
 {\displaystyle \mathbf {A} }
 
 is the set of indices of the entries in 
 
 
 
 
 A
 
 
 
 {\displaystyle \mathbf {A} }
 
 that are not equal to the identity. The weight of a sequence 
 
 
 
 
 A
 
 
 
 {\displaystyle \mathbf {A} }
 
 is the size 
 
 
 
 
 |
 
 
 supp
 
 
 (
 
 A
 
 )
 
 
 |
 
 
 
 {\displaystyle \left\vert {\text{supp}}\left(\mathbf {A} \right)\right\vert }
 
 of its support. The delay del
 
 
 
 
 (
 
 A
 
 )
 
 
 
 {\displaystyle \left(\mathbf {A} \right)}
 
 of a sequence 
 
 
 
 
 A
 
 
 
 {\displaystyle \mathbf {A} }
 
 is the smallest index for an entry not equal to the
identity. The degree deg
 
 
 
 
 (
 
 A
 
 )
 
 
 
 {\displaystyle \left(\mathbf {A} \right)}
 
 of a sequence 
 
 
 
 
 A
 
 
 
 {\displaystyle \mathbf {A} }
 
 is the largest index for an entry not equal to the identity. E.g., the following Pauli sequence

I
              
              
                X
              
              
                I
              
              
                Y
              
              
                Z
              
              
                I
              
              
                I
              
              
                ⋯
              
            
          
        
        ,
      
    
    {\displaystyle {\begin{array}{cccccccc}I&X&I&Y&Z&I&I&\cdots \end{array}},}

has support 
 
 
 
 
 {
 
 1
 ,
 3
 ,
 4
 
 }
 
 
 
 {\displaystyle \left\{1,3,4\right\}}
 
, weight three, delay one, and degree four. A sequence has finite support if its weight is finite. Let

F
 (
 
 Π
 
 
 
 Z
 
 
 +
 
 
 
 
 )
 
 
 {\displaystyle F(\Pi ^{\mathbb {Z} ^{+}})}
 
 denote the set of Pauli sequences with finite support. The following definition for a quantum convolutional code utilizes the set 
 
 
 
 F
 (
 
 Π
 
 
 
 Z
 
 
 +
 
 
 
 
 )
 
 
 {\displaystyle F(\Pi ^{\mathbb {Z} ^{+}})}
 
 in its description.
A rate 
 
 
 
 k
 
 /
 
 n
 
 
 {\displaystyle k/n}
 
-convolutional stabilizer code with 
 
 
 
 0
 ≤
 k
 ≤
 n
 
 
 {\displaystyle 0\leq k\leq n}
 
 is a commuting set 
 
 
 
 
 
 G
 
 
 
 
 {\displaystyle {\mathcal {G}}}
 
 of all 
 
 
 
 n
 
 
 {\displaystyle n}
 
-qubit shifts of a basic generator set 
 
 
 
 
 
 
 G
 
 
 
 0
 
 
 
 
 {\displaystyle {\mathcal {G}}_{0}}
 
. The basic generator set 
 
 
 
 
 
 
 G
 
 
 
 0
 
 
 
 
 {\displaystyle {\mathcal {G}}_{0}}
 
 has

n
 −
 k
 
 
 {\displaystyle n-k}
 
 Pauli sequences of finite support:

G
            
          
          
            0
          
        
        =
        
          {
          
            
              
                G
              
              
                i
              
            
            ∈
            F
            (
            
              Π
              
                
                  
                    Z
                  
                  
                    +
                  
                
              
            
            )
            :
            1
            ≤
            i
            ≤
            n
            −
            k
          
          }
        
        .
      
    
    {\displaystyle {\mathcal {G}}_{0}=\left\{\mathbf {G} _{i}\in F(\Pi ^{\mathbb {Z} ^{+}}):1\leq i\leq n-k\right\}.}

The constraint length 
 
 
 
 ν
 
 
 {\displaystyle \nu }
 
 of the code is the maximum degree of the
generators in 
 
 
 
 
 
 
 G
 
 
 
 0
 
 
 
 
 {\displaystyle {\mathcal {G}}_{0}}
 
. A frame of the code consists of 
 
 
 
 n
 
 
 {\displaystyle n}
 
 qubits.
A quantum convolutional code admits an equivalent definition in terms of the delay transform or 
 
 
 
 D
 
 
 {\displaystyle D}
 
-transform. The 
 
 
 
 D
 
 
 {\displaystyle D}
 
-transform captures shifts of the basic generator set 
 
 
 
 
 
 
 G
 
 
 
 0
 
 
 
 
 {\displaystyle {\mathcal {G}}_{0}}
 
. Let us define the 
 
 
 
 n
 
 
 {\displaystyle n}
 
-qubit delay operator 
 
 
 
 D
 
 
 {\displaystyle D}
 
 acting on any Pauli sequence 
 
 
 
 
 A
 
 ∈
 
 Π
 
 
 
 Z
 
 
 +
 
 
 
 
 
 
 {\displaystyle \mathbf {A} \in \Pi ^{\mathbb {Z} ^{+}}}
 
 as follows:

D
        
          (
          
            A
          
          )
        
        =
        
          I
          
            ⊗
            n
          
        
        ⊗
        
          A
          .
        
      
    
    {\displaystyle D\left(\mathbf {A} \right)=I^{\otimes n}\otimes \mathbf {A.} }

We can write 
 
 
 
 j
 
 
 {\displaystyle j}
 
 repeated applications of 
 
 
 
 D
 
 
 {\displaystyle D}
 
 as a power of 
 
 
 
 D
 
 
 {\displaystyle D}
 
:

D
          
            j
          
        
        
          (
          
            A
          
          )
        
        =
        
          I
          
            ⊗
            j
            n
          
        
        ⊗
        
          A
          .
        
      
    
    {\displaystyle D^{j}\left(\mathbf {A} \right)=I^{\otimes jn}\otimes \mathbf {A.} }

Let 
 
 
 
 
 D
 
 j
 
 
 
 (
 
 
 
 G
 
 
 
 0
 
 
 )
 
 
 
 {\displaystyle D^{j}\left({\mathcal {G}}_{0}\right)}
 
 be the set of shifts of elements
of 
 
 
 
 
 
 
 G
 
 
 
 0
 
 
 
 
 {\displaystyle {\mathcal {G}}_{0}}
 
 by 
 
 
 
 j
 
 
 {\displaystyle j}
 
. Then the full stabilizer 
 
 
 
 
 
 G
 
 
 
 
 {\displaystyle {\mathcal {G}}}
 
 for the
convolutional stabilizer code is

G
          
        
        =
        
          
            
              ⋃
              
                j
                ∈
                
                  
                    Z
                  
                  
                    +
                  
                
              
            
          
        
        
          D
          
            j
          
        
        
          (
          
            
              
                G
              
            
            
              0
            
          
          )
        
        .
      
    
    {\displaystyle {\mathcal {G}}={\textstyle \bigcup \limits _{j\in \mathbb {Z} ^{+}}}D^{j}\left({\mathcal {G}}_{0}\right).}

<h2 id="operation">Operation</h2>
The operation of a convolutional stabilizer code is as follows. The protocol begins with the sender encoding a stream of qubits with an online encoding circuit such as that given in (Grassl and Roetteler 2006). The encoding circuit is online if it acts on a few blocks of qubits at a time. The sender transmits a set of qubits as soon as the first unitary finishes processing them. The receiver measures all the generators in 
 
 
 
 
 
 G
 
 
 
 
 {\displaystyle {\mathcal {G}}}
 
 and corrects for errors as he receives the online encoded qubits. He finally decodes the encoded qubits with a decoding circuit. The qubits decoded from this convolutional procedure should be error free and ready for quantum computation at the receiving end.
A finite-depth circuit maps a Pauli sequence with finite weight to one with finite weight (Ollivier and Tillich 2004). It does not map a Pauli sequence with finite weight to one with infinite weight. This property is important because we do not want the decoding circuit to propagate uncorrected errors into the information qubit stream (Johannesson and Zigangirov 1999). A finite-depth decoding circuit corresponding to the <a href="/facts/Stabilizer_code/GBMP0prE">stabilizer</a> 
 
 
 
 
 
 G
 
 
 
 
 {\displaystyle {\mathcal {G}}}
 
 exists by the algorithm given in (Grassl and Roetteler 2006).

<h2 id="example">Example</h2>
Forney et al. provided an example of a rate-1/3 quantum convolutional code by importing a particular classical quaternary convolutional code (Forney and Guha 2005). Grassl and Roetteler determined a noncatastrophic encoding circuit for Forney et al.'s rate-1/3 quantum convolutional code (Grassl and Roetteler 2006). The basic stabilizer and its first shift are as follows:

⋯
        
          
            
              
                
                  I
                
                
                  I
                
                
                  I
                
                
                  X
                
                
                  X
                
                
                  X
                
                
                  X
                
                
                  Z
                
                
                  Y
                
                
                  I
                
                
                  I
                
                
                  I
                
                
                  I
                
                
                  I
                
                
                  I
                
              
              
                
                  I
                
                
                  I
                
                
                  I
                
                
                  Z
                
                
                  Z
                
                
                  Z
                
                
                  Z
                
                
                  Y
                
                
                  X
                
                
                  I
                
                
                  I
                
                
                  I
                
                
                  I
                
                
                  I
                
                
                  I
                
              
              
                
                  I
                
                
                  I
                
                
                  I
                
                
                  I
                
                
                  I
                
                
                  I
                
                
                  X
                
                
                  X
                
                
                  X
                
                
                  X
                
                
                  Z
                
                
                  Y
                
                
                  I
                
                
                  I
                
                
                  I
                
              
              
                
                  I
                
                
                  I
                
                
                  I
                
                
                  I
                
                
                  I
                
                
                  I
                
                
                  Z
                
                
                  Z
                
                
                  Z
                
                
                  Z
                
                
                  Y
                
                
                  X
                
                
                  I
                
                
                  I
                
                
                  I
                
              
            
          
        
        ⋯
      
    
    {\displaystyle \cdots {\begin{array}{|ccc|ccc|ccc|ccc|ccc|}I&I&I&X&X&X&X&Z&Y&I&I&I&I&I&I\\I&I&I&Z&Z&Z&Z&Y&X&I&I&I&I&I&I\\I&I&I&I&I&I&X&X&X&X&Z&Y&I&I&I\\I&I&I&I&I&I&Z&Z&Z&Z&Y&X&I&I&I\\\end{array}}\cdots }

The code consists of all three-qubit shifts of the above generators. The vertical bars are a visual aid to illustrate the three-qubit shifts of the basic generators. The code can correct for an arbitrary single-qubit error in every other frame.

<h2 id="extensions">Extensions</h2>
Wilde and Brun have integrated the theory of <a href="/facts/Entanglement-assisted_stabilizer_code/0lYHHorq">entanglement-assisted stabilizer codes</a> and quantum convolutional codes in a series of articles (Wilde and Brun 2007a, 2007b, 2008, 2009) to form a theory of entanglement-assisted quantum convolutional coding. This theory supposes that a sender and receiver share noiseless bipartite <a href="/facts/Quantum_entanglement/afzslwN0">entanglement</a> that they can exploit for protecting a stream of quantum information.
(Wilde 2009), building on work of (Ollivier and Tillich 2004) and (Grassl and Roetteler 2006), also showed how to encode these codes with quantum shift register circuits, a natural extension of the theory of
classical <a href="/facts/Shift_register/foHzdJft">shift register</a> circuits.

<ul><li>Ollivier, Harold; Tillich, Jean-Pierre (2003). "Description of a Quantum Convolutional Code". Physical Review Letters. 91 (17): 177902. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/quant-ph/0304189">quant-ph/0304189</a>. <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/2003PhRvL..91q7902O">2003PhRvL..91q7902O</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1103%2FPhysRevLett.91.177902">10.1103/PhysRevLett.91.177902</a>. <a href="/facts/PMID_(identifier)/JlHAvMHt">PMID</a> <a href="https://pubmed.ncbi.nlm.nih.gov/14611378">14611378</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:17261900">17261900</a>.</li>
<li>Ollivier, H.; Tillich, J. -P. (2004). "Quantum convolutional codes: Fundamentals". <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/quant-ph/0401134">quant-ph/0401134</a>. <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/2004quant.ph..1134O">2004quant.ph..1134O</a>. {{cite journal}}: Cite journal requires |journal= (help)</li>
<li><a href="/facts/Dave_Forney/dKvnKPT2">Forney, G. David</a> (2005). "Simple rate-1/3 convolutional and tail-biting quantum error-correcting codes". Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. pp. 1028–1032. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/quant-ph/0501099">quant-ph/0501099</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1109%2FISIT.2005.1523495">10.1109/ISIT.2005.1523495</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-7803-9151-9. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:14484674">14484674</a>.</li>
<li>David Forney, G. David; Grassl, Markus; Guha, Saikat (2007). "Convolutional and Tail-Biting Quantum Error-Correcting Codes". IEEE Transactions on Information Theory. 53 (3): 865–880. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/quant-ph/0511016">quant-ph/0511016</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1109%2FTIT.2006.890698">10.1109/TIT.2006.890698</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:546490">546490</a>.</li>
<li>M. Grassl and M. Roetteler, “Quantum convolutional codes: Encoders and structural properties,” in Forty-Fourth Annual Allerton Conference, 2006. Available at <a href="http://www.csl.illinois.edu/allerton/archives/allerton06/PDFs/papers/0285.pdf">http://www.csl.illinois.edu/allerton/archives/allerton06/PDFs/papers/0285.pdf</a>[permanent dead link]</li>
<li>Grassl, Markus; Rotteler, Martin (2006). "Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes". 2006 IEEE International Symposium on Information Theory. pp. 1109–1113. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/quant-ph/0602129">quant-ph/0602129</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1109%2FISIT.2006.261956">10.1109/ISIT.2006.261956</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 1-4244-0505-X. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:1442">1442</a>.</li>
<li>R. Johannesson and K. S. Zigangirov, Fundamentals of Convolutional Coding. Wiley-IEEE Press, 1999.</li>
<li>Wilde, Mark M.; Krovi, Hari; Brun, Todd A. (2010). "Convolutional entanglement distillation". 2010 IEEE International Symposium on Information Theory. pp. 2657–2661. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/0708.3699">0708.3699</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1109%2FISIT.2010.5513666">10.1109/ISIT.2010.5513666</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1-4244-7892-7. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:2409176">2409176</a>.</li>
<li>Wilde, Mark M.; Brun, Todd A. (2010). "Entanglement-assisted quantum convolutional coding". Physical Review A. 81 (4): 042333. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/0712.2223">0712.2223</a>. <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/2010PhRvA..81d2333W">2010PhRvA..81d2333W</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1103%2FPhysRevA.81.042333">10.1103/PhysRevA.81.042333</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:8410654">8410654</a>.</li>
<li>Wilde, Mark M.; Brun, Todd A. (2010). "Quantum convolutional coding with shared entanglement: General structure". Quantum Information Processing. 9 (5): 509–540. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/0807.3803">0807.3803</a>. <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/2010QuIP....9..509W">2010QuIP....9..509W</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2Fs11128-010-0179-9">10.1007/s11128-010-0179-9</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:18185704">18185704</a>.</li>
<li>Wilde, Mark M. (2008). "Quantum Coding with Entanglement". <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/0806.4214">0806.4214</a>. {{cite journal}}: Cite journal requires |journal= (help)</li>
<li>Wilde, Mark M.; Brun, Todd A. (2009). "Extra shared entanglement reduces memory demand in quantum convolutional coding". Physical Review A. 79 (3): 032313. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/0812.4449">0812.4449</a>. <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/2009PhRvA..79c2313W">2009PhRvA..79c2313W</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1103%2FPhysRevA.79.032313">10.1103/PhysRevA.79.032313</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:67826844">67826844</a>.</li>
<li>Wilde, Mark M. (2009). "Quantum-shift-register circuits". Physical Review A. 79 (6): 062325. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/0903.3894">0903.3894</a>. <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/2009PhRvA..79f2325W">2009PhRvA..79f2325W</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1103%2FPhysRevA.79.062325">10.1103/PhysRevA.79.062325</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:56351003">56351003</a>.</li></ul>
<h2 id="further-reading">Further reading</h2>

<h3>Publications</h3>
<ul><li>Houshmand, Monireh; Wilde, Mark M. (2013). "Recursive Quantum Convolutional Encoders are Catastrophic: A Simple Proof". IEEE Transactions on Information Theory. 59 (10): 6724–6731. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/1209.0082">1209.0082</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1109%2FTIT.2013.2272932">10.1109/TIT.2013.2272932</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:15309497">15309497</a>.</li>
<li>Lai, Ching-Yi; Hsieh, Min-Hsiu; Lu, Hsiao-Feng (2016). "On the Mac Williams Identity for Classical and Quantum Convolutional Codes". IEEE Transactions on Communications. 64 (8): 3148–3159. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/1404.5012">1404.5012</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1109%2FTCOMM.2016.2585641">10.1109/TCOMM.2016.2585641</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:7123143">7123143</a>.</li>
<li>Poulin, David; Tillich, Jean-Pierre; Ollivier, Harold (2007). "Quantum serial turbo-codes". <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/0712.2888">0712.2888</a>. {{cite journal}}: Cite journal requires |journal= (help)</li>
<li>Djordjevic, Ivan (2012). Quantum information processing and quantum error correction: an engineering approach. Academic press. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 9780123854919.</li>
<li>Brun, Todd A. (2013). Lidar, Daniel A.; Brun, Todd A. (eds.). Quantum error correction. Cambridge University Press. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/1910.03672">1910.03672</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 9780521897877.</li></ul>

Quantum convolutional code open-in-new

Quantum convolutional code