Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping

Улучшение квантовой приближённой оптимизации с помощью адаптивного перемаппинга, управляемого шумом
Jacob Biamonte, Stuart Hadfield, Davide Venturelli, Filip B. Maciejewski
2025-11-06

Noise-Directed Adaptive RemappingQuantum Approximate Optimization Algorithmapproximation ratiosgauge transformationnoisy quantum processors
We present Noise-Directed Adaptive Remapping (NDAR), a heuristic algorithm for approximately solving binary optimization problems by leveraging certain types of noise. We consider access to a noisy quantum processor with dynamics that features a global attractor state. In a standard setting, such noise can be detrimental to the quantum optimization performance. Our algorithm bootstraps the noise attractor state by iteratively gauge-transforming the cost-function Hamiltonian in a way that transforms the noise attractor into higher-quality solutions. The transformation effectively changes the attractor into a higher-quality solution of the Hamiltonian based on the results of the previous step. The end result is that noise aids variational optimization, as opposed to hindering it. We present an improved Quantum Approximate Optimization Algorithm (QAOA) runs in experiments on Rigetti's quantum device. We report approximation ratios 0.9 - 0.96 for random, fully connected graphs on n = 82 qubits, using only depth p = 1 QAOA with NDAR. This compares to 0.34 - 0.51 for standard p = 1 QAOA with the same number of function calls.
1
NDAR iteratively gauge-transforms the cost-function Hamiltonian so the noise attractor becomes progressively higher-quality solutions.
2
Noise-Directed Adaptive Remapping (NDAR) is a heuristic for binary optimization that exploits noise with a global attractor state.
3
On Rigetti's quantum device, depth-one QAOA with NDAR achieved approximation ratios of 0.9–0.96 for random fully connected graphs with 82 qubits.
4
The method reverses the usual role of noise, enabling it to aid variational optimization rather than degrade performance.
5
Under the same function-call budget, standard depth-one QAOA achieved substantially lower approximation ratios of 0.34–0.51.

Noisy quantum optimization of binary optimization problems using QAOA on a quantum processor with a global attractor state

Noise-directed adaptive remapping that transforms the noise attractor into progressively higher-quality Hamiltonian solutions and improves QAOA approximation ratios

Publication Details
Publication Date
2025-11-06
Journal
Publisher
ISSN
Cited by
10
Access Type
Author Information
Authors
Jacob Biamonte
Stuart Hadfield
Davide Venturelli
Filip B. Maciejewski
Explore further
Open the scid.ai AI chat with a ready-made request: it will find papers on a similar topic and help build a literature review.
Find similar papers in the chat →
Make a presentation
100%