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

DOI10.1016/J.CPC.2004.04.003zbMATH Open1196.82006DBLPjournals/cphysics/ColeHP04OpenAlexW2002685517WikidataQ59423835 ScholiaQ59423835MaRDI QIDQ709554FDOQ709554

Authors S. Prawer, Jared H. Cole, Lloyd C. L. Hollenberg

Publication date 18 October 2010

Published in Computer Physics Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0404143

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to statistical mechanics (82-04) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: 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.

Recommendations

• Quantum computation in a Ising spin chain taking into account second neighbor couplings
• Quantum computing algorithm for electromagnetic field simulation
• Quantum algorithm for the advection-diffusion equation simulated with the lattice Boltzmann method
• Study on Quantum Annealing Using the Density Matrix Renormalization Group
• Simulation of the diffusion equation on a type-II quantum computer

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3898249 (Why is no real title available?)
• Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
• Equation of state calculations by fast computing machines
• Experimental demonstration of quantum lattice gas computation
• Lattice Boltzmann and quantum lattice gas representations of one-dimensional magnetohydrodynamic turbulence
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Towards an NMR implementation of a quantum lattice gas algorithm

Cited in

(6)

• Simulating the Hamiltonian of dimer atomic spin model of one-dimensional optical lattice on quantum computers
• MODELING FULL ADDER IN ISING SPIN QUANTUM COMPUTER WITH 1000 QUBITS USING QUANTUM MAPS
• Quantization of games: towards quantum artificial intelligence
• Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
• STABILITY OF THE QUANTUM FOURIER TRANSFORMATION ON THE ISING QUANTUM COMPUTER
• Low depth quantum circuits for Ising models

This page was built for publication: An algorithm for simulating the Ising model on a type-II quantum computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709554)