|
| related topics |
| {error, code, errors} |
| {qubit, qubits, gate} |
| {group, space, representation} |
| {field, particle, equation} |
| {let, theorem, proof} |
| {states, state, optimal} |
| {algorithm, log, probability} |
| {state, states, entangled} |
| {state, algorithm, problem} |
| {time, decoherence, evolution} |
| {state, phys, rev} |
| {state, states, coherent} |
| {force, casimir, field} |
| {temperature, thermal, energy} |
| {operator, operators, space} |
|
Anyons from non-solvable finite groups are sufficient for universal
quantum computation
Carlos Mochon
abstract: We present a constructive proof that anyonic magnetic charges with fluxes in
a non-solvable finite group can perform universal quantum computations. The
gates are built out of the elementary operations of braiding, fusion, and
vacuum pair creation, supplemented by a reservoir of ancillas of known flux.
Procedures for building the ancilla reservoir and for correcting leakage are
also described. Finally, a universal qudit gate-set, which is ideally suited
for anyons, is presented. The gate-set consists of classical computation
supplemented by measurements of the X operator.
- oai_identifier:
- oai:arXiv.org:quant-ph/0206128
- categories:
- quant-ph
- comments:
- 17 pages, REVTeX 4 (minor changes in v2, added motivation for leakage
correction)
- doi:
- 10.1103/PhysRevA.67.022315
- arxiv_id:
- quant-ph/0206128
- journal_ref:
- Phys. Rev. A 67, 022315 (2003)
- report_no:
- CALT-68-2393
- created:
- 2002-06-19
- updated:
- 2003-03-05
Full article ▸
|
|
| related documents |
| 0511178v1 |
| 0405012v1 |
| 0605226v4 |
| 0602157v1 |
| 0406063v3 |
| 9706061v3 |
| 0208069v2 |
| 0310097v4 |
| 0606226v1 |
| 0610084v1 |
| 9601029v3 |
| 0701037v2 |
| 0211014v1 |
| 0408081v5 |
| 0405183v1 |
| 0307019v1 |
| 0510107v1 |
| 0607143v3 |
| 0410001v3 |
| 0210072v1 |
| 0412136v2 |
| 0407095v1 |
| 0304054v2 |
| 0701065v2 |
| 0304061v5 |
|