quant-ph digest — 2026-05-08
Scored against Yuan's research programme (Y1–Y6):
- Y1 — arXiv:2502.09704 — iterative warm-started QAOA
- Y2 — arXiv:2304.06915 — quasi-binary portfolio QAOA
- Y3 — arXiv:2410.16265 — QAOA DGMVP portfolio (QST 2026)
- Y4 — arXiv:2603.14744 — Grover + ADMM cardinality-constrained BO
- Y5 — arXiv:2510.08292 — GW speed-ups via Gibbs states + Pauli sparsity
- Y6 — arXiv:2510.11213 — PBR test on IBM Heron2
Source
arXiv listing: https://arxiv.org/list/quant-ph/new (63 new + 10 cross = 73 entries)
Coverage: all 73 entries scored. 9 relevant (score ≥ 1); 64 SKIP (score 0, omitted).
Scoring rubric
0–10 on method/scope/conclusion overlap — max wins. HIGH 8–10 · MED 5–7 · LOW 1–4 · SKIP 0.
Highly relevant (score 8–10) — 1 paper
Second-Order FALQON Parameter Transfer for the Max-Cut Problem on 3-Regular Graphs
- Authors: Gabriel Fernandes Thomaz, Eduarda Rodrigues Monteiro, Jerusa Marchi, Marcelo Zen Pretto, Alisson dos Passos Fumaco, Evandro Chagas Ribeiro da Rosa
- arXiv: 2605.04253
- Category: cross submission — Emerging Technologies (cs.ET); Quantum Physics (quant-ph)
- Score: 9/10 (HIGH)
- Overlaps with: Y1 (method + scope: 3-regular Max-Cut, parameter transfer / warm-start mechanism, NISQ depth budget); Y3 (method: layerwise / amortised optimisation across instance sizes)
- Why it matters: This is the closest contemporary analogue to Y1's iterative warm-starting story — same testbed (random 3-regular Max-Cut, n up to 24, fixed shallow depth), same idea of moving expensive optimisation off the large-instance critical path, and an empirical Δt ≈ 1/(2√n) scaling law that pinpoints exactly the depth/step-size bottleneck warm-starts overcome. The authors do not cite Y1; a comparison paragraph in the next Y1 revision (or a short note to the authors) would establish priority.
The Feedback-based Algorithm for Quantum Optimization (FALQON) offers a deterministic alternative to variational quantum algorithms by bypassing classical optimization loops. However, maintaining convergence on large problem instances often requires restricting the time step, necessitating quantum circuit depths that exceed Noisy Intermediate-Scale Quantum (NISQ) hardware capabilities. This paper investigates the parameter transferability of second-order FALQON applied to the Max-Cut problem on 3-regular graphs. Through numerical experiments evaluating quantum circuits up to 16 layers on graphs up to 24 nodes, we demonstrate a highly advantageous scaling behavior: transferring feedback parameters optimized on small instances to larger target graphs yields significantly higher approximation ratios than nativ
Moderately relevant (score 5–7) — 2 papers
Neural-powered unit disk graph embedding: qubits connectivity for some QUBO problems
- Authors: Chiara Vercellino, Paolo Viviani, Giacomo Vitali, Alberto Scionti, Andrea Scarabosio, Olivier Terzo, Edoardo Giusto, Bartolomeo Montrucchio
- arXiv: 2605.04736
- Category: new submission — Quantum Physics (quant-ph)
- Score: 6/10 (MED)
- Overlaps with: Y2/Y3/Y4 (scope: QUBO encoding for combinatorial optimisation on quantum hardware, hard-constraint structure)
- Why it matters: Tackles the QUBO-to-hardware mapping problem on Rydberg neutral-atom devices via neural-network-driven unit-disk graph embedding. Adjacent to Y2/Y4's encoding-and-mixer choices but for a different hardware (Rydberg blockade) — a useful comparator when contrasting quasi-binary encoding's qubit-count efficiency against geometric-constraint-based encodings.
Graph embedding is a recurrent problem in quantum computing, for instance, quantum annealers need to solve a minor graph embedding in order to map a given Quadratic Unconstrained Binary Optimization (QUBO) problem onto their internal connectivity pattern. This work presents a novel approach to constrained unit disk graph embedding, which is encountered when trying to solve combinatorial optimization problems in QUBO form, using quantum hardware based on neutral Rydberg atoms. The qubits, physically represented by the atoms, are excited to the Rydberg state through laser pulses. Whenever qubits pairs are closer together than the blockade radius, entanglement can be reached, thus preventing entangled qubits to be simultaneously in the excited state.
Harnessing a 256-qubit Neutral Atom Simulator for Graph Classification
- Authors: Edoardo Giusto, Gabriele Iurlaro, Bartolomeo Montrucchio, Alberto Scionti, Olivier Terzo, Chiara Vercellino, Giacomo Vitali, Paolo Viviani
- arXiv: 2605.04737
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y2/Y3 (scope: graph-encoded combinatorial tasks on noisy quantum hardware); Y3 (conclusion: NISQ-noise impact on practical performance)
- Why it matters: An end-to-end run on the 256-qubit Aquila neutral-atom platform (PROTEINS dataset, Quantum Evolution Kernel features) — useful as a hardware data point for "what does noisy NISQ-era graph processing actually deliver" alongside Y3's QAOA noise analysis on superconducting hardware.
Neutral atom platforms are analogue quantum simulators that offer the possibility to map graphs onto a 2D qubit register using programmable Rubidium atoms arrays, whose valence electrons' energy state is used as qubits, using optical tweezers. This makes it possible to implement algorithms for solving graph combinatorial optimization and Quantum Machine Learning (QML) tasks, such as graph classification. However, the restrictions of real hardware, as well as the very low number of publicly available machines, make such implementation non-trivial. In this work, we manage to compute the Quantum Evolution Kernel (QEK) to extract the features from graphs of the PROTEINS dataset using the 256-qubits Aquila platform (available through AWS) and then we apply classical Machine Learning (ML) techniques for the final classification.
Tangential (score 1–4) — 6 papers
- 2605.04604 · score 4/10 · Generative Quantum-inspired Kolmogorov-Arnold Eigensolver — quantum-inspired hybrid eigensolver for chemistry; weak method-family kinship to Y5's quantum-inspired direction, but the application (HQKANsformer for selected CI) is unrelated to SDP/Gibbs-state structure.
- 2605.04106 · score 3/10 · Quantum Algorithms for Magic Square Diophantine Equations — structured-search via period finding and a shifted-oracle method; tangential to Y4's Grover-on-structured-feasible-spaces theme but uses Shor-flavour QFT machinery rather than amplitude amplification with constraint-preserving mixers.
- 2605.04338 · score 3/10 · Robust certification of high-dimensional quantum devices — prepare-and-measure certification via OAM photons; foundations-adjacent to Y6's epistemic-bound test but the mechanism (rank-stability of correlations) is unrelated to PBR.
- 2605.04931 · score 3/10 · Quantum Realizability of Probabilistic Theories Stable under Teleportation — GPT classification adjacent to Y6's foundations programme; identifies which Dmello–Gross families admit quantum realisation but does not engage PBR.
- 2605.04112 · score 2/10 · Emergent Quantum Dynamics as a Bayesian Inference Problem: A Critical Analysis — uses SDP machinery for emergent-dynamics existence checks; method overlap with Y5 is at the SDP-as-tool level only.
- 2605.04343 · score 2/10 · Hidden Prime-Factor Subgroups in Molecular and Condensed-Phase Systems — Shor / hidden-subgroup-problem framing; unrelated to Y1–Y6 themes beyond the broad "quantum algorithms" umbrella.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 9 | 2605.04253 | Second-order FALQON parameter transfer, 3-regular Max-Cut | Y1, Y3 | link |
| 6 | 2605.04736 | Neural unit-disk graph embedding for QUBO on Rydberg | Y2, Y3, Y4 | link |
| 5 | 2605.04737 | 256-qubit Aquila neutral-atom graph classification | Y2, Y3 | link |
| 4 | 2605.04604 | Generative quantum-inspired KAN eigensolver | Y5 (weak) | link |
| 3 | 2605.04106 | Quantum algorithms for magic-square Diophantine equations | Y4 (weak) | link |
| 3 | 2605.04338 | Robust certification of high-dimensional quantum devices | Y6 (weak) | link |
| 3 | 2605.04931 | Quantum realizability of GPTs stable under teleportation | Y6 (weak) | link |
| 2 | 2605.04112 | Emergent quantum dynamics as Bayesian inference | Y5 (SDP tool) | link |
| 2 | 2605.04343 | Hidden prime-factor subgroups in molecular systems | tangential | link |