{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T19:56:26Z","timestamp":1770148586481,"version":"3.49.0"},"reference-count":25,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T00:00:00Z","timestamp":1656288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Quantum computing has the potential to revolutionize the way hard computational problems are solved in terms of speed and accuracy. Quantum hardware is an active area of research and different hardware platforms are being developed. Quantum algorithms target each hardware implementation and bring advantages to specific applications. The focus of this paper is to compare how well quantum annealing techniques and the QAOA models constrained optimization problems. As a use case, a constrained optimization problem called mission covering optimization is used. Quantum annealing is implemented in adiabatic hardware such as D-Wave, and QAOA is implemented in gate-based hardware such as IBM. This effort provides results in terms of cost, timing, constraints held, and qubits used.<\/jats:p>","DOI":"10.3390\/a15070224","type":"journal-article","created":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T22:31:14Z","timestamp":1656369074000},"page":"224","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Quantum Computing Approaches for Mission Covering Optimization"],"prefix":"10.3390","volume":"15","author":[{"given":"Massimiliano","family":"Cutugno","sequence":"first","affiliation":[{"name":"Air Force Research Lab, Information Directorate, Rome, NY 13441, USA"}]},{"given":"Annarita","family":"Giani","sequence":"additional","affiliation":[{"name":"GE Research, General Electric, Niskayuna, NY 12309, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0467-5200","authenticated-orcid":false,"given":"Paul","family":"Alsing","sequence":"additional","affiliation":[{"name":"Air Force Research Lab, Information Directorate, Rome, NY 13441, USA"}]},{"given":"Laura","family":"Wessing","sequence":"additional","affiliation":[{"name":"Air Force Research Lab, Information Directorate, Rome, NY 13441, USA"}]},{"given":"Austar","family":"Schnore","sequence":"additional","affiliation":[{"name":"GE Research, General Electric, Niskayuna, NY 12309, USA"}]}],"member":"1968","published-online":{"date-parts":[[2022,6,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"eabb2823","DOI":"10.1126\/science.abb2823","article-title":"Materials Challenges and Opportunities for Quantum Computing Hardware","volume":"372","author":"Itoh","year":"2021","journal-title":"Science"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Weidenfeller, J., Valor, L.C., Gacon, J., Tornow, C., Bello, L., Woerner, S., and Egger, D.J. (2022). Scaling of the Quantum Approximate Optimization Algorithm on Superconducting Qubit based Hardware. arXiv.","DOI":"10.22331\/q-2022-12-07-870"},{"key":"ref_3","first-page":"197","article-title":"Quantum Algorithms and Circuits for Scientific Computing","volume":"16","author":"Bhaskar","year":"2021","journal-title":"Quantum Inf. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"100754","DOI":"10.1016\/j.coche.2021.100754","article-title":"Quantum Computing for Chemical and Biomolecular Product Design","volume":"36","author":"Andersson","year":"2022","journal-title":"Curr. Opin. Chem. Eng."},{"key":"ref_5","first-page":"4545","article-title":"Novel Quantum Algorithms to Minimize Switching Functions Based on Graph Partitions","volume":"70","author":"Gao","year":"2022","journal-title":"Comput. Mater. Contin."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Phillipson, F., and Chiscop, I. (2021). ultimodal Container Planning: A QUBO Formulation and Implementation on a Quantum Annealer. InInternational Conference on Computational Science 2021, Springer.","DOI":"10.1007\/978-3-030-77980-1_3"},{"key":"ref_7","first-page":"961","article-title":"A research survey: Review of AI solution strategies of job shop scheduling problem","volume":"26","author":"Bulkan","year":"2013","journal-title":"J. Intell. Manuf."},{"key":"ref_8","unstructured":"Venturelli, D., Marchand, D.J.J., and Rojo, G.H. (2016). Job Shop Scheduling Solver Based on Quantum Annealing, Association for the Advancement of Artificial Intelligence Constraint Satisfaction techniques for planning and Scheduling (COPLAS)."},{"key":"ref_9","first-page":"3782","article-title":"Bees Algorithm for Generalized Assignment Problem","volume":"215","author":"Tapkan","year":"2010","journal-title":"Appl. Math. Comput."},{"key":"ref_10","first-page":"123","article-title":"A Survey of the Generalized Assignment Problem and Its Applications","volume":"45","year":"2007","journal-title":"Inf. Syst. Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1287\/inte.33.1.5.12720","article-title":"A New Era for Crew Recovery at Continental Airlines","volume":"33","author":"Yu","year":"2003","journal-title":"Interfaces"},{"key":"ref_12","unstructured":"Schnore, G. (2022, March 31). Quantum Annealing for Asset Sustainment. Available online: https:\/\/www.dwavesys.com\/media\/prsl42qn\/ge-research-asset-sustainment-2019-qubits-europe_0.pdf."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Ng, X.W. (2022). Complex Optimization Problems. Concise Guide to Optimization Models and Methods: A Problem-Based Test Prep for Students, Springer.","DOI":"10.1007\/978-3-030-84417-2"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Das, A., and Chakrabarti, B.K. (2005). Quantum Annealing and Related Optimization Methods, Springer.","DOI":"10.1007\/11526216"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","article-title":"The Unconstrained Binary Quadratic Programming Problem: A Survey","volume":"28","author":"Kochenberger","year":"2014","journal-title":"J. Comb. Optim."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Glover, F., and Kochenberger, G. (2019). A Tutorial on Formulating and Using QUBO Models. arXiv.","DOI":"10.1007\/s10288-019-00424-y"},{"key":"ref_17","unstructured":"Farhi, E., Goldstone, J., and Gutmann, S. (2019). A Quantum Approximate Optimization Algorithm. arXiv."},{"key":"ref_18","unstructured":"Community, T.J.B. (2022, June 07). Solving Combinatorial Optimization Problems Using QAOA. Available online: https:\/\/qiskit.org\/textbook\/ch-applications\/qaoa.html."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"034007","DOI":"10.1103\/PhysRevApplied.5.034007","article-title":"Quantum Annealing for Constrained Optimization","volume":"5","author":"Hen","year":"2016","journal-title":"Phys. Rev. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Hadfield, S., Wang, Z., O\u2019Gorman, B., Rieffel, E.G., Biswas, R., and Venturelli, D. (2019). From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz. Algorithms, 12.","DOI":"10.3390\/a12020034"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","article-title":"Quantum Annealing in the Transverse Ising model","volume":"58","author":"Kadowaki","year":"1998","journal-title":"Phys. Rev. E"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"042412","DOI":"10.1103\/PhysRevA.103.042412","article-title":"Quantum Algorithms with Local Particle-Number Conservation: Noise effects and Error Correction","volume":"103","author":"Streif","year":"2021","journal-title":"Phys. Rev. A"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"428","DOI":"10.22331\/q-2021-04-08-428","article-title":"Grover Adaptive Search for Constrained Polynomial Binary Optimization","volume":"5","author":"Gilliam","year":"2021","journal-title":"Quantum"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"015021","DOI":"10.1088\/2058-9565\/ac3e54","article-title":"Filtering Variational Quantum Algorithms for Combinatorial optimization","volume":"7","author":"Amaro","year":"2022","journal-title":"Quantum Sci. Technol."},{"key":"ref_25","first-page":"424","article-title":"Bang-bang Control as a Design Principle for Classical and Quantum Optimization Algorithms","volume":"19","author":"Bapat","year":"2019","journal-title":"Quantum Inf. Comput."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/7\/224\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:38:57Z","timestamp":1760139537000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/7\/224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,27]]},"references-count":25,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["a15070224"],"URL":"https:\/\/doi.org\/10.3390\/a15070224","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,27]]}}}