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

Physical Review A

Simulation of the diffusion equation on a type-II quantum computer

G. P. Berman, Alexandr Alexandrovich Ezhov, D. I. Kamenev, Jeffrey Yepez

Published Jul 24, 2002• 29 citations
Publisher

Abstract

A lattice-gas algorithm for the one-dimensional diffusion equation is realized using radio frequency pulses in a one-dimensional spin system. The model is a large array of quantum two-qubit nodes interconnected by the nearest-neighbor classical communication channels. We present a quantum protocol for implementation of the quantum collision operator and a method for initialization and reinitialization of quantum states. Numerical simulations of the quantum-classical dynamics are in good agreement with the analytic solution for the diffusion equation.

DOI
10.1103/physreva.66.012310

Related papers

QUANTUM LATTICE-GAS MODEL FOR THE DIFFUSION EQUATION

Jeffrey Yepez

Presented is a factorized quantum lattice-gas algorithm to model the diffusion equation. It is a minimal model with two qubits per node of a one-dimensional lattice and it is suitable for implementation on a large array of small quantum computers interconnected by nearest-neighbor classical communication channels. The quantum lattice-gas system is described at the mesoscopic scale by a lattice-Boltzmann equation whose collision term is unconditionally stable and obeys the principle of detailed balance. An analytical treatment of the model is given to predict a macroscopic effective field theory. The numerical simulations are in excellent agreement with the analytical results. In particular, numerical simulations confirm the value of the analytically calculated diffusion constant. The algorithm is time-explicit with numerical convergence that is first-order accurate in time and second-order accurate in space.

International Journal of Modern Physics C•Nov 1, 2001•38 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

Implementing a type-ii nuclear magnetic resonance quantum computer

Lisa Catherine Siskind

Recent work has demonstrated the feasibility of using an array of quantum information processors connected via classical channels (Type II Quantum Computer) to calculate the quantum lattice-gas algorithm. This thesis describes the construction and implementation of a new hardware scheme for a Type II Quantum computer. This system has different hardware and software specifications but does follow previously published approaches of operation encoding the initial mass density onto a two-qubit processor and using standard pulse techniques to step through the algorithm. New hardware for this system includes the use of multiple coils controlled by a hardware switch array as well as a full function, two channel spectrometer for dual readouts. New software includes a top-level control system for the spectrometer for quick experimental configuration as well as reconfigurable modeling software to verify results. Results are presented here for the quantum lattice gas algorithm for the diffusion equation run on two systems: a prototype configuration using a single coil in a 1.5 Tesla magnet and a final configuration using a coil array in a 5.0 Tesla magnet.* *This dissertation is a compound document (contains both a paper copy and a CD as part of the dissertation). The CD requires the following system requirements: Adobe Acrobat.

•Jan 1, 2005•0 citations

Quantum Implementation of Numerical Methods for Convection-Diffusion Equations: Toward Computational Fluid Dynamics

Bofeng Liu, Lixing Zhu, Zixuan Yang +1 more

We present quantum numerical methods for the typical initial boundary value problems (IBVPs) of convection-diffusion equations in fluid dynamics. The IBVP is discretized into a series of linear systems via finite difference methods and explicit time marching schemes. To solve these discrete systems in quantum computers, we design a series of quantum circuits, including four stages of encoding, amplification, adding source terms, and incorporating boundary conditions. In the encoding stage, the initial condition is encoded in the amplitudes of quantum registers as a state vector to take advantage of quantum algorithms in space complexity. In the following three stages, the discrete differential operators in classical computing are converted into unitary evolutions to satisfy the postulate in quantum systems. The related arithmetic calculations in quantum amplitudes are also realized to sum up the increments from these stages. The proposed quantum algorithm is implemented within the open-source quantum computing framework Qiskit [2]. By simulating one-dimensional transient problems, including the Helmholtz equation, the Burgers’ equation, and Navier-Stokes equations, we demonstrate the capability of quantum computers in fluid dynamics.

Communications in Computational Physics•Mar 12, 2023•17 citations

Fully Quantum Algorithm for the 1-dimensional linear Lattice Boltzmann Method

Mohammed Bediche, Matthijs van Waveren, Denis Ricot +1 more

A fully quantum algorithm for solving the one-dimensional linear advection-diffusion equation using the Lattice Boltzmann method as a numerical procedure is presented in this work. We start by presenting a state of the art of the current usage of quantum algorithms for solving ordinary and partial differential equations. We then describe two algorithms for the one-dimensional Lattice Boltzmann method with two degrees of freedom. The first one is an existing hybrid quantum-classical algorithm with measurements at each time step, and the second one is our improved version, viz. a fully quantum algorithm where only one measurement is needed at the end of the algorithm. The fully quantum algorithm is first executed on a quantum simulator and then compared with a classical approach. Subsequently, the fully quantum algorithm is run on a quantum system with 133 qubits to investigate the effect of noise and the depth of the circuit on the output state. We find fluctuations in the final result due to the decoherence noise of the qubits.

quant-pharXiv:2606.16514•Communications in computer and information science•Jun 16, 2026•0 citations

Quantum lattice gas algorithm for quantum turbulence and vortex reconnection in the Gross-Pitaevskii equation

George Vahala, Jeffrey Yepez, Linda L. Vahala

The ground state wave function for a Bose Einstein condensate is well described by the Gross-Pitaevskii equation. A Type-II quantum algorithm is devised that is ideally parallelized even on a classical computer. Only 2 qubits are required per spatial node. With unitary local collisions, streaming of entangled states and a spatially inhomogeneous unitary gauge rotation one recovers the Gross-Pitaevskii equation. Quantum vortex reconnection is simulated - even without any viscosity or resistivity (which are needed in classical vortex reconnection).

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Mar 5, 2008•2 citations
A lattice-gas algorithm for the one-dimensional diffusion equation is realized using radio frequency pulses in a one-dimensional spin system. The model is a large array of quantum two-qubit nodes interconnected by the nearest-neighbor classical communication channels. We present a quantum protocol for implementation of the quantum collision operator and a method for initialization and reinitialization of quantum states. Numerical simulations of the quantum-classical dynamics are in good agreement with the analytic solution for the diffusion equation.
Presented is a factorized quantum lattice-gas algorithm to model the diffusion equation. It is a minimal model with two qubits per node of a one-dimensional lattice and it is suitable for implementation on a large array of small quantum computers interconnected by nearest-neighbor classical communication channels. The quantum lattice-gas system is described at the mesoscopic scale by a lattice-Boltzmann equation whose collision term is unconditionally stable and obeys the principle of detailed balance. An analytical treatment of the model is given to predict a macroscopic effective field theory. The numerical simulations are in excellent agreement with the analytical results. In particular, numerical simulations confirm the value of the analytically calculated diffusion constant. The algorithm is time-explicit with numerical convergence that is first-order accurate in time and second-order accurate in space.
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.
Recent work has demonstrated the feasibility of using an array of quantum information processors connected via classical channels (Type II Quantum Computer) to calculate the quantum lattice-gas algorithm. This thesis describes the construction and implementation of a new hardware scheme for a Type II Quantum computer. This system has different hardware and software specifications but does follow previously published approaches of operation encoding the initial mass density onto a two-qubit processor and using standard pulse techniques to step through the algorithm. New hardware for this system includes the use of multiple coils controlled by a hardware switch array as well as a full function, two channel spectrometer for dual readouts. New software includes a top-level control system for the spectrometer for quick experimental configuration as well as reconfigurable modeling software to verify results. Results are presented here for the quantum lattice gas algorithm for the diffusion equation run on two systems: a prototype configuration using a single coil in a 1.5 Tesla magnet and a final configuration using a coil array in a 5.0 Tesla magnet.* *This dissertation is a compound document (contains both a paper copy and a CD as part of the dissertation). The CD requires the following system requirements: Adobe Acrobat.
We present quantum numerical methods for the typical initial boundary value problems (IBVPs) of convection-diffusion equations in fluid dynamics. The IBVP is discretized into a series of linear systems via finite difference methods and explicit time marching schemes. To solve these discrete systems in quantum computers, we design a series of quantum circuits, including four stages of encoding, amplification, adding source terms, and incorporating boundary conditions. In the encoding stage, the initial condition is encoded in the amplitudes of quantum registers as a state vector to take advantage of quantum algorithms in space complexity. In the following three stages, the discrete differential operators in classical computing are converted into unitary evolutions to satisfy the postulate in quantum systems. The related arithmetic calculations in quantum amplitudes are also realized to sum up the increments from these stages. The proposed quantum algorithm is implemented within the open-source quantum computing framework Qiskit [2]. By simulating one-dimensional transient problems, including the Helmholtz equation, the Burgers’ equation, and Navier-Stokes equations, we demonstrate the capability of quantum computers in fluid dynamics.
A fully quantum algorithm for solving the one-dimensional linear advection-diffusion equation using the Lattice Boltzmann method as a numerical procedure is presented in this work. We start by presenting a state of the art of the current usage of quantum algorithms for solving ordinary and partial differential equations. We then describe two algorithms for the one-dimensional Lattice Boltzmann method with two degrees of freedom. The first one is an existing hybrid quantum-classical algorithm with measurements at each time step, and the second one is our improved version, viz. a fully quantum algorithm where only one measurement is needed at the end of the algorithm. The fully quantum algorithm is first executed on a quantum simulator and then compared with a classical approach. Subsequently, the fully quantum algorithm is run on a quantum system with 133 qubits to investigate the effect of noise and the depth of the circuit on the output state. We find fluctuations in the final result due to the decoherence noise of the qubits.
The ground state wave function for a Bose Einstein condensate is well described by the Gross-Pitaevskii equation. A Type-II quantum algorithm is devised that is ideally parallelized even on a classical computer. Only 2 qubits are required per spatial node. With unitary local collisions, streaming of entangled states and a spatially inhomogeneous unitary gauge rotation one recovers the Gross-Pitaevskii equation. Quantum vortex reconnection is simulated - even without any viscosity or resistivity (which are needed in classical vortex reconnection).