Performant near-term quantum combinatorial optimization

TL;DR

This paper introduces a variational quantum algorithm with linear-depth circuits for combinatorial optimization, demonstrating high-fidelity solutions on up to 32 qubits in real hardware, advancing near-term quantum computing capabilities.

Contribution

The paper presents a novel variational quantum algorithm with Hamiltonian generator ansatz and adaptive spectrum transformations, optimized for noisy hardware and scalable to 32 qubits.

Findings

Algorithm converges to optimal solutions in simulations.

High-fidelity solutions achieved on 32-qubit trapped-ion quantum computer.

Progress towards practical quantum advantage in combinatorial optimization.

Abstract

Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational advantages. To address this we present a variational quantum algorithm for solving combinatorial optimization problems with linear-depth circuits. Our algorithm uses an ansatz composed of Hamiltonian generators designed to control each term in the target combinatorial function, along with parameter updates following a modified version of quantum imaginary time evolution. We evaluate this ansatz in numerical simulations that target solutions to the MAXCUT problem. The state evolution is shown to closely mimic imaginary time evolution, and its optimal-solution convergence is further improved using adaptive transformations of the classical Hamiltonian spectrum. With these innovations, the algorithm consistently converges to optimal solutions, with interesting highly-entangled dynamics along the way. We further demonstrate the success of this approach by performing optimization of a truncated version of our ansatz with up to 32 qubits in a trapped-ion quantum computer, using measurements from the quantum computer to train the ansatz and prepare optimal solutions with high fidelity in the majority of cases we consider. The success of these large-scale quantum circuit optimizations, in the presence of realistic hardware constraints and without error mitigation, mark significant progress on the path towards solving combinatorial problems using quantum computers. We conclude our performant and resource-minimal approach is a promising candidate for potential quantum computational advantages.