001     1051617
005     20260116204431.0
024 7 _ |a 10.1109/QCE65121.2025.00235
|2 doi
037 _ _ |a FZJ-2026-00539
100 1 _ |a Onah, Chinonso
|0 P:(DE-HGF)0
|b 0
111 2 _ |a 2025 IEEE International Conference on Quantum Computing and Engineering (QCE)
|c Albuquerque
|d 2025-08-30 - 2025-09-05
|w NM
245 _ _ |a QUEST: QUantum-Enhanced Shared Transportation
260 _ _ |a Albuquerque, NM, USA
|c 2025
|b IEEE
300 _ _ |a 2149 - 2160
336 7 _ |a CONFERENCE_PAPER
|2 ORCID
336 7 _ |a Conference Paper
|0 33
|2 EndNote
336 7 _ |a INPROCEEDINGS
|2 BibTeX
336 7 _ |a conferenceObject
|2 DRIVER
336 7 _ |a Output Types/Conference Paper
|2 DataCite
336 7 _ |a Contribution to a conference proceedings
|b contrib
|m contrib
|0 PUB:(DE-HGF)8
|s 1768573657_26728
|2 PUB:(DE-HGF)
520 _ _ |a We introduce “Windbreaking-as-a-Service” (WaaS) as an innovative approach to shared transportation in which larger “windbreaker” vehicles provide aerodynamic shelter for “windsurfer” vehicles, thereby reducing drag and energy consumption. As a computational framework to solve the largescale matching and assignment problems that arise in WaaS, we present QUEST (Quantum-Enhanced Shared Transportation). Specifically, wef ormulate t he p airing of windbreakers and windsurfers - subject to timing, speed, and vehicle-class constraints - as a mixed-integer quadratic problem (MIQP). Focusing on a single-segment prototype, we verify the solution classically via the Hungarian Algorithm, a Gurobi-based solver, and brute-force enumeration of binary vectors. We then encode the problem as a Quadratic Unconstrained Binary Optimization (QUBO) and map it to an Ising Hamiltonian, enabling the use of the Quantum Approximate Optimization Algorithm (QAOA) and other quantum and classical annealing technologies. Our quantum implementation successfully recovers the optimal assignment identified by the classical methods, c onfirming the so undness of the QUEST pipeline for a controlled prototype. While QAOA and other quantum heuristics do not guarantee a resolution of the fundamental complexity barriers, this study illustrates how the WaaS problem can be systematically translated into a quantumready model. It also lays the groundwork for addressing multisegment scenarios and potentially leveraging quantum advantage for large-scale shared-transportation instances.
536 _ _ |a 5111 - Domain-Specific Simulation & Data Life Cycle Labs (SDLs) and Research Groups (POF4-511)
|0 G:(DE-HGF)POF4-5111
|c POF4-511
|f POF IV
|x 0
588 _ _ |a Dataset connected to CrossRef Conference
700 1 _ |a Misciasci, Neel
|0 P:(DE-HGF)0
|b 1
700 1 _ |a Othmer, Carsten
|0 P:(DE-HGF)0
|b 2
700 1 _ |a Michielsen, Kristel
|0 P:(DE-Juel1)138295
|b 3
|u fzj
770 _ _ |z 979-8-3315-5736-2
773 _ _ |a 10.1109/QCE65121.2025.00235
856 4 _ |u https://juser.fz-juelich.de/record/1051617/files/QUEST_QUantum-Enhanced_Shared_Transportation.pdf
|y Restricted
909 C O |o oai:juser.fz-juelich.de:1051617
|p VDB
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 3
|6 P:(DE-Juel1)138295
913 1 _ |a DE-HGF
|b Key Technologies
|l Engineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action
|1 G:(DE-HGF)POF4-510
|0 G:(DE-HGF)POF4-511
|3 G:(DE-HGF)POF4
|2 G:(DE-HGF)POF4-500
|4 G:(DE-HGF)POF
|v Enabling Computational- & Data-Intensive Science and Engineering
|9 G:(DE-HGF)POF4-5111
|x 0
920 _ _ |l yes
920 1 _ |0 I:(DE-Juel1)JSC-20090406
|k JSC
|l Jülich Supercomputing Center
|x 0
980 _ _ |a contrib
980 _ _ |a VDB
980 _ _ |a I:(DE-Juel1)JSC-20090406
980 _ _ |a UNRESTRICTED


LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21