Corpus ID: 16312130

Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond

@article{Nest2010ClassicalSO,
  title={Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond},
  author={M. V. D. Nest},
  journal={Quantum Inf. Comput.},
  year={2010},
  volume={10},
  pages={258-271}
}
  • M. V. D. Nest
  • Published 2010
  • Physics, Mathematics, Computer Science
  • Quantum Inf. Comput.
  • We study classical simulation of quantum computation, taking the Gottesman-Knill theorem as a starting point. We show how each Clifford circuit can be reduced to an equivalent, manifestly simulatable circuit (normal form). This provides a simple proof of the Gottesman-Knill theorem without resorting to stabilizer techniques. The normal form highlights why Clifford circuits have such limited computational power in spite of their high entangling power. At the same time, the normal form shows how… CONTINUE READING
    71 Citations
    Classical simulation complexity of extended Clifford circuits
    • 54
    • PDF
    Exploring Quantum Computation Through the Lens of Classical Simulation
    • Highly Influenced
    • PDF
    Simulating quantum computers with probabilistic methods
    • 72
    • PDF
    Quantum Commuting Circuits and Complexity of Ising Partition Functions
    • 27
    • Highly Influenced
    • PDF
    Simulating Quantum Circuits with Sparse Output Distributions
    • 24
    • PDF
    From estimation of quantum probabilities to simulation of quantum circuits
    • 16
    • PDF
    Simulation of quantum circuits by low-rank stabilizer decompositions
    • 65
    • PDF
    Computing quopit Clifford circuit amplitudes by the sum-over-paths technique
    • 11
    • PDF
    Hybrid Techniques for Simulating Quantum Circuits using the Heisenberg Representation.
    • 2
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 64 REFERENCES
    Quantum Circuits That Can Be Simulated Classically in Polynomial Time
    • L. Valiant
    • Computer Science, Mathematics
    • SIAM J. Comput.
    • 2002
    • 227
    Improved Simulation of Stabilizer Circuits
    • 522
    • Highly Influential
    • PDF
    Matchgates and classical simulation of quantum circuits
    • R. Jozsa, A. Miyake
    • Mathematics, Physics
    • Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
    • 2008
    • 124
    • PDF
    Classical simulation of noninteracting-fermion quantum circuits
    • 169
    • PDF
    Both Toffoli and controlled-NOT need little help to do universal quantum computing
    • Y. Shi
    • Mathematics, Physics
    • Quantum Inf. Comput.
    • 2003
    • 251
    • PDF
    Simulating Quantum Computation by Contracting Tensor Networks
    • 201
    • PDF
    On the Role of Hadamard Gates in Quantum Circuits
    • D. Shepherd
    • Computer Science, Physics
    • Quantum Inf. Process.
    • 2006
    • 11
    • PDF
    On the simulation of quantum circuits
    • 52
    • PDF
    The Heisenberg Representation of Quantum Computers
    • 544
    • PDF