2007
DOI: 10.1103/physrevb.75.165310
|View full text |Cite
|
Sign up to set email alerts
|

Topological quantum compiling

Abstract: A method for compiling quantum algorithms into specific braiding patterns for nonabelian 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.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
134
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 85 publications
(142 citation statements)
references
References 44 publications
2
134
0
Order By: Relevance
“…One of the simplest models of non-Abelian statistics is known as the Fibonacci anyon model, or "Golden theory" (Bonesteel et al, 2005;Freedman et al, 2002a;Hormozi et al, 2007;Preskill, 2004). In this model, there are only two fields, the identity (1) as well as single nontrivial field usually called τ which represents the non-Abelian quasiparticle.…”
Section: B Fibonacci Anyons: a Simple Example Which Is Universal Formentioning
confidence: 99%
“…One of the simplest models of non-Abelian statistics is known as the Fibonacci anyon model, or "Golden theory" (Bonesteel et al, 2005;Freedman et al, 2002a;Hormozi et al, 2007;Preskill, 2004). In this model, there are only two fields, the identity (1) as well as single nontrivial field usually called τ which represents the non-Abelian quasiparticle.…”
Section: B Fibonacci Anyons: a Simple Example Which Is Universal Formentioning
confidence: 99%
“…For example, by use of braiding matrices (4.31) of the 4-quasi-particle states in the Pfaffian state, we can construct the NOT gate and the Hadamard gate by [20] [16] that the gate of large Fourier transformation cannot be realized exactly. In fact several unitary gates were approximated using these braiding matrices [4,27,55]. It may be interesting to construct fundamental gates such as NOT, Hadamard, and CNOT, using the braiding matrices of SU(2) K theory presented here.…”
Section: Concluding Remarks and Discussionmentioning
confidence: 99%
“…13, when using the Fibonacci code, Fibonacci anyons can be associated with holes in the lattice subject to certain boundary conditions and proper initialization. These Fibonacci anyons can then be used to encode logical qubits and universal quantum computation can be carried out purely by braiding them, [17][18][19] without the need for magic state distillation.…”
Section: -512mentioning
confidence: 99%