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:2501.05046 · AIAA SciTech Forum

Quantum-Assisted Space Logistics Mission Planning

Amiratabak Bahengam, Mohammad‐Ali Miri, R. Joseph Rupert, Wesley Dyk, Hao Chen

Published Jan 3, 2025• 0 citations
arXivHTMLPDF

Abstract

Quantum computing provides a novel approach to addressing conventionally intractable issues in large-scale optimization. Space logistics missions require the efficient routing of payloads, spacecraft, and resources across complex networks, often resulting in an exponential growth of the solution space that classical methods cannot efficiently solve. This paper leverages quantum computing to model and solve the space logistics problem as a time-dependent multicommodity network flow, enabling the exploration of large solution spaces. The findings highlight quantum computing's potential to address complex aerospace logistics, demonstrating its suitability for complex interplanetary mission planning.

DOI
10.2514/6.2025-1107

Related papers

Quantum Computing for Supply Chain and Logistics Optimization The Evolution of Computing Technology

Chandra Jaiswal

Quantum computing presents a transformative opportunity for optimizing supply chain and logistics operations by addressing complex combinatorial challenges beyond the capabilities of classical computing. Traditional supply chain optimization relies on heuristic and mathematical models, which struggle with large-scale problems such as vehicle routing, warehouse management, demand forecasting, and last-mile delivery. Quantum computing, leveraging qubits and principles like superposition and entanglement, enables exponential computational power and efficiency. This paper explores quantum computing's applications in logistics, including quantum annealing for route optimization, fleet management, and supply chain network design. Companies like IBM, Google, and D-Wave are advancing quantum algorithms, with hybrid quantum-classical approaches emerging as practical solutions. While large-scale commercial adoption is still in its infancy, research demonstrates promising results in reducing operational costs, improving sustainability, and enhancing decision-making. The study synthesizes over 80 published works on quantum computing's role in logistics, providing insights into emerging technologies, challenges, and future potential. As the field progresses, early adoption and pilot programs will be crucial for businesses to gain a competitive edge in an increasingly complex global supply chain landscape. Quantum computing has the potential to redefine efficiency, cost reduction, and real-time adaptability in logistics and supply chain management.

International Journal of Scientific Research in Computer Science Engineering and Information Technology•Oct 22, 2023•0 citations

Quantum-Inspired Optimization of Large-Scale Logistic Networks

Jincheng Zhang

Large-scale logistic networks present a formidable challenge to traditional optimization techniques. The sheer number of variables and constraints involved—including vehicle routing, shipment scheduling, warehouse operations, and inventory management—often leads to computational bottlenecks, hindering efficient network design and operation. This paper investigates the application of quantum-inspired optimization algorithms to address these challenges. Specifically, we explore the potential of algorithms mimicking quantum phenomena, such as quantum annealing and quantum walks, to efficiently solve complex routing and scheduling problems within large logistic networks. Our approach leverages the inherent parallelism and ability of these algorithms to navigate complex solution spaces, offering a promising alternative to classical methods. We demonstrate the feasibility and potential benefits of this strategy through a theoretical framework and illustrative examples, highlighting the advantages of quantum-inspired optimization for improving the performance of large-scale logistic networks.

•Sep 6, 2026•0 citations

Quantum Algorithms for Optimization Problems in Logistics

Avinash Dhavan, Mehul Manu, P. Suganya +2 more

In this paper, we investigate a quantum approach to solve hard optimization problems of logistics, such as vehicle routing, warehouse scheduling, supply chain planning, etc. Employing quantum computation models, viz., Quantum Approximate Optimization Algorithm (QAOA) as well as hybrid quantum-classical computing framework, the proposed technique overcomes problems of scalability, constraint handling, and performance issues of previous work. The research demonstrates benchmarking on benchmarks, on logistics datasets, and across quantum platforms. We establish that the solution quality and the convergence efficiency were improved by considering the quantum annealing effect, showing that quantum computing is a revolutionary playing card in optimization for logistics.

CRC Press eBooks•Sep 7, 2026•0 citations

Applying Quantum Computing to Solve Multicommodity Network Flow Problem

Chence Niu, Purvi Rastogi, Jaikishan T. Soman +2 more

In this paper, the multicommodity network flow (MCNF) problem is formulated as a mixed integer programming model which is known as NP-hard, aiming to optimize the vehicle routing and minimize the total travel cost. We explore the potential of quantum computing, specifically quantum annealing, by comparing its performance in terms of solution quality and efficiency against the traditional method. Our findings indicate that quantum annealing holds significant promise for enhancing computation in large-scale transportation logistics problems.

IEEE Transactions on Intelligent Transportation Systems•Jan 30, 2025•7 citations

Applying Quantum Computing to Solve Multicommodity Network Flow Problem

Chence Niu, Purvi Rastogi, Jaikishan T. Soman +2 more

In this paper, the multicommodity network flow (MCNF) problem is formulated as a mixed integer programing model which is known as NP-hard, aiming to optimize the vehicle routing and minimize the total travel cost. We explore the potential of quantum computing, specifically quantum annealing, by comparing its performance in terms of solution quality and efficiency against the traditional method. Our findings indicate that quantum annealing holds significant promise for enhancing computation in large-scale transportation logistics problems.

arXiv:2402.04758•Feb 7, 2024•1 citation

Challenges and Future Prospects of Integrating Quantum Computing Into Intelligent Transportation Systems

Aradhana Behura, Radhashyam Patra

Quantum computing holds transformative potential for Intelligent Transportation Systems (ITS), offering solutions to complex and computationally intensive challenges in modern transportation networks. By leveraging quantum mechanics principles like superposition and entanglement, quantum algorithms can optimize traffic management, route planning, and logistics with unprecedented speed and accuracy. This can significantly enhance real-time traffic flow predictions, dynamic route optimization, and efficient resource allocation, particularly for electric vehicle networks, promoting sustainable and energy-efficient transportation solutions. However, integrating quantum computing into ITS faces challenges. Current quantum hardware is limited by issues like qubit instability, short coherence times, and high error rates, impeding large-scale applications. Additionally, developing hybrid systems that combine classical and quantum computing capabilities, and ensuring robust data privacy and security, are significant hurdles.

Advances in mechatronics and mechanical engineering (AMME) book series•Oct 29, 2024•6 citations
Quantum computing provides a novel approach to addressing conventionally intractable issues in large-scale optimization. Space logistics missions require the efficient routing of payloads, spacecraft, and resources across complex networks, often resulting in an exponential growth of the solution space that classical methods cannot efficiently solve. This paper leverages quantum computing to model and solve the space logistics problem as a time-dependent multicommodity network flow, enabling the exploration of large solution spaces. The findings highlight quantum computing's potential to address complex aerospace logistics, demonstrating its suitability for complex interplanetary mission planning.
Quantum computing presents a transformative opportunity for optimizing supply chain and logistics operations by addressing complex combinatorial challenges beyond the capabilities of classical computing. Traditional supply chain optimization relies on heuristic and mathematical models, which struggle with large-scale problems such as vehicle routing, warehouse management, demand forecasting, and last-mile delivery. Quantum computing, leveraging qubits and principles like superposition and entanglement, enables exponential computational power and efficiency. This paper explores quantum computing's applications in logistics, including quantum annealing for route optimization, fleet management, and supply chain network design. Companies like IBM, Google, and D-Wave are advancing quantum algorithms, with hybrid quantum-classical approaches emerging as practical solutions. While large-scale commercial adoption is still in its infancy, research demonstrates promising results in reducing operational costs, improving sustainability, and enhancing decision-making. The study synthesizes over 80 published works on quantum computing's role in logistics, providing insights into emerging technologies, challenges, and future potential. As the field progresses, early adoption and pilot programs will be crucial for businesses to gain a competitive edge in an increasingly complex global supply chain landscape. Quantum computing has the potential to redefine efficiency, cost reduction, and real-time adaptability in logistics and supply chain management.
Large-scale logistic networks present a formidable challenge to traditional optimization techniques. The sheer number of variables and constraints involved—including vehicle routing, shipment scheduling, warehouse operations, and inventory management—often leads to computational bottlenecks, hindering efficient network design and operation. This paper investigates the application of quantum-inspired optimization algorithms to address these challenges. Specifically, we explore the potential of algorithms mimicking quantum phenomena, such as quantum annealing and quantum walks, to efficiently solve complex routing and scheduling problems within large logistic networks. Our approach leverages the inherent parallelism and ability of these algorithms to navigate complex solution spaces, offering a promising alternative to classical methods. We demonstrate the feasibility and potential benefits of this strategy through a theoretical framework and illustrative examples, highlighting the advantages of quantum-inspired optimization for improving the performance of large-scale logistic networks.
In this paper, we investigate a quantum approach to solve hard optimization problems of logistics, such as vehicle routing, warehouse scheduling, supply chain planning, etc. Employing quantum computation models, viz., Quantum Approximate Optimization Algorithm (QAOA) as well as hybrid quantum-classical computing framework, the proposed technique overcomes problems of scalability, constraint handling, and performance issues of previous work. The research demonstrates benchmarking on benchmarks, on logistics datasets, and across quantum platforms. We establish that the solution quality and the convergence efficiency were improved by considering the quantum annealing effect, showing that quantum computing is a revolutionary playing card in optimization for logistics.
In this paper, the multicommodity network flow (MCNF) problem is formulated as a mixed integer programming model which is known as NP-hard, aiming to optimize the vehicle routing and minimize the total travel cost. We explore the potential of quantum computing, specifically quantum annealing, by comparing its performance in terms of solution quality and efficiency against the traditional method. Our findings indicate that quantum annealing holds significant promise for enhancing computation in large-scale transportation logistics problems.
In this paper, the multicommodity network flow (MCNF) problem is formulated as a mixed integer programing model which is known as NP-hard, aiming to optimize the vehicle routing and minimize the total travel cost. We explore the potential of quantum computing, specifically quantum annealing, by comparing its performance in terms of solution quality and efficiency against the traditional method. Our findings indicate that quantum annealing holds significant promise for enhancing computation in large-scale transportation logistics problems.
Quantum computing holds transformative potential for Intelligent Transportation Systems (ITS), offering solutions to complex and computationally intensive challenges in modern transportation networks. By leveraging quantum mechanics principles like superposition and entanglement, quantum algorithms can optimize traffic management, route planning, and logistics with unprecedented speed and accuracy. This can significantly enhance real-time traffic flow predictions, dynamic route optimization, and efficient resource allocation, particularly for electric vehicle networks, promoting sustainable and energy-efficient transportation solutions. However, integrating quantum computing into ITS faces challenges. Current quantum hardware is limited by issues like qubit instability, short coherence times, and high error rates, impeding large-scale applications. Additionally, developing hybrid systems that combine classical and quantum computing capabilities, and ensuring robust data privacy and security, are significant hurdles.