Quantum Convolutional Error Correcting Codes H. F. Chau Department of Physics, University of Hong Kong, Pokfulam Road, Hong Kong (May 19, 1998) I repo
|
|
- Leon Webb
- 5 years ago
- Views:
Transcription
1 Quantum Convolutional Error Correcting Codes H. F. Chau Department of Physics, University of Hong Kong, Pokfulam Road, Hong Kong (May 9, 998) I report two general methods to construct quantum convolutional codes for N-state quantum systems. Using these general methods, I construct a quantum convolutional code of rate /4, which can correct one quantum error for every eight consecutive quantum registers. PACS numbers: a, Lx, c, h A quantum computer is more ecient than a classical computer in useful applications such as integer factorization [] and database search []. However, decoherence remains one of the major obstacles to building a quantum computer [3]. Nevertheless, the eect of decoherence can be compensated for if one introduces redundancy in the quantum state. By rst encoding a quantum state into a larger Hilbert space H. Then by projecting the wave function into a suitable subspace C of H. And nally by applying a unitary transformation to the orthogonal complement of Caccording to the measurement result; it is possible to correct quantum errors due to decoherence. This scheme is called the quantum error correction code (QECC) [4]. Many QECCs have been discovered (see, for example, Refs. [4{5]) and various theories on the QECC have also been developed (see, for example, Refs. [8{8]). In particular, the necessary and sucient condition for a QECC is [6{9] hi encode ja y Bjj encode i A;B ij ; () where ji encode i denotes the encoded quantum state jii using the QECC; A; B are the possible errors the QECC can handle; and A;B is a complex constant independent ofji encode i and jj encode i. Note that the above condition for a QECC is completely general, working for nite or innite number of N-state quantum registers. All QECCs discovered so far are block codes. That is, the original state ket is rst divided into nite blocks of the same length. Each block is then encoded separately using a code which is independent of the state of the other blocks (cf. Refs. [0,]). In addition to block codes, convolutional codes are well known in classical error correction. Unlike a block code, the encoding operation depends on current as well as a number of past information bits [0,]. For instance, given a (possibly innite) sequence of classical binary numbers (a ;a ;:::;a m ;:::), the encoding (b ;c ;b ;c ;:::;b m ;c m ;:::) with b i a i + a i mod ; c i a i + a i + a i mod () for all i, and a 0 a 0 is able to correct up to one error for every two consecutive bits []. In classical error correction, good convolutional codes often can encode with higher eciencies than their corresponding block codes in a noisy channel [0,]. It is, therefore, instructive to nd quantum convolutional codes (QCC) and to analyze their performance. In this letter, I rst report a way to construct a QCC from a known quantum block code (QBC). Then I discuss a way toconstruct a QCC from a known classical convolutional code. Finally, I report the construction of a QCC of rate /4 which can correct one quantum error for every eight consecutive quantum registers. Let me rst introduce some notations before I construct QCCs. Suppose each quantum register has N orthogonal eigenstates for N. Then, the basis of a general quantum state consisting of many quantum registers can be written as fjkigfjk P ;k ;:::;k m ;:::ig for all k m Z N. And I abuse the notation by dening k m 0 for all m 0. Suppose jki 7! i ;i ;:::;i m a (k) i ;i ;:::;i m ji ;i ;:::;i m i be a QBC mapping one quantum register to a code of length m. Hence, the rate of the code equals m. The eect of decoherence can be regarded as an error operator acting on certain quantum registers. I denote the set of all possible errors that can be corrected by the above quantum block code by E. Based on this QBC, one can construct a family of QCCs as follows: hfchau@hkusua.hku.hk Perhaps the simplest way to see that Eq. () holds for innite number of N-state registers is to observe that Gottesman's proof in Ref. [9] does not depend on the niteness of the Hilbert space for encoded state.
2 Theorem Given the above QBC and a quantum state jki jk ;k ;:::;k n ;:::i making up of possibly innitely many quantum registers, then the encoding jki jk ;k ;:::;k n ;:::i 7!jk encode i +O 4 i P ( p a ipkp) j i;j i;:::;j im 3 j i;j i;:::;j im jj i ;j i ;:::;j im i5 ; (3) forms a QCC of rate m provided that the matrix ip is invertible. This QCC can handle errors in the form E E. Proof: I consider the eects of errors EE E and E 0 E 0 E 0 EE on the encoded quantum registers by computing hk 0 encodeje 0y Ejk encode i Y 4 i j i;:::;j im;j 0 i ;:::;j0 im Substituting Eq. () into Eq. (4), we have a (P p 0 ip 0 k0 p 0 ) j 0 i ;:::;j0 im (P p a ipkp) j i;:::;j im hj 0 i ;:::;j0 imje 0y 3 i E ijj i ;:::;j im i5 : (4) hk 0 encodeje 0y Ejk encode i + Y hdp p ipkp 0 i + Y i h encode Pp ipkp;p p ipk0 p E i;e 0 i E 0y i E i P Ei p ipk p encode i (5) for some constants Ei;E 0 i independent of k and k0. Since the matrix is invertible, k i k 0 i solution of the systems of linear equations P p ipk p P p ipk 0 p. Consequently, for all i is the unique hk 0 encodeje 0y Ejk encode i k;k 0 E;E 0 (6) for some constant E;E 0independent ofkand k 0. Thus, the encoding in Eq. (3) is a QECC. At this point, readers should realize that the above scheme can be generalized to construct a QCC from a QBC which maps n quantum registers to m (> n) registers. It is also clear that the following two useful corollaries follow directly from Theorem : Corollary The encoding scheme given by Eq. (3) gives a QCC from a QBC provided that () the elements in the matrix are either zeros or ones; () ip is a function of i p only; and (3) ip (i p) consists of nitely many ones. Corollary The encoding scheme given by Eq. (3) gives a QCC from a QBC if () N is a prime power; () is not a zero matrix; and (3) ip is a function of i p only. Let me illustrate the above analysis by an example. Example Starting from the spin ve register code in Ref. [], one knows that the following QCC can correct up to one error in every ve consecutive quantum registers: 7! jk ;k ;:::;k m ;:::i " +O i N! (ki+ki )(pi+qi+ri)+piri N 3 p i;q i;r i0 N jp i ;q i ;p i +r i ;q i +r i ;p i +q i +k i +k i i (7) where k m Z N,! N is a primitive N th root of unity, and all additions in the state ket are modulo N. The rate of this code equals /5.
3 Although the QCC in Eq. (3) looks rather complicated, the actual encoding process can be performed readily. Because is invertible, one can reversibly map jk ;k ;:::;k n ;:::ito j P p pk p ; P p pk p ;:::; P p npk p ;:::i[3{5]. Then, one obtains the above ve register QCC by encoding each quantum register using the procedure in Ref. []. Now, I turn to the construction of QCCs from classical convolutional codes. Let me rst introduce two technical lemmas (which work for both QBCs and QCCs). Lemma Suppose the QECC jki 7! a (k) j jj ;j ;::: ;j ;:::i (8) j ;j ;::: corrects (independent) spin ip errors in certain quantum registers with j i Z N. Then, the following QECC, which is obtained by discrete Fourier transforming every quantum register in Eq. (8), jki 7! a (k) j ;j ;::: j ;j ;:::;p ;p ;::: + Y i p N! jipi N jp ;p ;:::i (9) corrects (independent) phase errors occurring in the same quantum registers. The converse is also true. Proof: Observe that one can freely choose a computational P basis for the encoded quantum state. In particular, if one N chooses the discrete Fourier transformed basis fj ~mig f j0!jm N jjig for each ofthe encoded quantum register, then the encoding in Eq. (9) is reduced to the encoding in Eq. (8). Thus, the code in Eq. (9) handles spin ip errors with respected to the discrete Fourier transformed basis fj ~mig. Consequently, the same code handles phase errors in the original fjmig basis. Conversely, suppose one chooses the original fjmig basis to encode a phase error correcting code. Then with respected to the fj ~mig basis, it is easy to check that the same code corrects spin ip errors. Lemma Suppose a QECC handles errors E and E satisfying (a) for all E i E i (i ;), there exists E 0 E such that E y E E y E0 ; and (b) for E i; E 0 i E i (i ;), E y i E0 i E i whenever errors E i and E 0 i occur at the same set of quantum registers; then the QECC actually handles errors in E E fe E :E E ;E E and errors E ; E occur at the same set of quantum registersg. Proof: One knows from Eq. () that hk 0 encode jey i E0 i jk encodei k;k 0 Ei;E i 0 for some E i;ei 0 independent ofk(i;). Also, Eq. () implies that the eect of an error E i is simply to rigidly rotate and to contract (or expand) the encoded ket space independent of the state jk encode i itself. Thus, one concludes that D E k 0 encode (E + E ) y (E + E ) k encode k;k 0 E ;E (0a) and D E k 0 encode (E + ie ) y (E + ie ) k encode k;k 0 0 E ;E (0b) for all E i E i (i ;), where E ;E and 0 E ;E are independent of k. By expanding Eqs. (0a) and (0b), one arrives at hk 0 encodeje y E jk encode i k;k 0 E;E () for some E;E independent ofk. Finally, I consider errors E i ; Ei 0 E i (i ;) occurring at the same set of quantum registers, then D E k 0 encode (EE 0 ) 0 y (E E ) k encode hk 0 encode je0y E0yE E jk encode i hk 0 encodeje 00 E 00 jk encode i () for some E 00 i E i (i ;). Hence from Eqs. () and (), I conclude that the QECC handles errors in the set E E. The next corollary follows directly from Lemma. 3
4 Corollary 3 A QECC handles general quantum error if and only if it handles both spin ip and phase errors in the corresponding quantum registers. Now, I am ready to prove the following theorem regarding the construction of quantum codes from classical codes. Theorem Suppose QECCs C and C handle phase shift and spin ip errors, respectively, for the same set of quantum registers. Then, pasting the two codes together by rst encodes the quantum state using C then further encodes the resultant quantum state using C, one obtains a QECC C which corrects general errors in the same set of quantum registers. Proof: From Corollary 3, it suces to show that the new QECC C corrects both spin ip and phase errors. By the construction of C, it clearly can correct spin ip errors. And using the same trick in the proof of Lemma, it is easy to check that C can correct phase shift errors as well. Readers should note that the order of pasting in Theorem is important. Reversing the order of encoding does not give a good quantum code. Also, proofs of Corollary 3 and Theorem for the case of N can also be found, for example, in Ref. [9]. Theorem 3 Suppose C is a classical (block or convolutional) code of rate r that can correct p (classical) errors for every q consecutive registers. Then, C can be extended to a QECC of rate r that can correct at least p quantum errors for every q consecutive quantum registers. Proof: Suppose C is a classical code. By mapping m to jmi for all m Z N, C can be converted to a quantum code for spin ip errors. Let C 0 be the QECC obtained by Fourier transforming each quantum register of C. Then Lemma implies that C 0 is a code for phase shift errors. From Theorem, pasting codes C and C 0 together will create a QECC C 00 of rate r. Finally, one can verify the error correcting capability ofc 00 readily [6]. Theorem 3 is useful to create high rate QCCs from high rate classical convolutional codes. Note that one of the simplest classical convolutional code with rate isgiven by Eq. (). Being a non-systematic and non-catastrophic 3 code [], it serves as an ideal starting point to construct good QCCs. First, let me write down this code in quantum mechanical form: Lemma 3 The QCC jk ;k ;:::i7! +O i jk i + k i ;k i +k i +k i i (3) for all k i Z N, where all additions in the state ket are modulo N,can correct up to one spin ip error for every four consecutive quantum registers. Proof: Using notations as in the proof of Theorem, I consider hk 0 encode je0y Ejk encode i. Clearly, the worst case happens when errors E and E 0 occur at dierent quantum registers. And in this case, Eq. (3) implies that exactly two ofthe following four equations hold: 8 >< >: k i + k i k 0 i + k0 i k i + k i + k i k 0 i + k 0 i + k 0 i k i+ + k i k 0 i+ + k0 i k i+ + k i + k i k 0 i+ + k 0 i + k 0 i for all i. One may regard k i s as unknowns and ki 0 s as arbitrary but xed constants. Then, by straight forward computation, one can show that picking any two equations out of Eq. (4) for each i will form an invertible system with the unique solution k i ki 0 for all i. Thus, hk0 encode je0y Ejk encode i k;k 0 E;E 0 and hence this lemma is proved. (4) That is, both b i and c i are not equal to a i. 3 That is, a nite number of channel errors does not create an innite number of decoding errors. 4
5 Example Theorem 3 and Lemma 3 imply that the following QCC of rate /4: " +O jk ;k ;:::i7!jk encode i i N p ;q ;:::!(ki+ki )pi+(ki+ki +ki )qi N jp i + p i ;p i +p i +q i ;q i +q i ;q i +q i +p i i (5) for all k i Z N, where all additions in the state ket are modulo N can correct at least one error for every 6 consecutive quantum registers. But, in fact, this code is powerful enough to correct one error for every eight consecutive quantum registers (see also Ref. [6]). Proof: Let E and E 0 be two quantum errors aecting at most one quantum register per every eight consecutive ones. By considering hk 0 encode je0y Ejk encode i, I know that at least six of the following eight equations hold: 8 >< >: p i + p i p 0 i + p 0 i p i + p i + q i p 0 i + p0 i + q0 i q i + q i q 0 i + q0 i q i + q i + p i q 0 i + q0 i + p0 i p i + p i p 0 i + p0 i p i + p i + q i p 0 i + p0 i + q0 i q i + q i q 0 i + q0 i q i + q i + p i q 0 i + q 0 i + p 0 i for all i Z +. Let me regard p i and q i as unknowns; and p 0 i and q0 i (6) as arbitrary but xed constants. Then, it is straight forward to show that choosing any six equations in Eq. (6) for each i Z + would result in a consistent system having a unique solution of p i p 0 i and q i q 0 i for all i Z +. Consequently, hk 0 encode je0y Ejk encode i p ;q ;p ;q ;:::( +Y i P i ji pj (kj +kj k0 j kj 0 )+qj (kj +kj +kj k0 j kj 0 kj 0 )! N ) hf i je 0y i jf iihg i jejg i i (7) for some linearly independent functions f i (p ;q ;p ;q ;:::) and g i (p ;q ;p ;q ;:::). Now, I consider a basis fh i (p ;q ;p ;q ;:::)gfor the orthogonal complement of the span of ff i ;g i g iz +. By summing over all h i s while keeping f i s and g i s constant in Eq. (7), one ends up with the constraints that k i k 0 i for all i Z+. Thus, hk 0 encode je0y Ejk encode i k;k 0 p ;q ;p ;q ;:::" +Y i hf i (p ;q ;:::)je 0y jf i (p ;q ;:::)ihg i (p ;q ;:::)jejg i (p ;q ;:::)i : (8) Hence, Eq. (5) corrects up to one quantum error per every eight consecutive quantum registers. The above rate /4 QCC is constructed from a classical convolutional code of rate /. One may further boost up the code performance by converting other ecient classical convolutional codes (such as various k(k + )-rate codes in Ref. [7]) into QCCs. On the other hand, it is impossible to construct a four quantum register QBC that can correct one quantum error [,6]. With modication, the same argument can be used to show that no QCC can correct one error for every four consecutive quantum registers [6]. It is instructive to compare the performances of QBCs and QCCs in other situations. In addition, in order use QCCs in quantum computation, one must investigate the possibility of fault tolerant computation on them. Moreover, it would be ideal if the fault tolerant implementation of single and two-quantum register operations must involve only a nite number of quantum registers in the QCC. While a general QCC may not admit a nite fault tolerant implementation, many QCCs with nite memories 4 can be manipulated fault tolerantly. 4 That is, codes with encoding schemes which depend on a nite number of quantum registers in jki. 5
6 Example 3 By subtracting those quantum registers containing p i, p i+, q i, q i+ and q i+ by one in Eq. (5), one ends up with changing jk ;k ;:::;k i ;::: encode i to jk ;k ;:::;k i ;k i +;k i+ ;::: encode i. Clearly, the above operation is fault tolerant and involves only a nite number of quantum registers. Fault tolerant implementation of single register phase shift can be obtained in a similar way. Further results on fault tolerant implementation on QCCs will be reported elsewhere [9]. Finally, decoding a classical convolutional code can be quite involved [8]. So, it is worthwhile to investigate the eciency of decoding a QCC. I shall report them in future works [9]. ACKNOWLEDGMENTS Iwould like to thank T. M. Ko for introducing me the subject of convolutional codes. Iwould also like to thank Debbie Leung, H.-K. Lo and Eric Rains for their useful discussions. This work is supported by the Hong Kong Government RGC grant HKU 7095/97P. [] P. W. Shor, in Proceedings of the 35th Annual Symposium on the Foundation of Computer Science, edited by S. Goldwasser (IEEE Computer Society, Los Alamitos, CA, 994), p. 4. [] L. K. Grover, in Proceedings of the 8th Annual ACM Symposium on the Theory of Computing (ACM Press, New York, 996), p.. [3] R. Landauer, in Proceedings of PHYSCOMP94, edited by D. Matzke (IEEE Computer Society, Los Alamitos, CA, 994), p. 54. [4] P. W. Shor, Phys. Rev. A 5, 493 (995). [5] R. Laamme, C. Miquel, J. P. Paz and W. H. Zurek, Phys. Rev. Lett. 77, 98 (996). [6] A. R. Calderbank and P. W. Shor, Phys. Rev. A 54, 098 (996). [7] A. M. Steane, Phys. Rev. A 54, 474 (996). [8] A. M. Steane, Phys. Rev. Lett. 77, 793 (996). [9] A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, Phys. Rev. Lett. 78, 405 (997). [0] D. Gottesman, Phys. Rev. A 54, 86 (996). [] H. F. Chau, Phys. Rev. A 55, 839 (997). [] H. F. Chau, Phys. Rev. A 56, (997). [3] E. M. Rains, R. H. Hardin, P. W. Shor and N. J. A. Sloane, Phys. Rev. Lett. 79, 953 (997). [4] S. Llyod, and J.-J. E. Slotine, Los Alamos preprint archive quant-ph/970 (997). [5] S. L. Braunstein, Los Alamos preprint archive quant-ph/97049 (997). [6] E. Knill and R. Laamme, Phys. Rev. A 55, 900 (997). [7] E. Knill, Los Alamos preprint archive quant-ph/ (996). [8] C. H. Bennett, D. P. DiVincenzo, J. A. Smolin and W. K. Wootters, Phys. Rev. A 54, 384 (996). [9] D. Gottesman, Ph.D. Thesis, Caltech (997), chap.. [0] Ph. Piret, Convolutional Codes: An Algebraic Approach (MIT Press, Cambridge, MA, 988). [] A. Dholakia, Introduction to Convolutional Codes with Applications (Kluwer, Dordrecht, 994). [] See, for example, chap. 4 in Ref. []. [3] C. H. Bennett, IBM J. Res. Dev. 7, 55 (973). [4] C. H. Bennett, SIAM J. Comp. 8, 766 (989). [5] H. F. Chau and H.-K. Lo, Cryptologia, 39 (997). [6] H. F. Chau, to appear in the Proc. of the st NASA International Conf. on Quant. Comp. and Quant. Comm. (998). [7] A list of good classical convolutional codes can be found, for example, in appendix A of Ref. []. [8] See, for example, chaps. 5{8 in Ref. []. [9] H. F. Chau, in preparation (998). 6
A scheme for protecting one-qubit information against erasure. error. Abstract
A scheme for protecting one-qubit information against erasure error Chui-Ping Yang 1, Shih-I Chu 1, and Siyuan Han 1 Department of Chemistry, University of Kansas, and Kansas Center for Advanced Scientific
More informationLos A 96.- Los Alamos National Laboratory Los Alamos New Mexico ASSUMPTIONS FOR FAULT TOLERANT QUANTUM COMPUTING. E.
1 LA-UR 96.- Los Alamos National Laboratory is operated by the Universityof California for the United States Department of Energy under contract W-7405-ENG-36. TITLE: AUTHOR(S): SUBMITTED TO: ASSUMPTIONS
More informationwith the ability to perform a restricted set of operations on quantum registers. These operations consist of state preparation, some unitary operation
Conventions for Quantum Pseudocode LANL report LAUR-96-2724 E. Knill knill@lanl.gov, Mail Stop B265 Los Alamos National Laboratory Los Alamos, NM 87545 June 1996 Abstract A few conventions for thinking
More informationquant-ph/ v3 15 Oct 1996
Accuracy Threshold for Quantum Computation quant-ph/9610011 v3 15 Oct 1996 Emanuel Knill 1, Raymond Laamme 2 y, Wojciech Zurek 2z 1 CIC-3, MS B265, 2 T-6, MS B288 Los Alamos National Laboratory, NM 87545,
More informationQuantum error correction in the presence of spontaneous emission
PHYSICAL REVIEW A VOLUME 55, NUMBER 1 JANUARY 1997 Quantum error correction in the presence of spontaneous emission M. B. Plenio, V. Vedral, and P. L. Knight Blackett Laboratory, Imperial College London,
More informationarxiv:quant-ph/ v1 27 Feb 1996
1 PEFECT QUANTUM EO COECTION CODE aymond Laflamme 1, Cesar Miquel 1,2, Juan Pablo Paz 1,2 and Wojciech Hubert Zurek 1 1 Theoretical Astrophysics, T-6, MS B288 Los Alamos National Laboratory, Los Alamos,
More informationTheory of fault-tolerant quantum computation
PHYSICAL REVIEW A VOLUME 57, NUMBER 1 JANUARY 1998 Theory of fault-tolerant quantum computation Daniel Gottesman* California Institute of Technology, Pasadena, California 91125 and Los Alamos National
More informationTHE additive or stabilizer construction of quantum error
1700 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 4, APRIL 2008 Boolean Functions, Projection Operators, and Quantum Error Correcting Codes Vaneet Aggarwal, Student Member, IEEE, and A Robert Calderbank,
More informationRecovery in quantum error correction for general noise without measurement
Quantum Information and Computation, Vol. 0, No. 0 (2011) 000 000 c Rinton Press Recovery in quantum error correction for general noise without measurement CHI-KWONG LI Department of Mathematics, College
More informationDecoherence Bounds on Quantum Computation with. Trapped Ions. Richard J. Hughes, Daniel F. V. James, Emanuel H. Knill, Raymond Laamme and
Decoherence Bounds on Quantum Computation with Trapped Ions Richard J. Hughes, Daniel F. V. James, Emanuel H. Knill, Raymond Laamme and Albert G. Petschek, University of California, Los Alamos National
More informationarxiv:quant-ph/ v2 18 Feb 1997
CALT-68-2100, QUIC-97-004 A Theory of Fault-Tolerant Quantum Computation Daniel Gottesman California Institute of Technology, Pasadena, CA 91125 arxiv:quant-ph/9702029 v2 18 Feb 1997 Abstract In order
More informationarxiv:quant-ph/ v1 18 Apr 2000
Proceedings of Symposia in Applied Mathematics arxiv:quant-ph/0004072 v1 18 Apr 2000 An Introduction to Quantum Error Correction Daniel Gottesman Abstract. Quantum states are very delicate, so it is likely
More informationPrimality Test Via Quantum Factorization. Abstract
IASSNS-HEP-95/69; quant-ph:9508005 Primality Test Via Quantum Factorization H. F. Chau and H.-K. Lo School of Natural Sciences, Institute for Advanced Study, Olden Lane, Princeton, NJ 08540 (December 2,
More informationarxiv:quant-ph/ v5 6 Apr 2005
Nonunitary quantum circuit Hiroaki Terashima 1, and Masahito Ueda 1, arxiv:quant-ph/3461v5 6 Apr 5 1 Department of Physics, Tokyo Institute of Technology, Tokyo 15-8551, Japan CREST, Japan Science and
More informationBinary construction of quantum codes of minimum distances five and six
Discrete Mathematics 308 2008) 1603 1611 www.elsevier.com/locate/disc Binary construction of quantum codes of minimum distances five and six Ruihu Li a, ueliang Li b a Department of Applied Mathematics
More informationPerfect quantum-error-correction coding in 24 laser pulses
PHYSICAL REVIEW A VOLUME 55, NUMBER 2 FEBRUARY 1997 Perfect quantum-error-correction coding in 24 laser pulses Samuel L. Braunstein Universität Ulm, Abteilung Quantenphysik, 89069 Ulm, Germany and SEECS,
More informationNON-BINARY UNITARY ERROR BASES AND QUANTUM
LA-UR = Los Alamos NationalLaboratory is operated by the University of California for the United States Department of Energy under contract W-7405-ENG-36 TITLE: AUTHOR(S): SUBMITTED TO: NON-BINARY UNITARY
More informationarxiv:quant-ph/ v1 16 Nov 1995
Quantum Networks for Elementary Arithmetic Operations Vlatko Vedral, Adriano Barenco and Artur Ekert Clarendon Laboratory, Department of Physics University of Oxford, Oxford, OX1 3PU, U.K. (Submitted to
More informationQuantum Error Correction Codes Spring 2005 : EE229B Error Control Coding Milos Drezgic
Quantum Error Correction Codes Spring 2005 : EE229B Error Control Coding Milos Drezgic Abstract This report contains the comprehensive explanation of some most important quantum error correction codes.
More informationarxiv:quant-ph/ v3 19 May 1997
Correcting the effects of spontaneous emission on cold-trapped ions C. D Helon and G.J. Milburn Department of Physics University of Queensland St Lucia 407 Australia arxiv:quant-ph/9610031 v3 19 May 1997
More informationarxiv:quant-ph/ v1 1 Jul 1998
arxiv:quant-ph/9807006v1 1 Jul 1998 The Heisenberg Representation of Quantum Computers Daniel Gottesman T-6 Group Los Alamos National Laboratory Los Alamos, NM 87545 February 1, 2008 Abstract Since Shor
More informationLogical operators of quantum codes
Logical operators of quantum codes Mark M. Wilde* Electronic Systems Division, Science Applications International Corporation, 4001 North Fairfax Drive, Arlington, Virginia 22203, USA Received 30 March
More informationQuantum secret sharing based on quantum error-correcting codes
Quantum secret sharing based on quantum error-correcting codes Zhang Zu-Rong( ), Liu Wei-Tao( ), and Li Cheng-Zu( ) Department of Physics, School of Science, National University of Defense Technology,
More informationOle Christensen 3. October 20, Abstract. We point out some connections between the existing theories for
Frames and pseudo-inverses. Ole Christensen 3 October 20, 1994 Abstract We point out some connections between the existing theories for frames and pseudo-inverses. In particular, using the pseudo-inverse
More informationON QUANTUM CODES FROM CYCLIC CODES OVER A CLASS OF NONCHAIN RINGS
Bull Korean Math Soc 53 (2016), No 6, pp 1617 1628 http://dxdoiorg/104134/bkmsb150544 pissn: 1015-8634 / eissn: 2234-3016 ON QUANTUM CODES FROM CYCLIC CODES OVER A CLASS OF NONCHAIN RINGS Mustafa Sari
More informationApproximate quantum Fourier transform and decoherence
PHYSICAL REVIEW A VOLUME 54 NUMBER 1 JULY 1996 Approximate quantum Fourier transform and decoherence Adriano Barenco and Artur Ekert Clarendon Laboratory Department of Physics University of Oxford Parks
More informationGrover Algorithm Applied to Four Qubits System
www.ccsenet.org/cis Computer and Inormation Science Vol., No. ; May Grover Algorithm Applied to Four Qubits System Z. Sakhi (Corresponding author) Laboratory o Inormation Technology and Modelisation, and
More informationIBM Almaden Research Center. s: January 5, Abstract
Reversible Arithmetic Coding for Quantum Data Compression Isaac L. Chuang and Dharmendra S. Modha IBM Almaden Research Center 650 Harry Road, San Jose, CA 95120-6099 emails: fichuang,dmodhag@almaden.ibm.com
More informationThe Best Circulant Preconditioners for Hermitian Toeplitz Systems II: The Multiple-Zero Case Raymond H. Chan Michael K. Ng y Andy M. Yip z Abstract In
The Best Circulant Preconditioners for Hermitian Toeplitz Systems II: The Multiple-ero Case Raymond H. Chan Michael K. Ng y Andy M. Yip z Abstract In [0, 4], circulant-type preconditioners have been proposed
More information= a. a = Let us now study what is a? c ( a A a )
7636S ADVANCED QUANTUM MECHANICS Solutions 1 Spring 010 1 Warm up a Show that the eigenvalues of a Hermitian operator A are real and that the eigenkets of A corresponding to dierent eigenvalues are orthogonal
More informationPauli Exchange and Quantum Error Correction
Contemporary Mathematics Pauli Exchange and Quantum Error Correction Mary Beth Ruskai Abstract. In many physically realistic models of quantum computation, Pauli exchange interactions cause a special type
More informationQuantum Error Correction Codes-From Qubit to Qudit. Xiaoyi Tang, Paul McGuirk
Quantum Error Correction Codes-From Qubit to Qudit Xiaoyi Tang, Paul McGuirk Outline Introduction to quantum error correction codes (QECC) Qudits and Qudit Gates Generalizing QECC to Qudit computing Need
More informationQuantum Coding. Benjamin Schumacher. Department of Physics. Kenyon College. Gambier, OH
Quantum Coding Benjamin Schumacher Department of Physics Kenyon College Gambier, OH 43022 e-mail: schumacb@kenyon.edu Abstract A theorem is proven for quantum information theory that is analogous to the
More informationQuantum key distribution with 2-bit quantum codes
Quantum key distribution with -bit quantum codes Xiang-Bin Wang Imai Quantum Computation and Information project, ERATO, Japan Sci. and Tech. Corp. Daini Hongo White Bldg. 0, 5-8-3, Hongo, Bunkyo, Tokyo
More informationQuantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139
Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense
More informationarxiv:quant-ph/ v2 5 Mar 1997
Fault-Tolerant Quantum Computation arxiv:quant-ph/9605011v 5 Mar 1997 Abstract It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically.
More informationarxiv: v2 [quant-ph] 12 Aug 2008
Encoding One Logical Qubit Into Six Physical Qubits Bilal Shaw 1,4,5, Mark M. Wilde 1,5, Ognyan Oreshkov 2,5, Isaac Kremsky 2,5, and Daniel A. Lidar 1,2,3,5 1 Department of Electrical Engineering, 2 Department
More informationQuantum Error Correction Codes - From Qubit to Qudit
Quantum Error Correction Codes - From Qubit to Qudit Xiaoyi Tang Paul McGuirk December 7, 005 1 Introduction Quantum computation (QC), with inherent parallelism from the superposition principle of quantum
More informationA Characterization Of Quantum Codes And Constructions
A Characterization Of Quantum Codes And Constructions Chaoping Xing Department of Mathematics, National University of Singapore Singapore 117543, Republic of Singapore (email: matxcp@nus.edu.sg) Abstract
More informationCLASSIFICATION OF MAXIMALLY ENTANGLED STATES OF SPIN 1/2 PARTICLES
CLASSIFICATION OF MAXIMALLY ENTANGLED STATES OF SPIN 1/ PARTICLES S. Ghosh, G. Kar, and A. Roy Physics and Applied Mathematics Unit Indian Statistical Institute 03, B. T. Road Calcutta 700 035 India. E
More information6. Quantum error correcting codes
6. Quantum error correcting codes Error correcting codes (A classical repetition code) Preserving the superposition Parity check Phase errors CSS 7-qubit code (Steane code) Too many error patterns? Syndrome
More informationarxiv: v4 [quant-ph] 8 Mar 2013
Decomposition of unitary matrices and quantum gates Chi-Kwong Li, Rebecca Roberts Department of Mathematics, College of William and Mary, Williamsburg, VA 2387, USA. (E-mail: ckli@math.wm.edu, rlroberts@email.wm.edu)
More informationUnambiguous Discrimination Between Linearly Dependent States With Multiple Copies
Unambiguous Discrimination Between Linearly Dependent States With Multiple Copies Anthony Chefles Department of Physical Sciences, University of Hertfordshire, Hatfield AL10 9AB, Herts, UK arxiv:quant-ph/0105016v3
More informationROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL
arxiv:quant-ph/0109016v2 2 Jul 2002 ROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL B. C. Travaglione, M. A. Nielsen Centre for Quantum Computer Technology, University of Queensland St Lucia, Queensland,
More informationOperator Quantum Error Correcting Codes
Operator Quantum Error Correcting Codes Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. June 18, 2008 Vlad Gheorghiu (CMU) Operator Quantum Error Correcting
More informationSupplementary Material I. BEAMSPLITTER ATTACK The beamsplitter attack has been discussed [C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, J. Smol
Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances Hoi-Kwong Lo 1 and H. F. Chau, 2y 1 Hewlett-Packard Labs, Filton Road, Stoke Giord, Bristol BS34 8QZ, U. K. 2 Department
More informationQuantum Computing with Very Noisy Gates
Quantum Computing with Very Noisy Gates Produced with pdflatex and xfig Fault-tolerance thresholds in theory and practice. Available techniques for fault tolerance. A scheme based on the [[4, 2, 2]] code.
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT
Quantum algorithms (CO 78, Winter 008) Prof. Andrew Childs, University of Waterloo LECTURE : Quantum circuits and the abelian QFT This is a course on quantum algorithms. It is intended for graduate students
More information1 Introduction A one-dimensional burst error of length t is a set of errors that are conned to t consecutive locations [14]. In this paper, we general
Interleaving Schemes for Multidimensional Cluster Errors Mario Blaum IBM Research Division 650 Harry Road San Jose, CA 9510, USA blaum@almaden.ibm.com Jehoshua Bruck California Institute of Technology
More informationarxiv:quant-ph/ v1 27 Oct 1998
Quantum computation over continuous variables arxiv:quant-ph/9810082v1 27 Oct 1998 Seth Lloyd MIT Department of Mechanical Engineering MIT 3-160, Cambridge, Mass. 02139, USA and Samuel L. Braunstein SEECS,
More informationA Systematic Algorithm for Quantum Boolean Circuits Construction
A Systematic Algorithm for Quantum Boolean Circuits Construction I.M. Tsai and S.Y. Kuo arxiv:quant-ph/0104037v2 19 Apr 2001 Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan.
More informationarxiv: v3 [quant-ph] 17 Sep 2017
Quantum Error Correction using Hypergraph States Shashanka Balakuntala and Goutam Paul # Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore 641 004, India,
More informationQuantum Error Detection I: Statement of the Problem
778 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 46, NO 3, MAY 2000 Quantum Error Detection I: Statement of the Problem Alexei E Ashikhmin, Alexander M Barg, Emanuel Knill, and Simon N Litsyn, Member,
More informationSubstituting a qubit for an arbitrarily large amount of classical communication
Substituting a qubit for an arbitrarily large amount of classical communication Ernesto F. Galvão and Lucien Hardy Centre for Quantum Computation, Clarendon Laboratory, University of Oxford, Parks Road,
More informationThe Erwin Schrodinger International Pasteurgasse 6/7. Institute for Mathematical Physics A-1090 Wien, Austria
ESI The Erwin Schrodinger International Pasteurgasse 6/7 Institute for Mathematical Physics A-090 Wien, Austria Why Schrodinger's Cat is Most Likely to be Either Alive or Dead H. Narnhofer W. Thirring
More informationA new universal and fault-tolerant quantum basis
Information Processing Letters 75 000 101 107 A new universal and fault-tolerant quantum basis P. Oscar Boykin a,talmor a,b, Matthew Pulver a, Vwani Roychowdhury a, Farrokh Vatan a, a Electrical Engineering
More informationQUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36
QUANTUM INFORMATION - THE NO-HIDING THEOREM Arun K Pati akpati@iopb.res.in Instititute of Physics, Bhubaneswar-751005, Orissa, INDIA and Th. P. D, BARC, Mumbai-400085, India QUANTUM INFORMATION -THE NO-HIDING
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More informationQuantum search by local adiabatic evolution
PHYSICAL REVIEW A, VOLUME 65, 042308 Quantum search by local adiabatic evolution Jérémie Roland 1 and Nicolas J. Cerf 1,2 1 Ecole Polytechnique, CP 165, Université Libre de Bruxelles, 1050 Brussels, Belgium
More information2 Section 2 However, in order to apply the above idea, we will need to allow non standard intervals ('; ) in the proof. More precisely, ' and may gene
Introduction 1 A dierential intermediate value theorem by Joris van der Hoeven D pt. de Math matiques (B t. 425) Universit Paris-Sud 91405 Orsay Cedex France June 2000 Abstract Let T be the eld of grid-based
More informationTeleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)
Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis
More informationThe average dimension of the hull of cyclic codes
Discrete Applied Mathematics 128 (2003) 275 292 www.elsevier.com/locate/dam The average dimension of the hull of cyclic codes Gintaras Skersys Matematikos ir Informatikos Fakultetas, Vilniaus Universitetas,
More informationarxiv:quant-ph/ v2 3 Oct 2000
Quantum key distribution without alternative measurements Adán Cabello Departamento de Física Aplicada, Universidad de Sevilla, 0 Sevilla, Spain January, 0 arxiv:quant-ph/990v Oct 000 Entanglement swapping
More informationElementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),
Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes
More informationGrover s algorithm. We want to find aa. Search in an unordered database. QC oracle (as usual) Usual trick
Grover s algorithm Search in an unordered database Example: phonebook, need to find a person from a phone number Actually, something else, like hard (e.g., NP-complete) problem 0, xx aa Black box ff xx
More informationHow Often Must We Apply Syndrome Measurements?
How Often Must We Apply Syndrome Measurements? Y. S. Weinstein Quantum Information Science Group, MITRE, 200 Forrestal Rd., Princeton, NJ 08540 ABSTRACT Quantum error correction requires encoding quantum
More informationGeneral Qubit Errors Cannot Be Corrected
arxiv:quant-ph/0206144v4 27 Jun 2002 General Qubit Errors Cannot Be Corrected Subhash Kak June27, 2002 Abstract Error correction in the standard meaning of the term implies the ability to correct all small
More informationphys4.20 Page 1 - the ac Josephson effect relates the voltage V across a Junction to the temporal change of the phase difference
Josephson Effect - the Josephson effect describes tunneling of Cooper pairs through a barrier - a Josephson junction is a contact between two superconductors separated from each other by a thin (< 2 nm)
More informationSimilarities and Differences Between Two-Particle and Three-Particle Interference
Fortschr. Phys. 48 (000) 4, 4 ±5 Similarities and Differences Between Two-Particle and Three-Particle Interference Daniel M. Greenberger, City College of the City University of New York New York, New York
More informationarxiv: v2 [quant-ph] 5 Dec 2013
Decomposition of quantum gates Chi Kwong Li and Diane Christine Pelejo Department of Mathematics, College of William and Mary, Williamsburg, VA 23187, USA E-mail: ckli@math.wm.edu, dcpelejo@gmail.com Abstract
More informationA Tutorial on Quantum Error Correction
Proceedings of the International School of Physics Enrico Fermi, course CLXII, Quantum Computers, Algorithms and Chaos, G. Casati, D. L. Shepelyansky and P. Zoller, eds., pp. 1 32 (IOS Press, Amsterdam
More informationIntroduction into Quantum Computations Alexei Ashikhmin Bell Labs
Introduction into Quantum Computations Alexei Ashikhmin Bell Labs Workshop on Quantum Computing and its Application March 16, 2017 Qubits Unitary transformations Quantum Circuits Quantum Measurements Quantum
More informationQuantum Error-Correcting Codes by Concatenation
Second International Conference on Quantum Error Correction University of Southern California, Los Angeles, USA December 5 9, 2011 Quantum Error-Correcting Codes by Concatenation Markus Grassl joint work
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing The lecture notes were prepared according to Peter Shor s papers Quantum Computing and Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a
More informationTheory Component of the Quantum Computing Roadmap
3.2.4 Quantum simulation Quantum simulation represents, along with Shor s and Grover s algorithms, one of the three main experimental applications of quantum computers. Of the three, quantum simulation
More informationarxiv:quant-ph/ v2 20 Dec 2010
arxiv:quant-ph/41126v2 2 Dec 2 Constructing arbitrary Steane code single logical qubit fault-tolerant gates Austin G. Fowler Centre for Quantum Computer Technology School of Physics, University of Melbourne
More informationQUANTUM COMPUTER ARCHITECTURE FOR FAST ENTROPY EXTRACTION
Quantum Information and Computation, Vol. 1, No. 0 (2001) 000 000 c Rinton Press QUANTUM COMPUTER ARCHITECTURE FOR FAST ENTROPY EXTRACTION ANDREW M. STEANE Centre for Quantum Computation, Oxford University,
More informationAn Analog Analogue of a Digital Quantum Computation
An Analog Analogue of a Digital Quantum Computation arxiv:quant-ph/9612026v1 6 Dec 1996 Edard Farhi Center for Theoretical Physics Massachusetts Institute of Technology Cambridge, MA 02139 Sam Gutmann
More information1 Introduction This work follows a paper by P. Shields [1] concerned with a problem of a relation between the entropy rate of a nite-valued stationary
Prexes and the Entropy Rate for Long-Range Sources Ioannis Kontoyiannis Information Systems Laboratory, Electrical Engineering, Stanford University. Yurii M. Suhov Statistical Laboratory, Pure Math. &
More informationThe Worst Additive Noise Under a Covariance Constraint
3072 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 7, NOVEMBER 2001 Substituting (49), (48), and (50) into (47), and using the fact that self-orthogonal, we obtain right-hand side of (44) is [22]
More informationMore advanced codes 0 1 ( , 1 1 (
p. 1/24 More advanced codes The Shor code was the first general-purpose quantum error-correcting code, but since then many others have been discovered. An important example, discovered independently of
More informationarxiv:quant-ph/ v2 17 Jun 1996
Separability Criterion for Density Matrices arxiv:quant-ph/9604005v2 17 Jun 1996 Asher Peres Department of Physics, Technion Israel Institute of Technology, 32000 Haifa, Israel Abstract A quantum system
More information550 XU Hai-Bo, WANG Guang-Rui, and CHEN Shi-Gang Vol. 37 the denition of the domain. The map is a generalization of the standard map for which (J) = J
Commun. Theor. Phys. (Beijing, China) 37 (2002) pp 549{556 c International Academic Publishers Vol. 37, No. 5, May 15, 2002 Controlling Strong Chaos by an Aperiodic Perturbation in Area Preserving Maps
More informationThe quantum way to diagonalize hermitean matrices
Fortschr. Phys. 51, No. 2 3, 249 254 (2003) / DOI 10.1002/prop.200310035 The quantum way to diagonalize hermitean matrices Stefan Weigert HuMP Hull Mathematical Physics, Department of Mathematics University
More informationThe information content of a quantum
The information content of a quantum A few words about quantum computing Bell-state measurement Quantum dense coding Teleportation (polarisation states) Quantum error correction Teleportation (continuous
More informationA Class of Quantum LDPC Codes Constructed From Finite Geometries
A Class of Quantum LDPC Codes Constructed From Finite Geometries Salah A Aly Department of Computer Science, Texas A&M University College Station, TX 77843, USA Email: salah@cstamuedu arxiv:07124115v3
More informationSTABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin
On the stability of invariant subspaces of commuting matrices Tomaz Kosir and Bor Plestenjak September 18, 001 Abstract We study the stability of (joint) invariant subspaces of a nite set of commuting
More informationPARAMETER IDENTIFICATION IN THE FREQUENCY DOMAIN. H.T. Banks and Yun Wang. Center for Research in Scientic Computation
PARAMETER IDENTIFICATION IN THE FREQUENCY DOMAIN H.T. Banks and Yun Wang Center for Research in Scientic Computation North Carolina State University Raleigh, NC 7695-805 Revised: March 1993 Abstract In
More informationResearch Article Fast Constructions of Quantum Codes Based on Residues Pauli Block Matrices
Advances in Mathematical Physics Volume 2010, Article ID 469124, 12 pages doi:10.1155/2010/469124 Research Article Fast Constructions of Quantum Codes Based on Residues Pauli Block Matrices Ying Guo, Guihu
More informationIntroduction to Quantum Error Correction
Introduction to Quantum Error Correction Emanuel Knill, Raymond Laflamme, Alexei Ashikhmin, Howard N. Barnum, Lorenza Viola, and Wojciech H. Zurek 188 Los Alamos Science Number 27 2002 W hen physically
More informationExtended Superposed Quantum State Initialization Using Disjoint Prime Implicants
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants David Rosenbaum, Marek Perkowski Portland State University, Department of Computer Science Portland State University, Department
More informationThe P versus NP Problem in Quantum Physics
NeuroQuantology December 04 Volume Issue 4 Page 350-354 350 The P versus NP Problem in Quantum Physics Daegene Song ABSTRACT Motivated by the fact that information is encoded and processed by physical
More informationConstruction and Performance of Quantum Burst Error Correction Codes for Correlated Errors
1 Construction and Performance of Quantum Burst Error Correction Codes for Correlated Errors Jihao Fan, Min-Hsiu Hsieh, Hanwu Chen, He Chen, and Yonghui Li Nanjing Institute of Technology, Nanjing, Jiangsu,
More informationLog-mod-finding: A New Idea for Implementation of Shor's Algorithm
2012 International Conference on Networks and Information (ICNI 2012) IPCSIT vol. 57 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V57.11 Log-mod-finding: A New Idea for Implementation
More informationarxiv:quant-ph/ v2 23 Aug 2003
An Architecture of Deterministic Quantum Central Processing Unit arxiv:quant-ph/0207032v2 23 Aug 2003 Fei Xue a, Zeng-Bing Chen a Mingjun Shi a Xianyi Zhou a Jiangfeng Du a Rongdian Han a a Department
More informationRON M. ROTH * GADIEL SEROUSSI **
ENCODING AND DECODING OF BCH CODES USING LIGHT AND SHORT CODEWORDS RON M. ROTH * AND GADIEL SEROUSSI ** ABSTRACT It is shown that every q-ary primitive BCH code of designed distance δ and sufficiently
More informationConstruction X for quantum error-correcting codes
Simon Fraser University Burnaby, BC, Canada joint work with Vijaykumar Singh International Workshop on Coding and Cryptography WCC 2013 Bergen, Norway 15 April 2013 Overview Construction X is known from
More informationarxiv:quant-ph/ v2 28 Aug 2006
Numerical simulation of Quantum Teleportation in a chain of three nuclear spins system taking into account second neighbor iteration G.V. López and L. Lara Departamento de Física, Universidad de Guadalajara
More informationOn-line Bin-Stretching. Yossi Azar y Oded Regev z. Abstract. We are given a sequence of items that can be packed into m unit size bins.
On-line Bin-Stretching Yossi Azar y Oded Regev z Abstract We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try
More informationNon-Zero Syndromes and Syndrome Measurement Order for the [[7,1,3]] Quantum Error Correction Code
Non-Zero Syndromes and Syndrome Measurement Order for the [[,,]] Quantum Error Correction Code Yaakov S. Weinstein Quantum Information Science Group, Mitre, Forrestal Rd. Princeton, NJ, USA The[[,,]] quantum
More information