Rémy Mosseri 2008 J. Phys. A: Math. Theor. 41 175302 doi:10.1088/1751-8113/41/17/175302
Rémy Mosseri
Show affiliationsTopological quantum computation with Fibonacci anyons relies on the possibility of efficiently generating unitary transformations upon pseudoparticles braiding. The crucial fact that such a set of braids has a dense image in the unitary operations space is well known; in addition, the Solovay–Kitaev algorithm allows us to approach a given unitary operation to any desired accuracy. In this paper, the latter task is fulfilled with an alternative method, in the SU(2) case, based on a generalization of the geodesic dome construction to higher dimension.
03.67.Lx Quantum computation architectures and implementations
81P68 Quantum computation and quantum cryptography (See also 68Q05, 94A60)
Quantum gases, liquids and solids
Issue 17 (2 May 2008)
Received 17 January 2008
Published 15 April 2008
Rémy Mosseri 2008 J. Phys. A: Math. Theor. 41 175302
J D Moulton et al 2008 J. Phys.: Conf. Ser. 124 012035
R L Ray and M S Daugherity 2008 J. Phys. G: Nucl. Part. Phys. 35 125106
V Prasad et al 2007 J. Phys.: Condens. Matter 19 113102
Barry J Cox and James M Hill 2008 J. Phys. A: Math. Theor. 41 125203
A Bostan et al 2009 J. Phys. A: Math. Theor. 42 275209
Jens Struckmeier et al 2008 Nanotechnology 19 384020
Tom Michoel et al 2008 J. Phys. A: Math. Theor. 41 492001
M V Berry and M R Dennis 2008 J. Phys. A: Math. Theor. 41 135203
S Saib et al 2007 J. Phys.: Condens. Matter 19 486209