Simulation of Qubit Quantum Circuits via Pauli Propagation
Quantum Physics
2019-07-03 v2
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.
Keywords
Cite
@article{arxiv.1901.09070,
title = {Simulation of Qubit Quantum Circuits via Pauli Propagation},
author = {Patrick Rall and Daniel Liang and Jeremy Cook and William Kretschmer},
journal= {arXiv preprint arXiv:1901.09070},
year = {2019}
}
Comments
11 pages, 5 figures. This work is intended to supersede quant-ph/1804.05404