2010
DOI: 10.1103/physreva.81.062317
|View full text |Cite
|
Sign up to set email alerts
|

Resources required for topological quantum factoring

Abstract: We consider a hypothetical topological quantum computer composed of either Ising or Fibonacci anyons. For each case, we calculate the time and number of qubits (space) necessary to execute the most computationally expensive step of Shor's algorithm, modular exponentiation. For Ising anyons, we apply Bravyi's distillation method [S. Bravyi, Phys. Rev. A 73, 042313 (2006)] which combines topological and nontopological operations to allow for universal quantum computation. With reasonable restrictions on the phys… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
16
0

Year Published

2011
2011
2025
2025

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(16 citation statements)
references
References 23 publications
0
16
0
Order By: Relevance
“…Not all anyon models, such as Ising anyons, provide universality by braiding alone (Sarma et al, 2015). Such computers need to be supplemented by non-topological operations in order to achieve universality (Baraban et al, 2010;Bravyi, 2006;Pachos, 2012). There even exist schemes for topological quantum computing which entirely replace braiding with different topological operations such as measurement (Bonderson et al, 2008).…”
Section: Using Fibonacci Anyons For Computingmentioning
confidence: 99%
“…Not all anyon models, such as Ising anyons, provide universality by braiding alone (Sarma et al, 2015). Such computers need to be supplemented by non-topological operations in order to achieve universality (Baraban et al, 2010;Bravyi, 2006;Pachos, 2012). There even exist schemes for topological quantum computing which entirely replace braiding with different topological operations such as measurement (Bonderson et al, 2008).…”
Section: Using Fibonacci Anyons For Computingmentioning
confidence: 99%
“…For a π/8 phase gate with 99% fidelity, factoring a 128-bit number would consequently require ≈ 10 9 Ising anyons in the scheme analyzed in Ref. 96 [98]. Thus overcoming the nontrivial fabrication challenges involved could prove enormously beneficial for quantum information applications.…”
Section: Introductionmentioning
confidence: 99%
“…1 & 2 1 [ Ω] 2 [ Ω] Formation of a conducting domain wall at a boundary between unpolarized and polarized ν = 2/3 regions is shown in Fig. 3.…”
mentioning
confidence: 99%