|
| related topics |
| {state, algorithm, problem} |
| {qubit, qubits, gate} |
| {spin, pulse, spins} |
| {classical, space, random} |
| {states, state, optimal} |
| {temperature, thermal, energy} |
| {measurement, state, measurements} |
| {field, particle, equation} |
| {vol, operators, histories} |
| {algorithm, log, probability} |
| {energy, state, states} |
|
Type-II Quantum Algorithms
Peter J. Love, Bruce M. Boghosian
abstract: We review and analyze the hybrid quantum-classical NMR computing methodology
referred to as Type-II quantum computing. We show that all such algorithms
considered so far within this paradigm are equivalent to some classical
lattice-Boltzmann scheme. We derive a sufficient and necessary constraint on
the unitary operator representing the quantum mechanical part of the
computation which ensures that the model reproduces the Boltzmann approximation
of a lattice-gas model satisfying semi-detailed balance. Models which do not
satisfy this constraint represent new lattice-Boltzmann schemes which cannot be
formulated as the average over some underlying lattice gas. We close the paper
with some discussion of the strengths, weaknesses and possible future direction
of Type-II quantum computing.
- oai_identifier:
- oai:arXiv.org:quant-ph/0506244
- categories:
- quant-ph cond-mat.stat-mech
- comments:
- To appear in Physica A
- doi:
- 10.1016/j.physa.2005.09.017
- arxiv_id:
- quant-ph/0506244
- created:
- 2005-06-28
- updated:
- 2005-09-01
Full article ▸
|
|
| related documents |
| 0108110v2 |
| 0111062v2 |
| 9702039v4 |
| 0009086v1 |
| 0204044v5 |
| 0602135v1 |
| 0701079v1 |
| 0507194v1 |
| 0701198v1 |
| 0612033v1 |
| 0606242v3 |
| 0507024v1 |
| 0703193v2 |
| 0507218v1 |
| 0610251v1 |
| 0603155v1 |
| 0605132v1 |
| 0610258v1 |
| 0701054v1 |
| 0603096v1 |
| 0702143v1 |
| 0507151v1 |
| 0605213v2 |
| 0608156v1 |
| 0612123v2 |
|