Resources required for topological quantum factoring
- Department of Physics, Yale University, 217 Prospect Street, New Haven, Connecticut 06511 (United States)
- Department of Physics and National High Magnetic Field Laboratory, Florida State University, Tallahassee, Florida 32310 (United States)
- Rudolf Peierls Centre for Theoretical Physics, Oxford University, 1 Keble Road, Oxford OX1 3NP (United Kingdom)
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{sup 3} Fibonacci anyons versus at least 3x10{sup 9} Ising anyons. Other distillation algorithms could reduce the resources for Ising anyons substantially.
- OSTI ID:
- 21407919
- Journal Information:
- Physical Review. A, Vol. 81, Issue 6; Other Information: DOI: 10.1103/PhysRevA.81.062317; (c) 2010 The American Physical Society; ISSN 1050-2947
- Country of Publication:
- United States
- Language:
- English
Similar Records
Exploiting geometric degrees of freedom in topological quantum computing
Topological insulating phases of non-Abelian anyonic chains