Journal
PHYSICAL REVIEW A
Volume 81, Issue 6, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevA.81.062317
Keywords
-
Categories
Funding
- National Science Foundation [DMR-0603369]
- US Department of Energy [DE-FG02-97ER45639]
- U.S. Department of Energy (DOE) [DE-FG02-97ER45639] Funding Source: U.S. Department of Energy (DOE)
Ask authors/readers for more resources
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 physical parameters we find that factoring a 128-bit number requires approximately 10(3) Fibonacci anyons versus at least 3 x 10(9) Ising anyons. Other distillation algorithms could reduce the resources for Ising anyons substantially.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available