Resources required for topological quantum factoring
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...
Main Authors: | Baraban, M, Bonesteel, N, Simon, S |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2010
|
Similar Items
-
Topological quantum compiling
by: Hormozi, L, et al.
Published: (2007) -
Topological quantum computing with Read-Rezayi states.
by: Hormozi, L, et al.
Published: (2009) -
Braid topologies for quantum computation.
by: Bonesteel, N, et al.
Published: (2005) -
Topological quantum computing with only one mobile quasiparticle.
by: Simon, S, et al.
Published: (2006) -
Numerical analysis of quasiholes of the moore-read wave function.
by: Baraban, M, et al.
Published: (2009)