Improved Simulation of Stabilizer Circuits

@article{Aaronson2004ImprovedSO,
  title={Improved Simulation of Stabilizer Circuits},
  author={S. Aaronson and D. Gottesman},
  journal={ArXiv},
  year={2004},
  volume={quant-ph/0406196}
}
  • S. Aaronson, D. Gottesman
  • Published 2004
  • Physics, Computer Science
  • ArXiv
  • The Gottesman-Knill theorem says that a stabilizer circuit\char22{}that is, a quantum circuit consisting solely of controlled-NOT (CNOT), Hadamard, and phase gates\char22{}can be simulated efficiently on a classical computer. This paper improves that theorem in several directions. First, by removing the need for Gaussian elimination, we make the simulation algorithm much faster at the cost of a factor of 2 increase in the number of bits needed to represent a state. We have implemented the… CONTINUE READING
    524 Citations
    On The Complexity of Quantum Circuit Manipulation
    • PDF
    Simulation of quantum circuits by low-rank stabilizer decompositions
    • 65
    • Highly Influenced
    • PDF
    Efficient Inner-product Algorithm for Stabilizer States
    • 15
    • PDF
    Simulation of Quantum Circuits via Stabilizer Frames
    • 15
    • Highly Influenced
    • PDF
    Quantum Advantage from Conjugated Clifford Circuits
    • 4
    • PDF
    The Classification of Stabilizer Operations over Qubits
    • 9
    • PDF
    Quipu: High-performance simulation of quantum circuits using stabilizer frames
    • 8
    • PDF
    OPTIMALITY IN STABILIZER TESTING
    • 2018
    • PDF
    Efficient classical simulation of Clifford circuits with nonstabilizer input states
    • 3
    • PDF

    References

    SHOWING 1-10 OF 126 REFERENCES
    Improving Gate-Level Simulation of Quantum Circuits
    • 83
    • PDF
    Both Toffoli and controlled-NOT need little help to do universal quantum computing
    • Y. Shi
    • Mathematics, Physics
    • Quantum Inf. Comput.
    • 2003
    • 251
    • PDF
    Quantum Circuits That Can Be Simulated Classically in Polynomial Time
    • L. Valiant
    • Computer Science, Mathematics
    • SIAM J. Comput.
    • 2002
    • 227
    Efficient Synthesis of Linear Reversible Circuits
    • 27
    • PDF
    Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
    • 1,120
    • PDF
    Synthesis of reversible logic circuits
    • 467
    • PDF
    Classical simulation of noninteracting-fermion quantum circuits
    • 169
    • PDF
    Transformation rules for designing CNOT-based quantum circuits
    • 179
    • Highly Influential
    • PDF
    Fault-tolerant quantum computation with constant error
    • 532
    • PDF
    Limitations of quantum advice and one-way communication
    • 13