A Random Matrix--Theoretic Approach to Handling Singular Covariance Estimates
(2010)
Trial wavefunctions for the Goldstone mode in \nu=1/2+1/2 quantum Hall bilayers
(2010)
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)