Published in

American Physical Society, Physical Review A, 2(73), 2006

DOI: 10.1103/physreva.73.022334

Links

Tools

Export citation

Search in Google Scholar

Fast simulation of stabilizer circuits using a graph state representation

Journal article published in 2005 by Simon Anders ORCID, Hans J. Briegel
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Green circle
Published version: archiving allowed
Data provided by SHERPA/RoMEO

Abstract

According to the Gottesman-Knill theorem, a class of quantum circuits, namely the so-called stabilizer circuits, can be simulated efficiently on a classical computer. We introduce a new algorithm for this task, which is based on the graph-state formalism. It shows significant improvement in comparison to an existing algorithm, given by Gottesman and Aaronson, in terms of speed and of the number of qubits the simulator can handle. We also present an implementation.