38 citations · 134 across the 9 of their papers we have counts for
9 papers
Benchmarking Quantum Optimization for the Maximum-Cut Problem on a Superconducting Quantum Computer
Maxime Dupont, Bhuvanesh Sundar, Bram Evert +4
Achieving high-quality solutions faster than classical solvers on computationally hard problems is a challenge for quantum optimization to deliver utility. Using a superconducting…
Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems
Filip B. Maciejewski, Stuart Hadfield, Benjamin Hall +13
We develop a hardware-efficient ansatz for variational optimization, derived from existing ansatze in the literature, that parametrizes subsets of all interactions in the Cost Hami…
Quantum-Enhanced Greedy Combinatorial Optimization Solver
Maxime Dupont, Bram Evert, Mark J. Hodson +13
Combinatorial optimization is a broadly attractive area for potential quantum advantage, but no quantum algorithm has yet made the leap. Noise in quantum hardware remains a challen…
An entanglement perspective on the quantum approximate optimization algorithm
Maxime Dupont, Nicolas Didier, Mark J. Hodson +2
Many quantum algorithms seek to output a specific bitstring solving the problem of interest--or a few if the solution is degenerate. It is the case for the quantum approximate opti…
Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm
Maxime Dupont, Nicolas Didier, Mark J. Hodson +2
Trading fidelity for scale enables approximate classical simulators such as matrix product states (MPS) to run quantum circuits beyond exact methods. A control parameter, the so-ca…
Realization of arbitrary doubly-controlled quantum phase gates
Alexander D. Hill, Mark J. Hodson, Nicolas Didier +1
Developing quantum computers for real-world applications requires understanding theoretical sources of quantum advantage and applying those insights to design more powerful machine…
Practical Verification of Quantum Properties in Quantum Approximate Optimization Runs
M. Sohaib Alam, Filip A. Wudarski, Matthew J. Reagor +7
In order to assess whether quantum resources can provide an advantage over classical computation, it is necessary to characterize and benchmark the non-classical properties of quan…
Finding the optimal Nash equilibrium in a discrete Rosenthal congestion game using the Quantum Alternating Operator Ansatz
Mark Hodson, Brendan Ruck, Hugh Ong +2
This paper establishes the tractability of finding the optimal Nash equilibrium, as well as the optimal social solution, to a discrete congestion game using a gate-model quantum co…
Portfolio rebalancing experiments using the Quantum Alternating Operator Ansatz
Mark Hodson, Brendan Ruck, Hugh Ong +2
This paper investigates the experimental performance of a discrete portfolio optimization problem relevant to the financial services industry on the gate-model of quantum computing…