Phys. Rev. B 75, 165310 (2007) [19 pages]Topological quantum compilingReceived 17 October 2006; published 11 April 2007 A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum gates acting on qubits encoded using triplets of these quasiparticles can be built entirely out of three-stranded braids (three-braids). These three-braids can then be efficiently compiled and improved to any required accuracy using the Solovay-Kitaev algorithm. © 2007 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevB.75.165310
DOI:
10.1103/PhysRevB.75.165310
PACS:
73.43.−f, 03.67.Lx, 03.67.Pp
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.