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

Frontiers in Mechanical Engineering

On the Viability of Quantum Annealers to Solve Fluid Flows

Navamita Ray, Tirtha Banerjee, Balu T. Nadiga, Satish Karra

Published Jul 4, 2022• 14 citations
Publisher

Abstract

This paper explores the suitability of upcoming novel computing technologies, particularly adiabatic annealing based quantum computers, to solve fluid dynamics problems that form a critical component of several science and engineering applications. For our experiments, we start with a well-studied one-dimensional simple flow problem, and provide a framework to convert such problems in continuum to a form amenable for deployment on such quantum annealers. Since the DWave annealer returns multiple states sampling the energy landscape of the problem, we explore multiple solution selection strategies to approximate the solution of the problem. We analyze the continuum solutions obtained both qualitatively and quantitatively as well as their sensitivities to the particular solution selection scheme.

DOI
10.3389/fmech.2022.906696

Related papers

Towards Solving the Navier-Stokes Equation on Quantum Computers

Navamita Ray, Tirtha Banerjee, Balasubramanya Nadiga +1 more

In this paper, we explore the suitability of upcoming novel computing technologies, in particular adiabatic annealing based quantum computers, to solve fluid dynamics problems that form a critical component of several science and engineering applications. We start with simple flows with well-studied flow properties, and provide a framework to convert such systems to a form amenable for deployment on such quantum annealers. We analyze the solutions obtained both qualitatively and quantitatively as well as the sensitivities of the various solution selection schemes on the obtained solution.

arXiv:1904.09033•Apr 16, 2019•28 citations

A Quantum Annealing Approach to Fluid Dynamics Problems Solving Navier-Stokes Equations

Juan De Dios Rodríguez, Alejandro Pujante Pérez, Eduardo Illueca Fernández +1 more

Partial differential equations (PDEs) present important computational challenges in several scientific disciplines. Classical numerical methods, while effective, often encounter scalability issues and high computational costs, particularly for complex problems. Quantum computing seems to address these challenges, offering a potential exponential speedup over classical methods. The presented work studies the application of quantum computing, specifically Quantum Annealing, to the computational complexities inherent in solving the Navier-Stokes equations within Computational Fluid Dynamics (CFD). Our study examines the quantum annealing methodology, conducting two different experiments and analyzing the error between the simulation and the analytical solution. The results obtained demonstrate that quantum annealing paradigm can solve this problems and the errors obtained are acceptable in comparison with other methods in the state of the art. By combining theoretical insights with practical implementation, this research clarifies the potential of quantum annealing, providing a comprehensive overview of the simulation framework, analyzing the obtained results, and suggesting future research avenues.

International Conference on Smart and Sustainable Technologies (SpliTech)•Jun 25, 2024•1 citation

Adiabatic Quantum Computing with QUBO Formulations

Rui Hua

Quantum physics has the potential to revolutionize computer science by building what is called a quantum computer. Quantum computers can perform tasks that are impossible with Turing-machine based classical computers (e.g., generating random sequences of bits) and can outperform classical computers (to different degrees) in a variety of classical computation problems. Several different models of quantum computing exist. Based on the Adiabatic Theorem in physics, Adiabatic Quantum Computing is a novel computing framework that is drastically different from the more traditional quantum logic gate model. Traditionally, quantum computing has only been tested on devices with a very small number of qubits, severely limiting their uses in practice. In recent years however, advances in engineering and physics have allowed the construction for (relatively) large machines called quantum annealers that do what is known as a specific type of adiabatic quantum computation called quantum annealing. Solving classical computation problems with the quantum annealing framework is not an easy task and there are many obstacles to overcome if we want to achieve any kind of speedups over classical algorithms. In this thesis, we present quantum annealing solutions to several classical problems including the Hamiltonian Cycle Problem, Mixed Dominating Set Problem, Graph Isomorphism Problem, Densest k-Subgraph Problem and the Maximum Weighted Independent Set Problem. Experimental results of these quantum solutions on DWave quantum annealers are also reported. We also look at some of the bottlenecks in the quantum annealing framework and propose several novel approach to mitigate their effects on the efficiency of the quantum solutions.

•Jan 1, 2016•2 citations

Traffic Flow Optimization Using a Quantum Annealer

Florian Neukart, G. Compostella, Christian Seidel +3 more

Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks. In this paper, we present a real-world application that uses quantum technologies. Specifically, we show how to map certain parts of a real-world traffic flow optimization problem to be suitable for quantum annealing. We show that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum computing. Due to the limited size and connectivity of current-generation D-Wave QPUs, we use a hybrid quantum and classical approach to solve the traffic flow problem.

arXiv:1708.01625•Frontiers in ICT•Dec 19, 2017•516 citations

Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics

Steven Abel, Andrei Constantin, Luca A. Nutricati

Quantum annealing is a computational paradigm in which optimisation problems are mapped onto the energy landscape of an interacting quantum system and explored through its dynamical evolution. By continuously transforming a simple initial Hamiltonian into one whose ground state encodes the solution, the system traverses a complex landscape via a combination of quantum fluctuations, tunnelling processes, and dissipative dynamics. Unlike gate-based quantum computing, quantum annealing is a specialised and near-term approach aimed primarily at discrete optimisation and sampling tasks. While it is not expected to provide polynomial-time solutions to NP-hard problems in the worst case, it offers a physically motivated heuristic for navigating rugged energy landscapes that arise across science and engineering. Modern quantum annealers realise programmable spin systems with thousands of qubits, placing them among the largest controllable quantum devices currently available. As a result, their significance extends beyond optimisation: they also function as experimental platforms for studying non-equilibrium many-body quantum dynamics in regimes that are difficult to access using classical simulation. In this review we present an accessible introduction to the principles of quantum annealing, describe the main hardware platforms and algorithmic techniques, and analyse how tunnelling, spectral gaps, and open-system effects shape computational performance. We survey applications ranging from optimisation and machine learning to quantum simulation and many-body physics, and discuss the central challenges in benchmarking, scaling, and control. These perspectives position quantum annealing as a distinctive framework at the interface of optimisation, stochastic sampling, and programmable quantum dynamics, with a role that is complementary to both classical algorithms and gate-based quantum computing.

quant-pharXiv:2605.06857•Contemporary Physics•May 11, 2026•1 citation

Quantum Computing Applications for Compact Heat Exchanger Design and Assessment

Giulio Malinverno, Javier Blasco Alberto

Abstract This paper explores possible implementations of quantum computing technologies, namely the quantum annealing and the quantum walk search algorithm, to solve fluid dynamics problems related to the design and assessment of compact heat exchangers for aeronautical environmental control and thermal management systems, as well as several other science and engineering applications, e.g. oil and gas refinery process. The purpose of this paper is to introduce two alternative implementations to the already assessed numerical resolution of Navier–Stokes equations or the resolution of analog quantum mechanical problem, highlighting how the use of quantum annealing and a classification algorithm (quantum walk search algorithm) can be implemented for the resolution of a lumped-characteristic analytical model of the heat transfer inside a compact heat exchanger, also in case of two-phase refrigerant fluid, for the use during design phase of environmental control system, e.g. provide the design engineers with a relatively simple and quick to use tool, which provides a reasonable result with an easily interpretable physical meaning. We start with a simple two-phase flow within a single-pass mini-channel heat exchanger, describing the mathematical formulation of the problem followed by a simplified implementation of the proposed quantum approaches, highlighting the main procedures of the calculation as well as the practical implications, advantages and disadvantages of the proposed method, e.g. a limited number of CFD simulations are required to evaluate air side heat transfer coefficient and pressure drop for particular designs within the defined design space, and the specific hardware required to implement the quantum process.

Aerotecnica Missili & Spazio•Jun 13, 2025•2 citations
This paper explores the suitability of upcoming novel computing technologies, particularly adiabatic annealing based quantum computers, to solve fluid dynamics problems that form a critical component of several science and engineering applications. For our experiments, we start with a well-studied one-dimensional simple flow problem, and provide a framework to convert such problems in continuum to a form amenable for deployment on such quantum annealers. Since the DWave annealer returns multiple states sampling the energy landscape of the problem, we explore multiple solution selection strategies to approximate the solution of the problem. We analyze the continuum solutions obtained both qualitatively and quantitatively as well as their sensitivities to the particular solution selection scheme.
In this paper, we explore the suitability of upcoming novel computing technologies, in particular adiabatic annealing based quantum computers, to solve fluid dynamics problems that form a critical component of several science and engineering applications. We start with simple flows with well-studied flow properties, and provide a framework to convert such systems to a form amenable for deployment on such quantum annealers. We analyze the solutions obtained both qualitatively and quantitatively as well as the sensitivities of the various solution selection schemes on the obtained solution.
Partial differential equations (PDEs) present important computational challenges in several scientific disciplines. Classical numerical methods, while effective, often encounter scalability issues and high computational costs, particularly for complex problems. Quantum computing seems to address these challenges, offering a potential exponential speedup over classical methods. The presented work studies the application of quantum computing, specifically Quantum Annealing, to the computational complexities inherent in solving the Navier-Stokes equations within Computational Fluid Dynamics (CFD). Our study examines the quantum annealing methodology, conducting two different experiments and analyzing the error between the simulation and the analytical solution. The results obtained demonstrate that quantum annealing paradigm can solve this problems and the errors obtained are acceptable in comparison with other methods in the state of the art. By combining theoretical insights with practical implementation, this research clarifies the potential of quantum annealing, providing a comprehensive overview of the simulation framework, analyzing the obtained results, and suggesting future research avenues.
Quantum physics has the potential to revolutionize computer science by building what is called a quantum computer. Quantum computers can perform tasks that are impossible with Turing-machine based classical computers (e.g., generating random sequences of bits) and can outperform classical computers (to different degrees) in a variety of classical computation problems. Several different models of quantum computing exist. Based on the Adiabatic Theorem in physics, Adiabatic Quantum Computing is a novel computing framework that is drastically different from the more traditional quantum logic gate model. Traditionally, quantum computing has only been tested on devices with a very small number of qubits, severely limiting their uses in practice. In recent years however, advances in engineering and physics have allowed the construction for (relatively) large machines called quantum annealers that do what is known as a specific type of adiabatic quantum computation called quantum annealing. Solving classical computation problems with the quantum annealing framework is not an easy task and there are many obstacles to overcome if we want to achieve any kind of speedups over classical algorithms. In this thesis, we present quantum annealing solutions to several classical problems including the Hamiltonian Cycle Problem, Mixed Dominating Set Problem, Graph Isomorphism Problem, Densest k-Subgraph Problem and the Maximum Weighted Independent Set Problem. Experimental results of these quantum solutions on DWave quantum annealers are also reported. We also look at some of the bottlenecks in the quantum annealing framework and propose several novel approach to mitigate their effects on the efficiency of the quantum solutions.
Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks. In this paper, we present a real-world application that uses quantum technologies. Specifically, we show how to map certain parts of a real-world traffic flow optimization problem to be suitable for quantum annealing. We show that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum computing. Due to the limited size and connectivity of current-generation D-Wave QPUs, we use a hybrid quantum and classical approach to solve the traffic flow problem.
Quantum annealing is a computational paradigm in which optimisation problems are mapped onto the energy landscape of an interacting quantum system and explored through its dynamical evolution. By continuously transforming a simple initial Hamiltonian into one whose ground state encodes the solution, the system traverses a complex landscape via a combination of quantum fluctuations, tunnelling processes, and dissipative dynamics. Unlike gate-based quantum computing, quantum annealing is a specialised and near-term approach aimed primarily at discrete optimisation and sampling tasks. While it is not expected to provide polynomial-time solutions to NP-hard problems in the worst case, it offers a physically motivated heuristic for navigating rugged energy landscapes that arise across science and engineering. Modern quantum annealers realise programmable spin systems with thousands of qubits, placing them among the largest controllable quantum devices currently available. As a result, their significance extends beyond optimisation: they also function as experimental platforms for studying non-equilibrium many-body quantum dynamics in regimes that are difficult to access using classical simulation. In this review we present an accessible introduction to the principles of quantum annealing, describe the main hardware platforms and algorithmic techniques, and analyse how tunnelling, spectral gaps, and open-system effects shape computational performance. We survey applications ranging from optimisation and machine learning to quantum simulation and many-body physics, and discuss the central challenges in benchmarking, scaling, and control. These perspectives position quantum annealing as a distinctive framework at the interface of optimisation, stochastic sampling, and programmable quantum dynamics, with a role that is complementary to both classical algorithms and gate-based quantum computing.
Abstract This paper explores possible implementations of quantum computing technologies, namely the quantum annealing and the quantum walk search algorithm, to solve fluid dynamics problems related to the design and assessment of compact heat exchangers for aeronautical environmental control and thermal management systems, as well as several other science and engineering applications, e.g. oil and gas refinery process. The purpose of this paper is to introduce two alternative implementations to the already assessed numerical resolution of Navier–Stokes equations or the resolution of analog quantum mechanical problem, highlighting how the use of quantum annealing and a classification algorithm (quantum walk search algorithm) can be implemented for the resolution of a lumped-characteristic analytical model of the heat transfer inside a compact heat exchanger, also in case of two-phase refrigerant fluid, for the use during design phase of environmental control system, e.g. provide the design engineers with a relatively simple and quick to use tool, which provides a reasonable result with an easily interpretable physical meaning. We start with a simple two-phase flow within a single-pass mini-channel heat exchanger, describing the mathematical formulation of the problem followed by a simplified implementation of the proposed quantum approaches, highlighting the main procedures of the calculation as well as the practical implications, advantages and disadvantages of the proposed method, e.g. a limited number of CFD simulations are required to evaluate air side heat transfer coefficient and pressure drop for particular designs within the defined design space, and the specific hardware required to implement the quantum process.