297 citations · 1.4k across the 44 of their papers we have counts for
5 papers · 1 filter
NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
Rhonda Au-Yeung, Nicholas Chancellor, Pascal Halffmann
In the last decade, public and industrial research funding has moved quantum computing from the early promises of Shor's algorithm through experiments to the era of noisy intermedi…
Suppressing unwanted fluctuations in QAOA and approximate quantum annealing
Touheed Anwar Atif, Catherine Potts, David Haycraft +2
The quantum approximate optimisation algorithm (QAOA) was partially inspired by digitising quantum annealing. Based on this inspiration, we develop techniques to use the additional…
Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
Adam Callison, Nicholas Chancellor
Hybrid quantum-classical algorithms are central to much of the current research in quantum computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era,…
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
Puya Mirkarimi, Adam Callison, Lewis Light +2
An algorithm for a particular problem may find some instances of the problem easier and others harder to solve, even for a fixed input size. We numerically analyse the relative har…
Using copies to improve precision in continuous-time quantum computing
Jemma Bennett, Adam Callison, Tom O'Leary +3
In the quantum optimisation setting, we build on a scheme introduced by Young et al [PRA 88, 062314, 2013], where physical qubits in multiple copies of a problem encoded into an Is…