On the Error-Detection Properties of the Error-Detecting Code

Author(s):  
Natasha Ilievska
2008 ◽  
Vol 8 (3&4) ◽  
pp. 181-244 ◽  
Author(s):  
P. Aliferis ◽  
D. Gottesman ◽  
J. Preskill

We prove an accuracy threshold theorem for fault-tolerant quantum computation based on error detection and postselection. Our proof provides a rigorous foundation for the scheme suggested by Knill, in which preparation circuits for ancilla states are protected by a concatenated error-detecting code and the preparation is aborted if an error is detected. The proof applies to independent stochastic noise but (in contrast to proofs of the quantum accuracy threshold theorem based on concatenated error-correcting codes) not to strongly-correlated adversarial noise. Our rigorously established lower bound on the accuracy threshold, $1.04\times 10^{-3}$, is well below Knill's numerical estimates.


2013 ◽  
Vol 13 (3&4) ◽  
pp. 195-209
Author(s):  
Adam M. Meier ◽  
Bryan Eastin ◽  
Emanuel Knill

The distillation of magic states is an often-cited technique for enabling universal quantum computing once the error probability for a special subset of gates has been made negligible by other means. We present a routine for magic-state distillation that reduces the required overhead for a range of parameters of practical interest. Each iteration of the routine uses a four-qubit error-detecting code to distill the $+1$ eigenstate of the Hadamard gate at a cost of ten input states per two improved output states. Use of this routine in combination with the $15$-to-$1$ distillation routine described by Bravyi and Kitaev allows for further improvements in overhead.


Author(s):  
Amrindra Pal ◽  
Santosh Kumar ◽  
Sandeep Sharma ◽  
Vivek K. Srivastava

Sign in / Sign up

Export Citation Format

Share Document