Fast simulation of stabilizer circuits using a graph-state representation
- 21 February 2006
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 73 (2) , 022334
- https://doi.org/10.1103/physreva.73.022334
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 an 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.All Related Versions
This publication has 14 references indexed in Scilit:
- Improved simulation of stabilizer circuitsPhysical Review A, 2004
- Multiparticle Entanglement Purification for Graph StatesPhysical Review Letters, 2003
- Persistent Entanglement in Arrays of Interacting ParticlesPhysical Review Letters, 2001
- Multiparticle entanglement purification protocolsPhysical Review A, 1998
- Multiple-particle interference and quantum error correctionProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1996
- Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy ChannelsPhysical Review Letters, 1996
- Good quantum error-correcting codes existPhysical Review A, 1996
- Error Correcting Codes in Quantum TheoryPhysical Review Letters, 1996
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy ChannelsPhysical Review Letters, 1996
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995