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

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

2004-04-26

arxiv.org/abs/quant-ph/0404143v1

Computer Physics Communications, Vol. 161 (1-2), pg 18-26, 2004

Physics

Quantum Physics

14 pages, 11 figures. Accepted for publication in Computer Physics Communications

Scientific paper

10.1016/j.cpc.2004.04.003

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.

Affiliated with

Also associated with

No associations

Rating

An algorithm for simulating the Ising model on a type-II quantum computer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An algorithm for simulating the Ising model on a type-II quantum computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An algorithm for simulating the Ising model on a type-II quantum computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-630865