Resources required for topological quantum factoring
Physical Review A - Atomic, Molecular, and Optical Physics 81:6 (2010)
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 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 103 Fibonacci anyons versus at least 3脳109 Ising anyons. Other distillation algorithms could reduce the resources for Ising anyons substantially. 漏 2010 The American Physical Society.Space-Time Geometry of Topological phases
(2010)
Wilson Line Picture of Levin-Wen Partition Functions
(2010)
Skyrmions in the moore-read state at 谓=52
Physical Review Letters 104:8 (2010)
Abstract:
We study charged excitations of the non-Abelian Moore-Read liquid at a filling factor 谓=52, allowing for spin depolarization. Using a combination of numerical studies, and taking account of nonzero well widths, we find that at a sufficiently low Zeeman energy it is energetically favorable for charge e/4 quasiholes to bind into Skyrmions of charge e/2. We show that Skyrmion formation is further promoted by disorder, and argue that this can lead to a depolarized 谓=52 ground state in realistic experimental situations. We comment on the consequences for the activated transport. 漏 2010 The American Physical Society.Resources Required for Topological Quantum Factoring
(2010)