Simulating Quantum Circuits by Shuffling Paulis
arXiv:1804.05404
Abstract
Verification of NISQ era quantum devices demands fast classical simulation of large noisy quantum circuits. We present an algorithm based on the stabilizer formalism that can efficiently simulate noisy stabilizer circuits. Additionally, the protocol can efficiently simulate a large set of multi-qubit mixed states that are not mixtures of stabilizer states. The existence of these 'bound states' was previously only known for odd-dimensional systems like qutrits. The algorithm also has the favorable property that circuits with depolarizing noise are simulated much faster than unitary circuits. This work builds upon a similar algorithm by Bennink et al. (Phys. Rev. A 95, 062337) and utilizes a framework by Pashayan et al. (Phys. Rev. Lett. 115, 070501).
arXiv comment6 pages, 2 figures
References in corpus (8)
- Quantum Computing in the NISQ era and beyond
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Randomized Benchmarking of Quantum Gates
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Introduction to Quantum Gate Set Tomography
- Quasiprobability representations of quantum mechanics with minimal negativity
- Permutation Symmetry Determines the Discrete Wigner Function
- Qutrit Magic State Distillation Tight in Some Directions