2015/12/31 by Smitha Janardan, Yu Tomita, Mauricio Gutiérrez +2 · 10 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Computer science #Error detection and correction #Formalism (music) #Mathematics #Monte Carlo method #Pauli exclusion principle #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum computer #Quantum error correction #Quantum mechanics #Quantum-Dot Cellular Automata #Qubit #Range (aeronautics) #Statistics #quant-ph
paper · pdf · doi:10.1007/s11128-016-1330-z
published in Quantum Information Processing 15(8), 3065-3079 (Springer Science+Business Media) · References added. Modification of introduction to remove an erroneous "intractable"
openalex publication_date 2016/05/18 · openalex created_date 2016/06/24 · arxiv created 2017/01/25 · arxiv updated 2017/01/26 · openalex updated_date 2026/08/05
We estimate the success probability of quantum protocols composed of Clifford operations in the presence of Pauli errors. Our method is derived from the fault-point formalism previously used to determine the success rate of low-distance error correction codes. Here we apply it to a wider range of quantum protocols and identify circuit structures that allow for efficient calculation of the exact success probability and even the final distribution of output states. As examples, we apply our method to the Bernstein-Vazirani algorithm and the Steane [[7,1,3]] quantum error correction code and compare the results to Monte Carlo simulations.