Simulation of qubit quantum circuits via Pauli propagation

Patrick Rall, Daniel Liang, Jeremy Cook, and William Kretschmer
Phys. Rev. A 99, 062337 – Published 27 June 2019

Abstract

We present 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.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 19 March 2019

DOI:https://doi.org/10.1103/PhysRevA.99.062337

©2019 American Physical Society

Physics Subject Headings (PhySH)

Quantum Information, Science & Technology

Authors & Affiliations

Patrick Rall, Daniel Liang, Jeremy Cook, and William Kretschmer

  • Quantum Information Center, University of Texas at Austin, Austin, Texas 78712, USA

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 99, Iss. 6 — June 2019

Reuse & Permissions
Access Options
CHORUS

Article Available via CHORUS

Download Accepted Manuscript
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×