9802065v1

related topics
{qubit, qubits, gate}
{trap, ion, state}
{error, code, errors}
{algorithm, log, probability}
{time, systems, information}
{theory, mechanics, state}
{state, phys, rev}
{time, decoherence, evolution}
{temperature, thermal, energy}
{alice, bob, state}
{entanglement, phys, rev}
{state, states, coherent}
{particle, mechanics, theory}
{information, entropy, channel}
{cavity, atom, atoms}
{energy, gaussian, time}
{level, atom, field}

Basics of Quantum Computation

Vlatko Vedral, Martin B. Plenio

abstract: Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counter-part. In this review we explain the basic principles of quantum computation, including the construction of basic gates, and networks. We illustrate the power of quantum algorithms using the simple problem of Deutsch, and explain, again in very simple terms, the well known algorithm of Shor for factorisation of large numbers into primes. We then describe physical implementations of quantum computers, focusing on one in particular, the linear ion-trap realization. We explain that the main obstacle to building an actual quantum computer is the problem of decoherence, which we show may be circumvented using the methods of quantum error correction.

oai_identifier:
oai:arXiv.org:quant-ph/9802065
categories:
quant-ph
comments:
28 pages including 17 figures, invited basic review article for Progress in Quantum Electronics
doi:
10.1016/S0079-6727(98)00004-4
arxiv_id:
quant-ph/9802065
journal_ref:
Prog. Quant. Electron. 22, 1 - 40 (1998)
created:
1998-02-25

Full article ▸

related documents
0503230v1
0508124v2
0512130v2
0006122v2
0207157v1
0304061v5
9808027v1
0407095v1
0410001v3
0104085v1
0012148v1
0311069v1
0511178v1
9805070v1
0004107v1
0003137v2
0303175v1
0304054v2
0008015v2
9908074v5
0206128v2
0012067v1
0606226v1
0305038v2
9909082v1