Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Poggel, Benedikt"'
When trying to use quantum-enhanced methods for optimization problems, the sheer number of options inhibits its adoption by industrial end users. Expert knowledge is required for the formulation and encoding of the use case, the selection and adaptat
Externí odkaz:
http://arxiv.org/abs/2409.20496
Autor:
Eichhorn, Domenik, Schweikart, Maximilian, Poser, Nick, Fiand, Frederik, Poggel, Benedikt, Lorenz, Jeanette Miriam
The advent of quantum algorithms has initiated a discourse on the potential for quantum speedups for optimization problems. However, several factors still hinder a practical realization of the potential benefits. These include the lack of advanced, e
Externí odkaz:
http://arxiv.org/abs/2405.09115
In the pursuit of achieving near-term quantum advantage for combinatorial optimization problems, the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) are the primary methods of interest, but their practi
Externí odkaz:
http://arxiv.org/abs/2404.14054
Autor:
Schnaus, Manuel, Palackal, Lilly, Poggel, Benedikt, Runge, Xiomara, Ehm, Hans, Lorenz, Jeanette Miriam, Mendl, Christian B.
Routing problems are a common optimization problem in industrial applications, which occur on a large scale in supply chain planning. Due to classical limitations for solving NP-hard problems, quantum computing hopes to improve upon speed or solution
Externí odkaz:
http://arxiv.org/abs/2404.05448
Autor:
Franco, Nicola, Wollschläger, Tom, Poggel, Benedikt, Günnemann, Stephan, Lorenz, Jeanette Miriam
Emerging quantum computing technologies, such as Noisy Intermediate-Scale Quantum (NISQ) devices, offer potential advancements in solving mathematical optimization problems. However, limitations in qubit availability, noise, and errors pose challenge
Externí odkaz:
http://arxiv.org/abs/2305.00472
Autor:
Palackal, Lilly, Poggel, Benedikt, Wulff, Matthias, Ehm, Hans, Lorenz, Jeanette Miriam, Mendl, Christian B.
Publikováno v:
2023 IEEE International Conference on Quantum Computing and Engineering (QCE), Bellevue, WA, USA, 648-658 (2023)
Many relevant problems in industrial settings result in NP-hard optimization problems, such as the Capacitated Vehicle Routing Problem (CVRP) or its reduced variant, the Travelling Salesperson Problem (TSP). Even with today's most powerful classical
Externí odkaz:
http://arxiv.org/abs/2304.09629
Autor:
Poggel, Benedikt, Quetschlich, Nils, Burgholzer, Lukas, Wille, Robert, Lorenz, Jeanette Miriam
Publikováno v:
2023 IEEE International Conference on Quantum Software (QSW), Chicago, IL, USA, 2023, pp. 60-67
Solving real-world optimization problems with quantum computing requires choosing between a large number of options concerning formulation, encoding, algorithm and hardware. Finding good solution paths is challenging for end users and researchers ali
Externí odkaz:
http://arxiv.org/abs/2212.11127