Work

Tight Lieb–Robinson Bound for approximation ratio in quantum annealing

Year: 2024

Type: article

Abstract: Quantum annealing (QA) holds promise for optimization problems in quantum computing, especially for combinatorial optimization. This analog framework attracts attention for its potential to address complex problems. Its gate-based homologous, QAOA with proven performance, has attracted a lot of attention to the NISQ era. Several numerical benchmarks try to compare these two metaheuristics, however, classical computational power highly limits the performance insights. In this work, we introduce a parametrized version of QA enabling a precise 1-local analysis of the algorithm. We develop a tight Lieb–Robinson bound for regular graphs, achieving the best-known numerical value to analyze QA locally. Studying MaxCut over cubic graph as a benchmark optimization problem, we show that a linear-schedule QA with a 1-local analysis achieves an approximation ratio over 0.7020, outperforming any known 1-local algorithms.

Source: npj Quantum Information

DOI: 10.1038/s41534-024-00832-x

Authors: Arthur Braida, Simon Martiel, Ioan Todinca

Institutions: Université d'Orléans, Laboratoire d'Informatique Fondamentale d'Orléans

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $4,090

Funder: Agence Nationale de la Recherche