Quantum optimization

Boosting quantum annealing performance through direct polynomial unconstrained binary optimization

Quantum annealing aims at solving optimization problems of practical relevance using quantum computing hardware. Problems of interest are typically formulated in terms of quadratic unconstrained binary optimization (QUBO) Hamiltonians. However, many …

The role of higher-order terms in trapped-ion quantum computing with magnetic gradient induced coupling

Trapped-ion hardware based on the Magnetic Gradient Induced Coupling (MAGIC) scheme is emerging as a promising platform for quantum computing. Nevertheless, in this (as in any other) quantum-computing platform, many technical questions still have to …

A Monte Carlo Tree Search approach to QAOA: finding a needle in the haystack

The search for quantum algorithms to tackle classical combinatorial optimization problems has long been one of the most attractive yet challenging research topics in quantum computing. In this context, variational quantum algorithms (VQA) are a …

Qudit-native measurement protocol for dynamical correlations using Hadamard tests

Dynamical correlations reveal important out-of-equilibrium properties of the underlying quantum many-body system, yet they are notoriously difficult to measure in experiments. While measurement protocols for dynamical correlations based on Hadamard …