Topological Quantum Computation

Authors:
R. Walter Ogburn;John Preskill
Affiliations:
-;-
Venue:
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Year:
1998

Citing 3
Cited 1

Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Fault-tolerant quantum computation

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Simplifying quantum double hamiltonians using perturbative gadgets

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Following a suggestion of A. Kitaev, we explore the connection between fault-tolerant quantum computation and nonabelian quantum statistics in two spatial dimensions. A suitably designed spin system can support localized excitations (quasiparticles) that exhibit long-range nonabelian Aharonov-Bohm interactions. Quantum information encoded in the charges of the quasiparticles is highly resistant to decoherence, and can be reliably processed by carrying one quasiparticle around another. If information is encoded in pairs of quasiparticles, then the Aharonov-Bohm interactions can be adequate for universal fault-tolerant quantum computation.