Syndrome measurement strategies for the [[7,1,3]] code
- 84 Downloads
Quantum error correction (QEC) entails the encoding of quantum information into a QEC code space, measuring error syndromes to properly locate and identify errors, and, if necessary, applying a proper recovery operation. Here we compare three syndrome measurement protocols for the [[7,1,3]] QEC code: Shor states, Steane states, and one ancilla qubit by simulating the implementation of 50 logical gates with the syndrome measurements interspersed between the gates at different intervals. We then compare the fidelities for the different syndrome measurement types. Our simulations show that the optimal syndrome measurement strategy is generally not to apply syndrome measurements after every gate but depends on the details of the error environment. Our simulations also allow a quantum computer programmer to weigh computational accuracy versus resource consumption (time and number of qubits) for a particular error environment. In addition, we show that applying syndrome measurements that are unnecessary from the standpoint of quantum fault tolerance may be helpful in achieving better accuracy or in lowering resource consumption. Finally, our simulations demonstrate that the single-qubit non-fault-tolerant syndrome measurement strategy achieves comparable fidelity to those that are fault tolerant.
KeywordsQuantum error correction Quantum fault tolerance Syndrome measurements
I would like to thank G. Gilbert for insightful comments. This research is supported under MITRE Innovation Program Grant 51MSR662.
- 7.Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. Proceedings of the 35th Annual Symposium on Fundamentals of Computer Science, IEEE Press, Los Alamitos (1996)Google Scholar
- 9.Aleferis, P., Gottesman, D., Preskill, J.: Quantum accuracy threshold for concatenated distance-3 code. Quant. Inf. Comput. 6, 97–165 (2006)Google Scholar
- 12.Whitney, M.G., Isailovic, N., Patel, Y., Kubiatowicz, J.: A fault tolerant, area efficient architecture for Shor’s factoring algorithm. Proceedings of the 36th Annual International Symposium on Computer Architecture, (ACM, New York, 2009)Google Scholar
- 19.Kitaev, A.Y.: Russ. Math. Surv. 52, 1191 (1997); Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation Graduate Studies in Mathematics 47, American Mathematical Society 2002Google Scholar
- 26.Selinger, P.: Efficient Clifford+T approximation of single-qubit operators. arXiv:1212.6253
- 27.Kliuchnikov, V., Maslov, D., Mosca, M.: Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits. arXiv:1212.6964