4 papers · 1 filter
Unsupervised strategies for identifying optimal parameters in Quantum Approximate Optimization Algorithm
Charles Moussa, Hao Wang, Thomas Bäck +1
As combinatorial optimization is one of the main quantum computing applications, many methods based on parameterized quantum circuits are being developed. In general, a set of para…
Tabu-driven Quantum Neighborhood Samplers
Charles Moussa, Hao Wang, Henri Calandra +2
Combinatorial optimization is an important application targeted by quantum computing. However, near-term hardware constraints make quantum algorithms unlikely to be competitive whe…
To quantum or not to quantum: towards algorithm selection in near-term quantum optimization
Charles Moussa, Henri Calandra, Vedran Dunjko
The Quantum Approximate Optimization Algorithm (QAOA) constitutes one of the often mentioned candidates expected to yield a quantum boost in the era of near-term quantum computing.…
Function Maximization with Dynamic Quantum Search
Charles Moussa, Henri Calandra, Travis S. Humble
Finding the maximum value of a function in a dynamic model plays an important role in many application settings, including discrete optimization in the presence of hard constraints…