Approximating the quantum approximate optimization algorithm with digital-analog interactions
Approximating the quantum approximate optimization algorithm with digital-analog interactions
The quantum approximate optimisation algorithm was proposed as a heuristic method for solving combinatorial optimisation problems on near-term quantum computers and may be among the first algorithms to perform useful computations in the post-supremacy, noisy, intermediate scale era of quantum computing. In this work, we exploit the recently proposed digital-analog …