Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0404143 · Computer Physics Communications

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

Jared H. Cole, Lloyd C. L. Hollenberg, Steven Prawer

Published Jun 8, 2004• 3 citations
arXivHTMLPDF
DOI
10.1016/j.cpc.2004.04.003

Related papers

Quantum Algorithm for the Transverse-Field Ising Model

Robson Giles

•Jan 1, 2024•0 citations

Quantum computing for field and gauge theories in the NISQ era

Erik Gustafson, Stephen P. Jordan, Yannick Meurice +3 more

This thesis looks at how we can leverage current and near future quantum computers to effectively simulate quantum field theories. The scope of this thesis covers how to simulate the (1+1)-D Transverse Ising model on digital quantum computers and the methods to handle multiple types of machine errors to effectively extract real-time dynamic information. We leverage modifications to the transverse Ising model to study the calculation of phase shifts from scattering a particle off of simple potentials and demonstrate that these calculations are feasible on current quantum hardware. In looking toward the future we demonstrate two different state preparation algorithms. One algorithm projected cooling we show can extract information about the second order phase transition in the Transverse Ising Model and has excellent scaling properties. The second algorithm involves leveraging classical field theory simulations to circumvent quantum state preparation methods on that should prove tractable on near term quantum computing hardware. These tools together highlight the promise of quantum computing to tackle interesting problems in high energy physics.

•May 1, 2021•0 citations

Controllable few state quantum systems for information processing

Jared H. Cole

This thesis investigates several different aspects of the physics of few state quantum systems and their use in information processing applications. The main focus is performing high precision computations or experiments using imperfect quantum systems. Specifically looking at methods to calibrate a quantum system once it has been manufactured or performing useful tasks, using a quantum system with only limited spatial or temporal coherence.\n \n A novel method for characterising an unknown two-state Hamiltonian is presented which is based on the measurement of coherent oscillations. The method is subsequently extended to include the effects of decoherence and enable the estimation of uncertainties. Using the uncertainty estimates, the achievable precision for a given number of measurements is computed. This method is tested experimentally using the nitrogen-vacancy defect in diamond as an example of a two-state quantum system of interest for quantum information processing. The method of characterisation is extended to higher dimensional systems and this is illustrated using the Heisenberg interaction between spins as an example.\n \n The use of buried donors in silicon is investigated as an architecture for realising quantum-dot cellular automata as an example of quantum systems used for classical information processing. The interaction strengths and time scales are calculated and both coherent and incoherent evolution are assessed as possible switching mechanisms. The effects of decoherence on the operation of a single cell and the scaling behaviour of a line of cells is investigated.\n \n The use of type-II quantum computers for simulating classical systems is studied as an application of small scale quantum computing. An algorithm is developed for simulating the classical Ising model using Metropolis Monte-Carlo where random number generation is incorporated using quantum superposition. This suggests that several new algorithms could be developed for a type-II quantum computer based on probabilistic cellular automata.

•Oct 1, 2006•0 citations

A fast algorithm for investigations on the three-dimensional Ising model

Michael J. Creutz, P. Mitra, Kevin J. M. Moriarty

Computer Physics Communications•Oct 1, 1984•13 citations

Type II Quantum Computing Algorithm for Computational Fluid Dynamics

James Scoville

An algorithm is presented to simulate fluid dynamics on a three qubit type II quantum computer: a lattice of small quantum computers that communicate classical information. The algorithm presented is called a three qubit factorized quantum lattice gas algorithm. It is modeled after classical lattice gas algorithms which move virtual particles along an imaginary lattice and change the particles' momentums using collision rules when they meet at a lattice node. Instead of moving particles, the quantum algorithm presented here moves probabilities, which interact via a unitary collision operator. Probabilities are determined using ensemble measurement and are moved with classical communications channels. The lattice node spacing is defined to be a microscopic scale length. A mesoscopic governing equation for the lattice is derived for the most general three qubit collision operator which preserves particle number. In the continuum limit of the lattice, a governing macroscopic partial differential equation-the diffusion equation-is derived for a particular collision operator using a Chapman-Enskog expansion. A numerical simulation of the algorithm is carried out on a conventional desktop computer and compared to the analytic solution of the diffusion equation. The simulation agrees very well with the known solution.

•Oct 3, 2012•0 citations

Calculation of partition function of Ising model on quantum computer

H. P. Laba, V. M. Tkachuk

Physics Letters A•Nov 6, 2023•5 citations
This thesis looks at how we can leverage current and near future quantum computers to effectively simulate quantum field theories. The scope of this thesis covers how to simulate the (1+1)-D Transverse Ising model on digital quantum computers and the methods to handle multiple types of machine errors to effectively extract real-time dynamic information. We leverage modifications to the transverse Ising model to study the calculation of phase shifts from scattering a particle off of simple potentials and demonstrate that these calculations are feasible on current quantum hardware. In looking toward the future we demonstrate two different state preparation algorithms. One algorithm projected cooling we show can extract information about the second order phase transition in the Transverse Ising Model and has excellent scaling properties. The second algorithm involves leveraging classical field theory simulations to circumvent quantum state preparation methods on that should prove tractable on near term quantum computing hardware. These tools together highlight the promise of quantum computing to tackle interesting problems in high energy physics.
This thesis investigates several different aspects of the physics of few state quantum systems and their use in information processing applications. The main focus is performing high precision computations or experiments using imperfect quantum systems. Specifically looking at methods to calibrate a quantum system once it has been manufactured or performing useful tasks, using a quantum system with only limited spatial or temporal coherence.\n \n A novel method for characterising an unknown two-state Hamiltonian is presented which is based on the measurement of coherent oscillations. The method is subsequently extended to include the effects of decoherence and enable the estimation of uncertainties. Using the uncertainty estimates, the achievable precision for a given number of measurements is computed. This method is tested experimentally using the nitrogen-vacancy defect in diamond as an example of a two-state quantum system of interest for quantum information processing. The method of characterisation is extended to higher dimensional systems and this is illustrated using the Heisenberg interaction between spins as an example.\n \n The use of buried donors in silicon is investigated as an architecture for realising quantum-dot cellular automata as an example of quantum systems used for classical information processing. The interaction strengths and time scales are calculated and both coherent and incoherent evolution are assessed as possible switching mechanisms. The effects of decoherence on the operation of a single cell and the scaling behaviour of a line of cells is investigated.\n \n The use of type-II quantum computers for simulating classical systems is studied as an application of small scale quantum computing. An algorithm is developed for simulating the classical Ising model using Metropolis Monte-Carlo where random number generation is incorporated using quantum superposition. This suggests that several new algorithms could be developed for a type-II quantum computer based on probabilistic cellular automata.
An algorithm is presented to simulate fluid dynamics on a three qubit type II quantum computer: a lattice of small quantum computers that communicate classical information. The algorithm presented is called a three qubit factorized quantum lattice gas algorithm. It is modeled after classical lattice gas algorithms which move virtual particles along an imaginary lattice and change the particles' momentums using collision rules when they meet at a lattice node. Instead of moving particles, the quantum algorithm presented here moves probabilities, which interact via a unitary collision operator. Probabilities are determined using ensemble measurement and are moved with classical communications channels. The lattice node spacing is defined to be a microscopic scale length. A mesoscopic governing equation for the lattice is derived for the most general three qubit collision operator which preserves particle number. In the continuum limit of the lattice, a governing macroscopic partial differential equation-the diffusion equation-is derived for a particular collision operator using a Chapman-Enskog expansion. A numerical simulation of the algorithm is carried out on a conventional desktop computer and compared to the analytic solution of the diffusion equation. The simulation agrees very well with the known solution.