Simulation of Qubit Quantum Circuits via Pauli Propagation

Abstract

We present novel algorithms to estimate outcomes for qubit quantum circuits. Notably, these methods can simulate a Clifford circuit in linear time without ever writing down stabilizer states explicitly. These algorithms outperform previous noisy near-Clifford techniques for most circuits. We identify a large class of input states that can be efficiently simulated despite not being stabilizer states. The algorithms leverage probability distributions constructed from Bloch vectors, paralleling previously known algorithms that use the discrete Wigner function for qutrits.

11 pages, 5 figures. This work is intended to supersede quant-ph/1804.05404

References in corpus (4)

• Application of a resource theory for magic states to fault-tolerant quantum computing
• Wigner function negativity and contextuality in quantum computation on rebits
• A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
• Frame representations of quantum mechanics and the necessity of negativity in quasi-probability representations