366 citations · 2k across the 43 of their papers we have counts for
6 papers · 1 filter
Optimizing Variational Circuits for Higher-Order Binary Optimization
Zoé Verchère, Sourour Elloumi, Andrea Simonetto
Variational quantum algorithms have been advocated as promising candidates to solve combinatorial optimization problems on near-term quantum computers. Their methodology involves t…
Sketching the Best Approximate Quantum Compiling Problem
Liam Madden, Albert Akhriev, Andrea Simonetto
This paper considers the problem of quantum compilation from an optimization perspective by fixing a circuit structure of CNOTs and rotation gates then optimizing over the rotation…
A Quantum Algorithm for the Sub-Graph Isomorphism Problem
Nicola Mariella, Andrea Simonetto
We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency…
Best Approximate Quantum Compiling Problems
Liam Madden, Andrea Simonetto
We study the problem of finding the best approximate circuit that is the closest (in some pertinent metric) to a target circuit, and which satisfies a number of hardware constraint…
Quantum Computing for Finance: State of the Art and Future Prospects
Daniel J. Egger, Claudio Gambella, Jakub Marecek +6
This article outlines our point of view regarding the applicability, state-of-the-art, and potential of quantum computing for problems in finance. We provide an introduction to qua…
Multi-block ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
Claudio Gambella, Andrea Simonetto
Solving combinatorial optimization problems on current noisy quantum devices is currently being advocated for (and restricted to) binary polynomial optimization with equality const…