pith. sign in

arxiv: 1804.05404 · v1 · pith:CESVRHR2new · submitted 2018-04-15 · 🪐 quant-ph

Simulating Quantum Circuits by Shuffling Paulis

classification 🪐 quant-ph
keywords circuitsalgorithmquantumstabilizerstatesefficientlylargenoisy
0
0 comments X
read the original 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).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.