41 citations · 180 across the 11 of their papers we have counts for
8 papers · 1 filter
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…
Extending relax-and-round combinatorial optimization solvers with quantum correlations
Maxime Dupont, Bhuvanesh Sundar
We introduce a relax-and-round approach embedding the quantum approximate optimization algorithm (QAOA) with layers. We show for many problems, including Sherrington-Kirk…
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…
Multipartite entanglement in the 1-D spin- Heisenberg Antiferromagnet
Varun Menon, Nicholas E. Sherman, Maxime Dupont +3
Multipartite entanglement refers to the simultaneous entanglement between multiple subsystems of a many-body quantum system. While multipartite entanglement can be difficult to qua…
Navigating the noise-depth tradeoff in adiabatic quantum circuits
Daniel Azses, Maxime Dupont, Bram Evert +2
Adiabatic quantum algorithms solve computational problems by slowly evolving a trivial state to the desired solution. On an ideal quantum computer, the solution quality improves mo…
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…