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...
Saved in:
| 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!
|
Similar Items
-
Probing Quantum Telecloning on Superconducting Quantum Processors
by: Elijah Pelofske, et al.
Published: (2024-01-01) -
Creating Entangled Logical Qubits in the Heavy-Hex Lattice with Topological Codes
by: Bence Hetényi, et al.
Published: (2024-12-01) -
LX-mixers for QAOA: Optimal mixers restricted to subspaces and the stabilizer formalism
by: Franz G. Fuchs, et al.
Published: (2024-11-01) -
A 50-spin surface acoustic wave Ising machine
by: Artem Litvinenko, et al.
Published: (2025-02-01) -
On Computation of Entropy of Hex-Derived Network
by: Pingping Song, et al.
Published: (2021-01-01)