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

Intelligent Technologies and Electronic Devices in Vehicle and Road Transport Complex (TIRVED)

Optimizing Traffic Flow Using Quantum Annealing

Vladimir Anatolievich Bogatyrev, V. S. Moskvin

Published Nov 13, 2024• 1 citation
Publisher

Abstract

This paper investigates the use of quantum annealing for optimizing traffic flow, serving as a case study for broader applications in network optimization tasks. We start by modeling the traffic network as a quantum system, where intersections, roads, and traffic parameters are represented as qubits within a quantum annealing framework. The optimization process is outlined, illustrating how the quantum system evolves to identify low-energy states that correspond to optimal traffic flow configurations. By harnessing the unique properties of quantum mechanics, such as superposition and quantum tunneling, quantum annealing has the potential to efficiently explore extensive solution spaces beyond the capabilities of classical algorithms. This research aims to expand the understanding of how quantum computing can be applied to complex network optimization challenges, providing insights that could lead to more efficient, responsive, and sustainable management systems across various domains.

DOI
10.1109/tirved63561.2024.10769819

Related papers

Review of the application of quantum annealing-related technologies in transportation optimization

Marwan Qaid Mohammed, Henri Meeß, Maximilian Otte

Abstract Traffic optimization remains a significant challenge in urban planning and transportation management. While efficient traffic optimization is crucial for enhancing urban mobility, reducing congestion, and promoting environmental sustainability, traditional computational methods often struggle with the complex, dynamic nature of traffic systems. Recent advances in quantum computing, particularly quantum annealing, offer promising new techniques that could revolutionize traffic flow optimization. This work systematically reviews the literature, starting with search term formulation and ending with the final set of articles. These articles are categorized into three groups: (1) traffic signal control, (2) traffic flow optimization, and (3) routing problems optimization (including vehicle routing problem and traveling salesman problem). The review critically examines current studies on quantum annealing-based traffic optimization, focusing on contributions, methods, solvers, problem suitability, key findings, benchmark fairness, and limitations. It identifies key challenges and provides recommendations for future research. Insights from this work offer researchers and practitioners a concise overview of current challenges and future directions in traffic optimization.

Quantum Information Processing•Sep 2, 2025•17 citations

Quantum Annealing for Combinatorial Optimization in Large-Scale Network Routing

Jincheng Zhang

This paper investigates the application of quantum annealing to address the challenges of combinatorial optimization within large-scale network routing. Traditional classical algorithms frequently encounter significant computational bottlenecks when attempting to determine optimal routes across complex networks, often failing to scale effectively with increasing network size and complexity. Quantum annealing offers a potentially transformative approach by leveraging quantum mechanical effects to explore solution spaces more efficiently. This work outlines a methodology for mapping network routing problems – characterized by a vast number of possible routes – onto the quantum annealing hardware. We present a model for representing the problem, formulating it as an Ising model, and then detail the annealing process. The core claim is that quantum annealing can provide a viable solution for optimizing network routes, particularly in scenarios where classical methods are computationally intractable. We explore the underlying principles of quantum annealing, focusing on its ability to escape local minima and achieve a lower energy state, representing the optimal solution. The research aims to demonstrate the feasibility and potential advantages of employing quantum annealing in practical network routing applications, paving the way for more efficient and robust network designs.

•Sep 7, 2026•0 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

Optimizing traffic flow using quantum annealing and classical machine learning

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 the 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 applications. 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.

•Aug 4, 2017•1 citation

Mini-scale traffic flow optimization: an iterative QUBOs approach converting from hybrid solver to pure quantum processing unit

Hadi Salloum, Sanzhar Zhanalin, Amer Al Badr +1 more

Traffic congestion continues to pose a significant challenge in urban environments, necessitating innovative approaches to traffic management. This paper explores the application of Quantum Annealing (QA) for real-world traffic optimization, expanding on the pioneering work of Volkswagen and D-Wave. In 2017, a collaborative team demonstrated the potential of QA to optimize traffic flow by solving a complex Quadratic Unconstrained Binary Optimization (QUBO) problem involving 418 cars, which required 1,254 qubits. Later, this research culminated in a pilot project at the Web Summit conference in Lisbon, one of Europe's largest technology events, showcasing quantum computing-based traffic optimization. Since the QPU alone could not directly handle the full problem size, the team employed a hybrid classical-quantum approach, leading to significant improvements in traffic distribution. This paper builds on that foundation by investigating potential speedups using a purely quantum approach, particularly by utilizing the QPU for smaller QUBO problems. The proposed method (MTF) enhances traffic management by decomposing the overall optimization problem into smaller, more manageable subproblems. This decomposition enables us to harness the advantages of the QPU while tackling more complex traffic scenarios that previous approaches struggled to manage. By breaking the problem into smaller parts, we mitigate the challenges associated with embedding large-scale problems into the QPU, which often presents computational difficulties. To evaluate our approach, we conducted experiments involving 100, 200, 300, 400, and 500 cars on a complex traffic map featuring multiple start and end points. We successfully embedded the problem into the D-Wave Advantage Quantum Processing Unit, utilizing the "Pegasus" topology, which resulted in a significant acceleration of the solution process. The experiment results show improved speed and effectiveness in real-world scenarios by leveraging the QPU for better traffic optimization.

Scientific Reports•Jul 1, 2025•20 citations

Based on Scalable Quantum Annealing for Combinatorial Optimization Algorithms

Jincheng Zhang

This paper investigates the application of scalable quantum annealing to solve computationally challenging combinatorial optimization problems. The core idea is to map these problems into a quantum annealing framework, leveraging quantum tunneling to efficiently explore the solution space and ultimately converge to the global optimum. The research addresses the existing limitations in the scalability of quantum annealing, proposing a novel approach to tackle NP-hard problems effectively. We will demonstrate the potential of this methodology through a theoretical analysis and formulation of the quantum annealing algorithm, focusing on key parameters and their impact on solution quality and runtime. The ultimate goal is to provide a foundational understanding of applying quantum annealing to combinatorial optimization, paving the way for future developments and practical implementations. This work introduces a new framework for approaching complex optimization problems by harnessing the unique properties of quantum mechanics.

•Sep 5, 2026•0 citations
This paper investigates the use of quantum annealing for optimizing traffic flow, serving as a case study for broader applications in network optimization tasks. We start by modeling the traffic network as a quantum system, where intersections, roads, and traffic parameters are represented as qubits within a quantum annealing framework. The optimization process is outlined, illustrating how the quantum system evolves to identify low-energy states that correspond to optimal traffic flow configurations. By harnessing the unique properties of quantum mechanics, such as superposition and quantum tunneling, quantum annealing has the potential to efficiently explore extensive solution spaces beyond the capabilities of classical algorithms. This research aims to expand the understanding of how quantum computing can be applied to complex network optimization challenges, providing insights that could lead to more efficient, responsive, and sustainable management systems across various domains.
Abstract Traffic optimization remains a significant challenge in urban planning and transportation management. While efficient traffic optimization is crucial for enhancing urban mobility, reducing congestion, and promoting environmental sustainability, traditional computational methods often struggle with the complex, dynamic nature of traffic systems. Recent advances in quantum computing, particularly quantum annealing, offer promising new techniques that could revolutionize traffic flow optimization. This work systematically reviews the literature, starting with search term formulation and ending with the final set of articles. These articles are categorized into three groups: (1) traffic signal control, (2) traffic flow optimization, and (3) routing problems optimization (including vehicle routing problem and traveling salesman problem). The review critically examines current studies on quantum annealing-based traffic optimization, focusing on contributions, methods, solvers, problem suitability, key findings, benchmark fairness, and limitations. It identifies key challenges and provides recommendations for future research. Insights from this work offer researchers and practitioners a concise overview of current challenges and future directions in traffic optimization.
This paper investigates the application of quantum annealing to address the challenges of combinatorial optimization within large-scale network routing. Traditional classical algorithms frequently encounter significant computational bottlenecks when attempting to determine optimal routes across complex networks, often failing to scale effectively with increasing network size and complexity. Quantum annealing offers a potentially transformative approach by leveraging quantum mechanical effects to explore solution spaces more efficiently. This work outlines a methodology for mapping network routing problems – characterized by a vast number of possible routes – onto the quantum annealing hardware. We present a model for representing the problem, formulating it as an Ising model, and then detail the annealing process. The core claim is that quantum annealing can provide a viable solution for optimizing network routes, particularly in scenarios where classical methods are computationally intractable. We explore the underlying principles of quantum annealing, focusing on its ability to escape local minima and achieve a lower energy state, representing the optimal solution. The research aims to demonstrate the feasibility and potential advantages of employing quantum annealing in practical network routing applications, paving the way for more efficient and robust network designs.
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 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 the 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 applications. 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.
Traffic congestion continues to pose a significant challenge in urban environments, necessitating innovative approaches to traffic management. This paper explores the application of Quantum Annealing (QA) for real-world traffic optimization, expanding on the pioneering work of Volkswagen and D-Wave. In 2017, a collaborative team demonstrated the potential of QA to optimize traffic flow by solving a complex Quadratic Unconstrained Binary Optimization (QUBO) problem involving 418 cars, which required 1,254 qubits. Later, this research culminated in a pilot project at the Web Summit conference in Lisbon, one of Europe's largest technology events, showcasing quantum computing-based traffic optimization. Since the QPU alone could not directly handle the full problem size, the team employed a hybrid classical-quantum approach, leading to significant improvements in traffic distribution. This paper builds on that foundation by investigating potential speedups using a purely quantum approach, particularly by utilizing the QPU for smaller QUBO problems. The proposed method (MTF) enhances traffic management by decomposing the overall optimization problem into smaller, more manageable subproblems. This decomposition enables us to harness the advantages of the QPU while tackling more complex traffic scenarios that previous approaches struggled to manage. By breaking the problem into smaller parts, we mitigate the challenges associated with embedding large-scale problems into the QPU, which often presents computational difficulties. To evaluate our approach, we conducted experiments involving 100, 200, 300, 400, and 500 cars on a complex traffic map featuring multiple start and end points. We successfully embedded the problem into the D-Wave Advantage Quantum Processing Unit, utilizing the "Pegasus" topology, which resulted in a significant acceleration of the solution process. The experiment results show improved speed and effectiveness in real-world scenarios by leveraging the QPU for better traffic optimization.
This paper investigates the application of scalable quantum annealing to solve computationally challenging combinatorial optimization problems. The core idea is to map these problems into a quantum annealing framework, leveraging quantum tunneling to efficiently explore the solution space and ultimately converge to the global optimum. The research addresses the existing limitations in the scalability of quantum annealing, proposing a novel approach to tackle NP-hard problems effectively. We will demonstrate the potential of this methodology through a theoretical analysis and formulation of the quantum annealing algorithm, focusing on key parameters and their impact on solution quality and runtime. The ultimate goal is to provide a foundational understanding of applying quantum annealing to combinatorial optimization, paving the way for future developments and practical implementations. This work introduces a new framework for approaching complex optimization problems by harnessing the unique properties of quantum mechanics.