Implementation of Clifford gates in the Ising-anyon topological quantum computer

Details Implementation of Clifford gates in the Ising-anyon topological quantum computer Implementation of Clifford gates in the Ising-anyon topological quantum computer

2008-12-12

arxiv.org/abs/0812.2338v1

Phys. Rev. A 79, 032311 (2009)

Physics

Quantum Physics

17 pages, 10 figures, RevTeX

Scientific paper

10.1103/PhysRevA.79.032311

We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for n \geq 3 qubits we prove that the the image of the braid group is a non-trivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We also point out which Clifford gates cannot in general be realized by braiding.

Affiliated with

Also associated with

No associations

Rating

Implementation of Clifford gates in the Ising-anyon topological quantum computer 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 Implementation of Clifford gates in the Ising-anyon topological quantum computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Implementation of Clifford gates in the Ising-anyon topological quantum computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-610100