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 optimization …

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 Hamiltonian …

A frequent starting point of quantum computation platforms is the two-state quantum system,
ie, the qubit. However, in the context of integer optimization problems, relevant to scheduling …

The trading of fidelity for scale enables approximate classical simulators such as matrix
product states (MPSs) to run quantum circuits beyond exact methods. A control parameter …

Quantum computing is one of the most enticing computational paradigms with the potential
to revolutionize diverse areas of future-generation computational systems. While quantum …

The Quantum Approximate Optimisation Algorithm (qaoa) is a widely studied quantum-
classical iterative heuristic for combinatorial optimisation. While qaoa targets problems in …

Quantum computing and quantum algorithms have been said to be able to provide
significant speed-up over classical computation with classical algorithms by exploiting the …

• Led a project to numerically test if the Quantum Approximate Optimization Algorithm for
Max-Cut can reveal properties of the underlying graph it is called on.• Designed, presented …