Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs

Abstract We show that the quantum approximate optimization algorithm (QAOA) for higher-order, random coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from 16 up to 127 qubits for p = 1 up to p = 5, which allows for computationally effi...

Full description

Saved in:
Bibliographic Details
Main Authors: Elijah Pelofske, Andreas Bärtschi, Lukasz Cincio, John Golden, Stephan Eidenbenz
Format: Article
Language:English
Published: Nature Portfolio 2024-11-01
Series:npj Quantum Information
Online Access:https://doi.org/10.1038/s41534-024-00906-w
Tags: Add Tag
No Tags, Be the first to tag this record!