|
related topics |
{qubit, qubits, gate} |
{let, theorem, proof} |
{state, algorithm, problem} |
{measurement, state, measurements} |
{state, phys, rev} |
{operator, operators, space} |
{error, code, errors} |
{states, state, optimal} |
{alice, bob, state} |
{group, space, representation} |
|
Cluster state quantum computation for many-level systems
William Hall
abstract: The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188]
outlines a scheme that allows one to use measurement on a large set of
entangled quantum systems in what is known as a cluster state to undertake
quantum computations. The model itself and many works dedicated to it involve
using entangled qubits. In this paper we consider the issue of using entangled
qudits instead. We present a complete framework for cluster state quantum
computation using qudits, which not only contains the features of the original
qubit model but also contains the new idea of adaptive computation: via a
change in the classical computation that helps to correct the errors that are
inherent in the model, the implemented quantum computation can be changed. This
feature arises through the extra degrees of freedom that appear when using
qudits. Finally, for prime dimensions, we give a very explicit description of
the model, making use of mutually unbiased bases.
- oai_identifier:
- oai:arXiv.org:quant-ph/0512130
- categories:
- quant-ph
- comments:
- 26 pages, 9 figures, LaTeX. Some streamlining of presentation and
improved example. To appear in Quantum Information and Computation
- arxiv_id:
- quant-ph/0512130
- created:
- 2005-12-16
- updated:
- 2006-06-08
Full article ▸
|
|
related documents |
0207157v1 |
0508124v2 |
0304061v5 |
9808027v1 |
0503230v1 |
0702212v1 |
0605244v3 |
0606226v1 |
0610105v1 |
0605175v1 |
0610214v3 |
0601183v1 |
0607043v1 |
0603138v1 |
0611058v2 |
0608039v4 |
0701007v2 |
0611166v2 |
0609052v3 |
0603212v1 |
0607105v2 |
0609160v1 |
0603285v1 |
0611225v2 |
0606077v1 |
|