An algorithm for simulating the Ising model on a type-II quantum computer

Presented here is an algorithm for a type-II quantum computer which simulates the Ising model in one and two dimensions. It is equivalent to the Metropolis Monte Carlo method and takes advantage of quantum superposition for random number generation. This algorithm does not require the ensemble of st...

Full description

Saved in:
Bibliographic Details
Published in:Computer physics communications 2004-08, Vol.161 (1), p.18-26
Main Authors: Cole, J.H., Hollenberg, L.C.L., Prawer, S.
Format: Article
Language:English
Subjects:
Cellular Automata
Ising model
Metropolis Monte Carlo
Quantum computation
Type-II quantum computer
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Presented here is an algorithm for a type-II quantum computer which simulates the Ising model in one and two dimensions. It is equivalent to the Metropolis Monte Carlo method and takes advantage of quantum superposition for random number generation. This algorithm does not require the ensemble of states to be measured at the end of each iteration, as is required for other type-II algorithms. Only the binary result is measured at each node which means this algorithm could be implemented using a range of different quantum computing architectures. The Ising model provides an example of how cellular automata rules can be formulated to be run on a type-II quantum computer.
ISSN:0010-4655
1879-2944
DOI:10.1016/j.cpc.2004.04.003