Quantum-Assisted Space Logistics Mission Planning
Amiratabak Bahengam, Mohammad-Ali Miri, R. Joseph Rupert, Wesley Dyk,, Hao Chen

TL;DR
This paper explores the use of entropy quantum computing to efficiently solve complex space logistics planning problems, which are difficult for classical methods due to exponential solution space growth.
Contribution
It introduces a quantum computing approach to model and solve time-dependent multicommodity network flow problems in space logistics, showcasing its potential advantages.
Findings
Quantum computing can handle large, complex logistics problems.
The approach demonstrates potential for interplanetary mission planning.
Quantum methods outperform classical solutions in complexity handling.
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 entropy 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
