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

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed