121 citations · 297 across the 5 of their papers we have counts for
5 papers
The Quantum Approximate Optimization Algorithm performance with low entanglement and high circuit depth
Rishi Sreedhar, Pontus Vikstål, Marika Svensson +3
Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide…
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Dennis Willsch, Madita Willsch, Carlos D. Gonzalez Calaza +4
We benchmark the quantum processing units of the largest quantum annealers to date, the 5000+ qubit quantum annealer Advantage and its 2000+ qubit predecessor D-Wave 2000Q, using t…
A Hybrid Quantum-Classical Heuristic to solve large-scale Integer Linear Programs
Marika Svensson, Martin Andersson, Mattias Grönkvist +4
We present a method that integrates any quantum algorithm capable of finding solutions to integer linear programs into the Branch-and-Price algorithm, which is regularly used to so…
Applying the Quantum Approximate Optimization Algorithm to the Tail Assignment Problem
Pontus Vikstål, Mattias Grönkvist, Marika Svensson +3
Airlines today are faced with a number of large scale scheduling problems. One such problem is the tail assignment problem, which is the task of assigning individual aircraft to a…
Improved success probability with greater circuit depth for the quantum approximate optimization algorithm
Andreas Bengtsson, Pontus Vikstål, Christopher Warren +12
Present-day, noisy, small or intermediate-scale quantum processors---although far from fault-tolerant---support the execution of heuristic quantum algorithms, which might enable a…