Type II quantum algorithms

Peter J. Love and Bruce M. Boghosian

Physica A: Statistical Mechanics and its Applications, 2006, vol. 362, issue 1, 210-214

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 conclude the paper with some discussion of the strengths, weaknesses and possible future direction of Type II quantum computing.

Keywords: Lattice-gas; Lattice Boltzmann; Quantum computation (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437105009507
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:362:y:2006:i:1:p:210-214

DOI: 10.1016/j.physa.2005.09.017

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().