Fast simulation of stabilizer circuits using a graph state representation
| dc.creator | Anders, Simon | |
| dc.creator | Briegel, Hans J. | |
| dc.date | 2005-04-15 | |
| dc.date | 2006-01-03 | |
| dc.date.accessioned | 2026-07-07T06:40:55Z | |
| dc.date.available | 2026-07-07T06:40:55Z | |
| dc.description | 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. | |
| dc.description | v2: significantly improved presentation; accepted by PRA | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0504117 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0504117 | |
| dc.identifier | Phys. Rev. A 73, 022334 (2006) | |
| dc.identifier | doi:10.1103/PhysRevA.73.022334 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/101532 | |
| dc.subject | Quantum Physics | |
| dc.title | Fast simulation of stabilizer circuits using a graph state representation | |
| dc.type | text |