Exécution de notre outil de synthèse sur un nouvel article
Vérifiez l’article ci-dessous, puis lancez sa synthèse.
Quantum Optimization: Potential, Challenges, and the Path Forward
Amira Abbas (QuSoft, University of Amsterdam), USDOE National Nuclear Security Administration (NNSA) (University of Latvia), Andris Ambainis (Massachusetts Institute of Technology, University of Latvia), Brandon Augustino (Los Alamos National Laboratory, Massachusetts Institute of Technology), Andreas Bärtschi (Los Alamos National Laboratory, QuSoft), Harry Buhrman (Los Alamos National Laboratory, QuSoft), Carleton Coffrin (Los Alamos National Laboratory, E.ON (Germany)), G. Cortiana (Leiden University, E.ON (Germany)), Vedran Dunjko (Leiden University, IBM Research - Zurich), Daniel Egger (IBM (United States), IBM Research - Zurich), Bruce Elmegreen (IBM (United States), Fraunhofer Institute for Cognitive Systems), Nicola Franco (Fraunhofer Institute for Cognitive Systems), F. Fratini (IBM (United States), IBM Research - Thomas J. Watson Research Center), Bryce Fuller (IBM (United States), IBM Research - Thomas J. Watson Research Center), Julien Gacon (IBM (United States), Wells Fargo (United States)), Constantin Gonciulea (Wells Fargo (United States), Tilburg University), Sander Gribling (Tilburg University, Massachusetts Institute of Technology), Swati Gupta (Ames Research Center, Research Institute for Advanced Computer Science), Stuart Hadfield (Ames Research Center, Research Institute for Advanced Computer Science), Raoul Heese (Fraunhofer Institute for Industrial Mathematics), Gerhard Kircher, Thomas Kleinert (Zuse Institute Berlin, Technische Universität Berlin), Thorsten Koch (Zuse Institute Berlin, HSBC Holdings), Georgios Korpas (HSBC Holdings, Fraunhofer Institute of Optronics, System Technologies and Image Exploitation), Steve Lenk (Fraunhofer Institute of Optronics, System Technologies and Image Exploitation, Czech Technical University in Prague), Jakub Mareček (Wells Fargo (United States), Czech Technical University in Prague), Vanio Markov (Wells Fargo (United States), University of Zurich), Guglielmo Mazzola (Science and Technology Facilities Council, University of Zurich), Stefano Mensa (E.ON (Germany), Science and Technology Facilities Council), Naeimeh Mohseni (University of Southern California, E.ON (Germany)), Giacomo Nannicini (University of Southern California, E.ON (Germany)), Corey O’Meara (E.ON (Germany), IBM Research - Zurich), Elena Peña Tapia (Zuse Institute Berlin, IBM Research - Zurich), Sebastian Pokutta (Zuse Institute Berlin, IBM Research - Zurich), Manuel Proissl (Centre for Quantum Technologies, National University of Singapore), Patrick Rebentrost (Centre for Quantum Technologies, Science and Technology Facilities Council), Emre Sahin (Science and Technology Facilities Council), Benjamin C. B. Symons (Science and Technology Facilities Council, Universität der Bundeswehr München), Sabine Tornow (Universität der Bundeswehr München, IBM (Ireland)), Víctor Valls (IBM (Ireland), IBM Research - Zurich), Stefan Woerner (IBM Research - Zurich), Mira Luca Wolf-Bauwens (University of Waterloo, IBM Research - Zurich), Jon Yard (Volkswagen Group (Germany), University of Waterloo), Sheir Yarkoni (Volkswagen Group (Germany)), Dirk Zechiel (IBM (Ireland)), Sergiy Zhuk (IBM (Ireland), IBM Research - Zurich), Christa Zoufal (IBM Research - Zurich)
Résumé : Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of algorithmic approaches, often with little linkage. This is further complicated by the fragmented nature of the field of mathematical optimization, where major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions, have devoted communities. With these aspects in mind, this work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory — highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domainsmore » – finance and sustainability – as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.« less