Tractable Simulation of Error Correction with Honest Approximations to Realistic Fault Models
arXiv:1309.4717 · doi:10.1103/PhysRevA.89.022306
Abstract
In previous work, we proposed a method for leveraging efficient classical simulation algorithms to aid in the analysis of large-scale fault tolerant circuits implemented on hypothetical quantum information processors. Here, we extend those results by numerically studying the efficacy of this proposal as a tool for understanding the performance of an error-correction gadget implemented with fault models derived from physical simulations. Our approach is to approximate the arbitrary error maps that arise from realistic physical models with errors that are amenable to a particular classical simulation algorithm in an "honest" way; that is, such that we do not underestimate the faults introduced by our physical models. In all cases, our approximations provide an "honest representation" of the performance of the circuit composed of the original errors. This numerical evidence supports the use of our method as a way to understand the feasibility of an implementation of quantum information processing given a characterization of the underlying physical processes in experimentally accessible examples.
arXiv comment34 pages, 9 tables, 4 figures
References in corpus (29)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- QuTiP 2: A Python framework for the dynamics of open quantum systems
- Improved Simulation of Stabilizer Circuits
- Quantum Computing with Very Noisy Devices
- Prescription for experimental determination of the dynamics of a quantum black box
- A simple formula for the average gate fidelity of a quantum dynamical operation
- Quantum Data Fitting
- High threshold universal quantum computation on the surface code
- Characterizing Quantum Gates via Randomized Benchmarking
- Negative Quasi-Probability as a Resource for Quantum Computation
- Symmetrised Characterisation of Noisy Quantum Processes
- Hamiltonian Learning and Certification Using Quantum Resources
- Robust Online Hamiltonian Learning
- Layered architecture for quantum computing
- Quantum Process Tomography of the Quantum Fourier Transform
- Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
- Application of Optimal Control to CPMG Refocusing Pulse Design
- Experimentally scalable protocol for identification of correctable codes
- Modeling quantum noise for efficient testing of fault-tolerant circuits
- Approximation of real error channels by Clifford channels and Pauli measurements
- Simulation of rare events in quantum error correction
- Principles of Control for Decoherence-Free Subsystems
- Semidefinite programs for completely bounded norms
- Error-detection-based quantum fault tolerance against discrete Pauli noise
- Cryptographic Distinguishability Measures for Quantum Mechanical States
- Progress toward scalable tomography of quantum maps using twirling-based methods and information hierarchies
- Minimum error discrimination of Pauli channels
- Comparison of ancilla preparation and measurement procedures for the Steane [[7,1,3]] code on a model ion trap quantum computer
- Accuracy threshold for postselected quantum computation
Cited by in corpus (30)
- Noise tailoring for scalable quantum computation via randomized compiling
- Low-distance Surface Codes under Realistic Quantum Noise
- Correcting coherent errors with surface codes
- Bounding quantum gate error rate based on reported average fidelity
- Characterizing Universal Gate Sets via Dihedral Benchmarking
- Quantum Hamiltonian Learning Using Imperfect Quantum Resources
- Performance of quantum error correction with coherent errors
- Simulating the performance of a distance-3 surface code in a linear ion trap
- Errors and pseudo-thresholds for incoherent and coherent noise
- Gate-error analysis in simulations of quantum computers with transmon qubits
- Unbiased Simulation of Near-Clifford Quantum Circuits
- Accelerated Randomized Benchmarking
- Quantum Computing: An Overview Across the System Stack
- Comparison of a quantum error correction threshold for exact and approximate errors
- Quantum error correction failure distributions: comparison of coherent and stochastic error models
- Testing quantum fault tolerance on small systems
- Tailored codes for small quantum memories
- Efficient simulation of quantum error correction under coherent error based on non-unitary free-fermionic formalism
- Benchmarking quantum logic operations relative to thresholds for fault tolerance
- Realistic simulation of quantum computation using unitary and measurement channels
- Non-Pauli errors can be efficiently sampled in qudit surface codes
- Numerical Engineering of Robust Adiabatic Operations
- Modeling error correction with Lindblad dynamics and approximate channels
- In-situ Adaptive Encoding for Asymmetric Quantum Error Correcting Codes
- Methods for Classically Simulating Noisy Networked Quantum Architectures
- Improved performance of the Bacon-Shor code with Steane's syndrome extraction method
- Accurate and Honest Approximation of Correlated Qubit Noise
- Robustly decorrelating errors with mixed quantum gates
- Exact and Efficient Stabilizer Simulation of Thermal-Relaxation Noise for Quantum Error Correction
- Comparison of spin-qubit architectures for quantum error-correcting codes