Quantum adiabatic and diabatic optimization: A Hilbert space engineering strategy with Rydberg arrays

Neutral-atom arrays provide a versatile platform for encoding combinatorial optimization problems with arbitrary graph connectivity [Nguyen et al., PRX Quantum 4, 010316 (2023)]. Although the dynamics of individual encoding gadgets has been studied [Bombieri et al., PRX Quantum 6, 020306 (2025)], understanding annealing bottlenecks in larger networks remains challenging. We investigate how engineering the Hilbert-space geometry controls quantum annealing in a family of blockaded-chain models motivated by these encodings. While boundary terms encode the target maximum independent set problem, the bulk geometry induces an auxiliary optimization problem associated with independent sets of cliques. Spectrally, the energetics of the quantum system can be approximated by physically derived clique weights. When the target problem and the auxiliary problems are consistent, the low-energy modes lie predominantly within the target subspace. This spectral structure motivates a diabatic annealing strategy that exploits target-compatible excited states, as tested on the diamond-chain graph family. These results provide a framework for predicting annealing bottlenecks, and demonstrate Hilbert-space engineering as a strategy for improving neutral-atom quantum optimization protocols.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.21341
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Quantum adiabatic and diabatic optimization: A Hilbert space engineering strategy with Rydberg arrays

Rui Lin
arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
preprint

Quantum adiabatic and diabatic optimization: A Hilbert space engineering strategy with Rydberg arrays

Rui Lin
preprint en

Abstract

Neutral-atom arrays provide a versatile platform for encoding combinatorial optimization problems with arbitrary graph connectivity [Nguyen et al., PRX Quantum 4, 010316 (2023)]. Although the dynamics of individual encoding gadgets has been studied [Bombieri et al., PRX Quantum 6, 020306 (2025)], understanding annealing bottlenecks in larger networks remains challenging. We investigate how engineering the Hilbert-space geometry controls quantum annealing in a family of blockaded-chain models motivated by these encodings. While boundary terms encode the target maximum independent set problem, the bulk geometry induces an auxiliary optimization problem associated with independent sets of cliques. Spectrally, the energetics of the quantum system can be approximated by physically derived clique weights. When the target problem and the auxiliary problems are consistent, the low-energy modes lie predominantly within the target subspace. This spectral structure motivates a diabatic annealing strategy that exploits target-compatible excited states, as tested on the diamond-chain graph family. These results provide a framework for predicting annealing bottlenecks, and demonstrate Hilbert-space engineering as a strategy for improving neutral-atom quantum optimization protocols.

arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon