Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Buchbinder, Channing Huang, Y. Weinstein (2011)
Encoding an arbitrary state in a [7,1,3] quantum error correction codeQuantum Information Processing, 12
D. Gottesman (1997)
Theory of fault-tolerant quantum computationPhysical Review A, 57
P. Shor (1995)
Scheme for reducing decoherence in quantum computer memory.Physical review. A, Atomic, molecular, and optical physics, 52 4
Y. Weinstein (2013)
Quantum error correction during 50 gatesPhysical Review A, 89
Y. Weinstein (2013)
Quantum-error-correction implementation after multiple gatesPhysical Review A, 88
Y. Weinstein (2013)
Non-fault-tolerantTgates for the [7,1,3] quantum error-correction codePhysical Review A, 87
Charles Bennett, D. DiVincenzo (2000)
Quantum information and computationNature, 404
M. Whitney, Nemanja Isailovic, Yatish Patel, J. Kubiatowicz (2009)
A fault tolerant, area efficient architecture for Shor's factoring algorithm
Vadym Kliuchnikov, D. Maslov, M. Mosca (2012)
Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubitsPhysical review letters, 110 19
P. Aliferis, D. Gottesman, J. Preskill (2005)
Quantum accuracy threshold for concatenated distance-3 codesQuantum Inf. Comput., 6
P. Selinger (2012)
Efficient Clifford+T approximation of single-qubit operatorsQuantum Inf. Comput., 15
Y. Weinstein, S. Buchbinder (2011)
Use of Shor states for the [7,1,3] quantum error-correcting codePhysical Review A, 86
A. Calderbank, P. Shor (1995)
Good quantum error-correcting codes exist.Physical review. A, Atomic, molecular, and optical physics, 54 2
P. Shor (1995)
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Rev., 41
Y. Weinstein (2011)
Fidelity of an encoded [7,1,3] logical zeroPhysical Review A, 84
P Selinger (2015)
Efficient Clifford $$+$$ + T approximation of single-qubit operatorsQuantum Inf. Comp., 15
Vadym Kliuchnikov, D. Maslov, M. Mosca (2012)
Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T CircuitsIEEE Transactions on Computers, 65
J. Preskill (1997)
Reliable quantum computersProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 454
A. Steane (1996)
Error Correcting Codes in Quantum Theory.Physical review letters, 77 5
S. Bravyi, A. Kitaev (2004)
Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)Physical Review A, 71
A. Steane (1996)
Multiple-particle interference and quantum error correctionProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 452
We analyze the improvement in output state fidelity upon improving the construction accuracy of ancilla states. Specifically, we simulate gates and syndrome measurements on a single qubit of information encoded into the [[7,1,3]] quantum error correction code and determine the output state fidelity as a function of the accuracy with which Shor states (for syndrome measurements) and magic states (to implement T-gates) are constructed. When no syndrome measurements are applied during the gate sequence, we observe that the fidelity increases after performance of a T-gate and improving magic states construction slows the fidelity decay rate. In contrast, when syndrome measurements are applied, loss of fidelity occurs primarily after the syndrome measurements taken after a T-gate. Improving magic state construction slows the fidelity decay rate, and improving Shor state construction raises the initial fidelity but does not slow the fidelity decay rate. Along the way, we show that applying syndrome measurements after every gate does not maximize the output state fidelity. Rather, syndrome measurements should be applied sparingly.
Quantum Information Processing – Springer Journals
Published: Jan 9, 2016
Access the full text.
Sign up today, get DeepDyve free for 14 days.