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

Simple item page
dc.creatorCole, J. H.
dc.creatorHollenberg, L. C. L.
dc.creatorPrawer, S.
dc.date2004-04-26
dc.date.accessioned2026-07-07T06:09:36Z
dc.date.available2026-07-07T06:09:36Z
dc.descriptionPresented 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.
dc.description14 pages, 11 figures. Accepted for publication in Computer Physics Communications
dc.identifierhttps://arxiv.org/abs/quant-ph/0404143
dc.identifierhttp://arxiv.org/abs/quant-ph/0404143
dc.identifierComputer Physics Communications, Vol. 161 (1-2), pg 18-26, 2004
dc.identifierdoi:10.1016/j.cpc.2004.04.003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92017
dc.subjectQuantum Physics
dc.titleAn algorithm for simulating the Ising model on a type-II quantum computer
dc.typetext

Files

Collections

arXiv