EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1494. Discrete Optimization: A Quantum Revolution?
Invited abstract in session MC-42: Quantum Computing for Discrete and Combinatorial Optimization, stream Quantum Computing Optimization.
Monday, 12:30-14:00Room: 98 (building: 306)
Authors (first author is the speaker)
| 1. | Stefan Creemers
|
| UCLouvain | |
| 2. | Luis Perez
|
| Operations Management, IESEG |
Abstract
We use Grover’s algorithm to build quantum algorithms that can be used to solve discrete optimization problems on a universal quantum computer. We use our quantum algorithms to solve the binary knapsack problem, and highlight a number of challenges that are faced when effectively using Grover’s algorithm to solve discrete optimization problems. We also present a number of procedures that can match the performance of the best classical procedures for solving the binary knapsack problem and demonstrate that quantum computing may cause a revolution in the field of discrete optimization.
Keywords
- Combinatorial Optimization
- Computer Science/Applications
Status: accepted
Back to the list of papers