The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
Open accessAbstract
We present the mapping of a class of simplified air traffic management problems (strategic conflict resolution) to quadratic unconstrained Boolean optimization problems. The mapping is performed through an original representation of the conflict-resolution problem in terms of a conflict graph, where the nodes of the graph represent flights and the edges represent a potential conflict between flights. The representation allows a natural decomposition of a real-world instance related to wind-optimal trajectories over the Atlantic Ocean into smaller subproblems that can be discretized and are amenable to be programmed in quantum annealers. In this paper, we tested the new programming techniques, and we benchmark the hardness of the instances using both classical solvers and the D-Wave 2X and D-Wave 2000Q quantum chip. The preliminary results show that for reasonable modeling choices, the most challenging subproblems which are programmable in the current devices are solved to optimality with 99% of probability within a second of annealing time.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“A simplified version of the air-traffic management conflict-resolution problem has been tackled with QA after extraction of feasible subproblems [129].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [129]
Citations
Cites
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (1999) · Nature · doi:10.1038/43601 · Cited by 4,240
A review of conflict detection and resolution modeling methods
Kuchar, J. K., & Lh, Y. (2000) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/6979.898217 · Cited by 1,070
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
Choi, V. (2008) · Quantum Information Processing · doi:10.1007/s11128-008-0082-9 · Cited by 410
A practical heuristic for finding graph minorsPreprint
Cai, J. L., Macready, W. G., & Roy, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.2741 · Cited by 365
(1972) · Mathematics in Science and Engineering/Mathematics in science and engineering · doi:10.1016/s0076-5392(08)x6010-2 · Cited by 341
Halin, R. (1976) · Journal of Geometry · doi:10.1007/bf01917434 · Cited by 265
On non-serial dynamic programming
Bertelè, U., & Brioschi, F. (1973) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(73)90016-2 · Cited by 231
A case study in programming a quantum annealer for hard operational planning problems
Rieffel, E. G., Venturelli, D., O’Gorman, B., Do, M. B., Prystay, E. M., & Smelyanskiy, V. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0892-x · Cited by 221
Self-citationComplexity of Scheduling Shops with No Wait in Process
Sahni, S. K., & Cho, Y. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.4.448 · Cited by 132
Quantum Annealing Implementation of Job-Shop SchedulingPreprint
Venturelli, D., Marchand, D. J. J., & Rojo, G. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.08479 · Cited by 129
Self-citation
Cited by
Sorted by citations
Quantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
A Novel Gate Resource Allocation Method Using Improved PSO-Based QEA
Deng, W., Xu, J., Zhao, H., & Song, Y. (2020) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.3025796 · Cited by 338
Reverse quantum annealing approach to portfolio optimization problems
Venturelli, D., & Kondratyev, A. (2019) · Quantum Machine Intelligence · doi:10.1007/s42484-019-00001-w · Cited by 233
Self-citationBenchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Willsch, D., Willsch, M., Gonzalez Calaza, C. D., Jin, F., De Raedt, H., Svensson, M., & Michielsen, K. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03476-y · Cited by 114
Benchmarking Quantum Annealing Controls with Portfolio Optimization
Grant, E., Humble, T. S., & Stump, B. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.014012 · Cited by 90
Metadata
- Authors
- Stollenwerk, T., O'Gorman, B., Venturelli, D., Mandra, S., Rodionova, O., Ng, H., Sridhar, B., Rieffel, E. G., & Biswas, R.
- Affiliations
- Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR) (DE)
- Ames Research Center (US)
- Venue
- IEEE Transactions on Intelligent Transportation Systems
- Published
- 2020-01
- Volume
- 21
- Issue
- 1
- Pages
- 285-297
- ISSN
- 1524-9050 (ISSN-L)
- 1558-0016
- OpenAlex
- W2769474857
- Cited by
- 129
- References
- 21
- Citations by year
- 2026: 13 · 2025: 15 · 2024: 25 · 2023: 23 · 2022: 12 · 2021: 20 · 2020: 15
- FWCI
- 10.48
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Intelligent Transportation Systems (publishedVersion)
- elib (German Aerospace Center) (acceptedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- NASA Aviation Systems Division
- NASA Advanced Exploration Systems Program
- Ames Research Center
- NASA Academic Mission Services (NNA16BD14C)
- Topics
- Physical Sciences › Engineering › Aerospace Engineering › Air Traffic Management and Optimization
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
- Keywords
- quantum annealing, air traffic management, conflict graph, D-Wave quantum annealer, problem decomposition, benchmarking, combinatorial optimization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
