English

Type-II Quantum Algorithms

Quantum Physics 2009-11-11 v2 Statistical Mechanics

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.

Keywords

Cite

@article{arxiv.quant-ph/0506244,
  title  = {Type-II Quantum Algorithms},
  author = {Peter J. Love and Bruce M. Boghosian},
  journal= {arXiv preprint arXiv:quant-ph/0506244},
  year   = {2009}
}

Comments

To appear in Physica A