Resources Required for Topological Quantum Factoring
arXiv:1002.0537 · doi:10.1103/PhysRevA.81.062317
Abstract
We consider a hypothetical topological quantum computer where the qubits are comprised 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 non-topological 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.
arXiv comment4+epsilon pages, 4 figures
References in corpus (20)
- Fault-tolerant quantum computation by anyons
- Non-Abelian Anyons and Topological Quantum Computation
- Superconducting proximity effect and Majorana fermions at the surface of a topological insulator
- A generic new platform for topological quantum computation using semiconductor heterostructures
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- String-net condensation: A physical mechanism for topological phases
- Beyond paired quantum Hall states: parafermions and incompressible states in the first excited Landau level
- Proposal to stabilize and detect half-quantum vortices in strontium ruthenate thin films: Non-Abelian braiding statistics of vortex matter in a superconductor
- Quantum Computation Using Vortices and Majorana Zero Modes of a + Superfluid of Fermionic Cold Atoms
- Efficient Networks for Quantum Factoring
- Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State
- Quantum phase transitions across p-wave Feshbach resonance
- Stable Topological Superfluid Phase of Ultracold Polar Fermionic Molecules
- Topological Quantum Compiling
- Numerical Analysis of Quasiholes of the Moore-Read Wavefunction
- Non-Abelian quantized Hall states of electrons at filling factors 12/5 and 13/5 in the first excited Landau level
- Large Fourier transforms never exactly realized by braiding conformal blocks
- Topological order from quantum loops and nets
- Quantum hashing with the icosahedral group
- Geometrical approach to SU(2) navigation with Fibonacci anyons
Cited by in corpus (9)
- Universal topological quantum computation from a superconductor/Abelian quantum Hall heterostructure
- A Short Introduction to Topological Quantum Computation
- Introduction to topological quantum computation with non-Abelian anyons
- Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
- Quantum Circuits for Measuring Levin-Wen Operators
- Parafermion supporting platform based on spin transitions in the fractional quantum Hall effect regime
- Parafermions, induced edge states and domain walls in the fractional quantum Hall effect spin transitions
- Topological Quantum Gate Construction by Iterative Pseudogroup Hashing
- A Universal Circuit Set Using the Quantum Double