Fast simulation of stabilizer circuits using a graph state representation

Details Fast simulation of stabilizer circuits using a graph state representation Fast simulation of stabilizer circuits using a graph state representation

2005-04-15

arxiv.org/abs/quant-ph/0504117v2

Phys. Rev. A 73, 022334 (2006)

Physics

Quantum Physics

v2: significantly improved presentation; accepted by PRA

Scientific paper

10.1103/PhysRevA.73.022334

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.

Affiliated with

Also associated with

No associations

Rating

Fast simulation of stabilizer circuits using a graph state representation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast simulation of stabilizer circuits using a graph state representation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast simulation of stabilizer circuits using a graph state representation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-401665