Quantum Error Correction Decoheres Noise.

Typical studies of quantum error correction assume probabilistic Pauli noise, largely because it is relatively easy to analyze and simulate. Consequently, the effective logical noise due to physically realistic coherent errors is relatively unknown. Here, we prove that encoding a system in a stabilizer code and measuring error syndromes decoheres errors, that is, causes coherent errors to converge toward probabilistic Pauli errors, even when no recovery operations are applied. Two practical consequences are that the error rate in a logical circuit is well quantified by the average gate fidelity at the logical level and that essentially optimal recovery operators can be determined by independently optimizing the logical fidelity of the effective noise per syndrome.

[1]  Shelby Kimmel,et al.  Robust Extraction of Tomographic Information via Randomized Benchmarking , 2013, 1306.2348.

[2]  Joseph Emerson,et al.  Scalable and robust randomized benchmarking of quantum processes. , 2010, Physical review letters.

[3]  David Poulin Optimal and efficient decoding of concatenated quantum block codes , 2006 .

[4]  Kenneth R. Brown,et al.  Comparison of a quantum error correction threshold for exact and approximate errors , 2014, 1501.00068.

[5]  Steven T. Flammia,et al.  Estimating the coherence of noise , 2015, 1503.07865.

[6]  Steven T. Flammia,et al.  Randomized benchmarking with confidence , 2014, 1404.6025.

[7]  Joel J. Wallman,et al.  Noise tailoring for scalable quantum computation via randomized compiling , 2015, 1512.01098.

[8]  Raymond Laflamme,et al.  Symmetrized Characterization of Noisy Quantum Processes , 2007, Science.

[9]  S. Szarek,et al.  An analysis of completely positive trace-preserving maps on M2 , 2002 .

[10]  S. Shankar Sastry,et al.  Generalized Performance of Concatenated Quantum Codes—A Dynamical Systems Approach , 2006, IEEE Transactions on Automatic Control.

[11]  Kenneth R. Brown,et al.  Errors and pseudothresholds for incoherent and coherent noise , 2016, 1605.03604.

[12]  J. Emerson,et al.  Scalable noise estimation with random unitary operators , 2005, quant-ph/0503243.

[13]  Christoph Dankert,et al.  Exact and approximate unitary 2-designs and their application to fidelity estimation , 2009 .

[14]  Richard Kueng,et al.  Comparing Experiments to the Fault-Tolerance Threshold. , 2015, Physical review letters.

[15]  A. Kitaev Quantum computations: algorithms and error correction , 1997 .

[16]  E. Knill,et al.  Randomized Benchmarking of Quantum Gates , 2007, 0707.0963.

[17]  Hideo Mabuchi,et al.  Exact performance of concatenated quantum codes , 2002 .

[18]  Zachary Dutton,et al.  Modeling coherent errors in quantum error correction , 2016, 1612.03908.

[19]  Scott Aaronson,et al.  Improved Simulation of Stabilizer Circuits , 2004, ArXiv.

[20]  Salman Beigi,et al.  Simplified instantaneous non-local quantum computation with applications to position-based cryptography , 2011, 1101.1065.

[21]  David Poulin,et al.  Tensor-Network Simulations of the Surface Code under Realistic Noise. , 2016, Physical review letters.

[22]  Raymond Laflamme,et al.  Hard decoding algorithm for optimizing thresholds under general Markovian noise , 2016, 1612.02830.

[23]  Joel J. Wallman,et al.  Bounding quantum gate error rate based on reported average fidelity , 2015, 1501.04932.