Comparative Study of Sampling-Based Simulation Costs of Noisy Quantum Circuits

Abstract

Noise in quantum operations often negates the advantage of quantum computation. However, most classical simulations of quantum computers calculate the ideal probability amplitudes either storing full state vectors or using sophisticated tensor network contractions. Here, we investigate sampling-based classical simulation methods for noisy quantum circuits. Specifically, we characterize the simulation costs of two major schemes, stabilizer-state sampling of magic states and Heisenberg propagation, for quantum circuits being subject to stochastic Pauli noise, such as depolarizing and dephasing noise. To this end, we introduce several techniques for the stabilizer-state sampling to reduce the simulation costs under such noise. It revealed that in the low noise regime, stabilizer-state sampling results in a smaller sampling cost, while Heisenberg propagation is better in the high noise regime. Furthermore, for a high depolarizing noise rate $\sim 10\%$, these methods provide better scaling compared to that given by the low-rank stabilizer decomposition. We believe that these knowledge of classical simulation costs is useful to squeeze possible quantum advantage on near-term noisy quantum devices as well as efficient classical simulation methods.

arXiv comment14 pages, 12 figures. v3: minor corrections, published version

References in corpus (21)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Improved Simulation of Stabilizer Circuits
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Extending the computational reach of a noisy superconducting quantum processor
• Hartree-Fock on a superconducting qubit quantum computer
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Methodology for quantum logic gate constructions
• Hudson's Theorem for finite-dimensional quantum systems
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Trading classical and quantum computational resources
• Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
• Quantifying quantum speedups: improved classical simulation from tighter magic monotones
• Quantifying magic for multi-qubit operations
• Robustness of Magic and Symmetries of the Stabiliser Polytope
• Classical Simulation of Quantum Supremacy Circuits
• Catalysis and activation of magic states in fault tolerant architectures
• Simulation of Qubit Quantum Circuits via Pauli Propagation
• Demonstration of quantum volume 64 on a superconducting quantum computing system
• Quadratic Clifford expansion for efficient benchmarking and initialization of variational quantum algorithms

Cited by in corpus (4)

• Error mitigation and quantum-assisted simulation in the error corrected regime
• Quantifying fermionic nonlinearity of quantum circuits
• Counting stabiliser codes for arbitrary dimension
• Sampling-based quasiprobability simulation for fault-tolerant quantum error correction on the surface codes under coherent noise