Quick Navigation

Topics

Quantum Optimization

LOTUS: Layer-ordered Temporally Unified Schedules For Quantum Approximate Optimization Algorithms

arXiv
Authors: Phuong-Nam Nguyen

Year

2026

Paper ID

4048

Status

Preprint

Abstract Read

~2 min

Abstract Words

83

Citations

N/A

Abstract

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.

Why This Paper Matters

  • This paper contributes to the Quantum Optimization research area in the Quantum Articles archive.
  • It adds a 2026 reference point for readers tracking recent quantum research.
  • 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...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #4048

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.