Tight Lieb–Robinson Bound for approximation ratio in quantum annealing

Tight Lieb–Robinson Bound for approximation ratio in quantum annealing

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 lo...

Full description

Bibliographic Details
Main Authors: Arthur Braida, Simon Martiel, Ioan Todinca
Format: Article
Language:English
Published: Nature Portfolio 2024-04-01
Series:npj Quantum Information
Online Access:https://doi.org/10.1038/s41534-024-00832-x

Similar Items

Similar Items