0511178v1

related topics
{error, code, errors}
{qubit, qubits, gate}
{state, phys, rev}
{group, space, representation}
{field, particle, equation}
{operator, operators, space}
{algorithm, log, probability}
{measurement, state, measurements}
{energy, state, states}
{state, states, entangled}
{let, theorem, proof}
{time, decoherence, evolution}
{state, algorithm, problem}
{alice, bob, state}
{phase, path, phys}
{temperature, thermal, energy}
{state, states, coherent}
{observables, space, algebra}
{wave, scattering, interference}
{information, entropy, channel}
{key, protocol, security}
{spin, pulse, spins}

Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State

Sergey Bravyi

abstract: We consider topological quantum computation (TQC) with a particular class of anyons that are believed to exist in the Fractional Quantum Hall Effect state at Landau level filling fraction nu=5/2. Since the braid group representation describing statistics of these anyons is not computationally universal, one cannot directly apply the standard TQC technique. We propose to use very noisy non-topological operations such as direct short-range interaction between anyons to simulate a universal set of gates. Assuming that all TQC operations are implemented perfectly, we prove that the threshold error rate for non-topological operations is above 14%. The total number of non-topological computational elements that one needs to simulate a quantum circuit with $L$ gates scales as $L(\log L)^3$.

oai_identifier:
oai:arXiv.org:quant-ph/0511178
categories:
quant-ph
comments:
17 pages, 12 eps figures
doi:
10.1103/PhysRevA.73.042313
arxiv_id:
quant-ph/0511178
journal_ref:
Phys. Rev. A 73, 042313 (2006)
created:
2005-11-17

Full article ▸

related documents
0606226v1
0208069v2
0406063v3
0310097v4
0206128v2
0610084v1
9706061v3
0701037v2
0405012v1
0602157v1
0607143v3
0605226v4
0701065v2
0610105v1
0512058v3
0610214v3
0601183v1
0702212v1
0607043v1
0605175v1
0608039v4
0611058v2
0611166v2
0603285v1
0609160v1