Salvato in:
Dettagli Bibliografici
Autore principale: Nguyen, Phuong-Nam
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:https://arxiv.org/abs/2601.07851
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866908761206030336
author Nguyen, Phuong-Nam
author_facet Nguyen, Phuong-Nam
contents In this paper, we introduce LOTUS (Layer-Ordered Temporally-Unified Schedules), which is a framework that restructures QAOA from a high-dimensional, chaotic search into a low-dimensional dynamical system. By replacing independent layer-wise angles with a Hybrid Fourier-Autoregressive (HFA) mapping, LOTUS enforces global temporal coherence while maintaining local flexibility. LOTUS consistently outperforms standard optimizers, achieving up to a $27.2\%$ improvement in expectation values over L-BFGS-B and $20.8\%$ compared with COBYLA. Besides, our proposed method drastically reduces computational costs, requiring over $90\%$ fewer iterations than methods like Powell or SLSQP.
format Preprint
id arxiv_https___arxiv_org_abs_2601_07851
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle LOTUS: Layer-ordered Temporally Unified Schedules For Quantum Approximate Optimization Algorithms
Nguyen, Phuong-Nam
Quantum Physics
In this paper, we introduce LOTUS (Layer-Ordered Temporally-Unified Schedules), which is a framework that restructures QAOA from a high-dimensional, chaotic search into a low-dimensional dynamical system. By replacing independent layer-wise angles with a Hybrid Fourier-Autoregressive (HFA) mapping, LOTUS enforces global temporal coherence while maintaining local flexibility. LOTUS consistently outperforms standard optimizers, achieving up to a $27.2\%$ improvement in expectation values over L-BFGS-B and $20.8\%$ compared with COBYLA. Besides, our proposed method drastically reduces computational costs, requiring over $90\%$ fewer iterations than methods like Powell or SLSQP.
title LOTUS: Layer-ordered Temporally Unified Schedules For Quantum Approximate Optimization Algorithms
topic Quantum Physics
url https://arxiv.org/abs/2601.07851