quant-ph digest — 2026-05-22
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 (49 new + 8 cross = 57 entries, Thursday 21 May 2026 announce cycle).
Coverage: all 57 entries scored. 14 relevant (score ≥ 1); 43 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) — 2 papers
Quantum End-to-End Learning for Contextual Combinatorial Optimization
- Authors: Jaehwan Lee, Changhyun Kwon (KAIST / Omelet)
- arXiv: 2605.20222
- Category: new submission — Quantum Physics (quant-ph); Machine Learning (cs.LG)
- Score: 8/10 (HIGH)
- Overlaps with: Y1, Y2, Y3 (method — QAOA on Ising/QUBO with parametric phase-separator)
- Why it matters: First QC-based end-to-end framework for contextual combinatorial optimisation; the context re-uploading phase-separator is a clean drop-in that could turn Yuan's portfolio QAOA (Y3) into a contextual DGMVP solver with 1–3 orders of magnitude fewer trainable parameters than classical PnO baselines.
Contextual combinatorial optimization (CCO) plays a critical role in decision-making under uncertainty, yet remains a significant challenge. We present Quantum End-to-End Learning (QEL), the first quantum computing-based end-to-end learning framework for CCO that leverages Quantum Approximate Optimization Algorithms. Inspired by the integration of state preparation and evolution in data re-uploading, we propose a context re-uploading phase-separator that jointly captures the complex relations among contexts, uncertain coefficients, and optimal solutions. This allows a contextual encoder to be seamlessly integrated within a quantum surrogate policy, enabling joint end-to-end training with a stationarity guarantee. Exploiting an optimization-aware structure grounded
Mechanism of Efficacy in QAOA for Random k-SAT: From Adiabatic Manifold to Sublinear Parameter Optimization
- Authors: Mingyou Wu, Hanwu Chen (Southeast University)
- arXiv: 2605.20288
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y1, Y3 (method — QAOA parameter scheduling/landscape, layerwise/refinement optimisation, structural priors for warm-starting)
- Why it matters: Identifies a smooth low-dimensional "adiabatic manifold" in QAOA's parameter landscape and uses it for a hierarchical-refinement optimiser (SAMP) with sublinear cost in circuit depth. Directly relevant to Y1's warm-starting motivation and a candidate replacement for Y3's dual-annealing+layerwise optimiser on portfolio QAOA.
The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for demonstrating quantum advantage on near-term devices, yet the physical origins of its efficacy remain poorly understood. In this work, we study QAOA for random k-SAT problems within a universal-mixer k-local search framework, establishing a formal correspondence between adiabatic state transfer and the QAOA ansatz. This correspondence yields a rigorous performance guarantee for random instances with clause density m = O(n^(1+ε)) and circuit depth Θ(n²). We further investigate the NISQ regime with shallow circuits of depth p = O(n). Surprisingly, the optimal parameters do not become stochastic under depth compression, but instead remain confined to a structured low-dimensional region
Moderately relevant (score 5–7) — 2 papers
PUBO Formulation for MST and Application to Optimum-Path Forest
- Authors: G. E. L. Pexe, L. A. M. Rattighieri, L. A. Passos, D. S. Jodas, D. Rodrigues, F. F. Fanchini, J. P. Papa, K. A. P. Costa
- arXiv: 2605.20637
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y2 (qubit-efficient encoding), Y4 (constrained combinatorial via PUBO) — method, scope
- Why it matters: Compact PUBO encoding of the MST problem with FALQON (a QAOA-adjacent feedback-based quantum optimiser); parallels Y2's quasi-binary encoding motivation for portfolio QAOA. Worth tracking as an alternative encoding family for cardinality/graph problems.
The Optimum-Path Forest is a graph-based framework for designing classifiers that exploit inter-sample connectivity. A particular variant constructs decision boundaries based on prototypes computed by a Minimum Spanning Tree (MST) over the training data, which might become prohibitive for large-scale datasets. In this context, Quantum Machine Learning has emerged as a promising approach to overcome the high computational burden of combinatorial problems. We propose a quantum-inspired approach for prototype selection in OPF classifiers by reformulating the MST problem as a Polynomial Unconstrained Binary Optimization (PUBO) task and further employing the Feedback-Based Quantum Optimization (FALQON) algorithm for Hamiltonian minimization. The PUBO formulation reduces the need for qubits
Semidefinite Programming for Optimal Quantum Cloning: A Computational Framework
- Authors: Jörg Hettel
- arXiv: 2605.21274
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y5 (method — SDP via Choi-Jamiolkowski; primal-dual duality)
- Why it matters: SDP-based optimisation framework via Choi–Jamiolkowski with primal-dual certification — method overlap with Y5's structured SDP relaxations, though the application (quantum cloning vs Goemans–Williamson) is different. Useful as a reference point for SDP tooling in quantum settings.
While algebraic derivations establish theoretical limits for quantum cloning, practical implementations require explicit operator representations that are often unavailable analytically. We present a computational framework that reformulates cloning optimization as a search over completely positive trace-preserving maps using the Choi-Jamiolkowski isomorphism and Semidefinite Programming. The framework (i) numerically certifies global optimality through primal-dual strong duality and (ii) automatically extracts operational Kraus operators from the optimal Choi matrix via spectral decomposition. We systematically treat universal, phase-covariant, asymmetric, and entanglement cloning scenarios, providing -for the first time - a unified computational catalogue of explicit, implementable Kraus
Tangential (score 1–4) — 10 papers
- 2605.21213 · score 4/10 · Enhanced Reinforcement Learning-based Process Synthesis via Quantum Computing — quantum RL with state encoding to decouple qubit count from problem size for flowsheet synthesis; encoding motivation parallels Y2's quasi-binary but the algorithmic family is RL, not QAOA.
- 2605.21346 · score 3/10 · Evidence of Quantum Machine Learning Advantage with Tens of Noisy Qubits — finite-scale noisy-data QML advantage claim; tangentially touches Y3's noise-regime / quantum advantage discussion.
- 2605.21380 · score 3/10 · Modeling and Resource Optimization for Quantum Oracles — HRSE/ASDT framework for oracle resource optimisation; oracles are the workhorse subroutine in Y4's Grover-based algorithm.
- 2605.21447 · score 3/10 · Combining non-parametric quantum states and MERA tensor networks for ground-state optimization — hybrid quantum-annealing + classical tensor network for Ising ground state; Ising scope but variational/annealing rather than QAOA.
- 2605.21164 · score 3/10 · Q-SYNTH: Hybrid Quantum-Classical Adversarial Augmentation for Imbalanced Fraud Detection — parameterised quantum-circuit GAN for tabular financial data; finance scope is adjacent to Y3's portfolio domain but methodology is QML/GAN.
- 2605.20330 · score 2/10 · Gravitational Entanglement in Optomechanics: Distinguishing Classical and Quantum Models — foundations of quantum vs classical models in optomechanics; tangential to Y6's PBR / quantum-ontology family.
- 2605.21243 · score 2/10 · Collapse of the state vector and nonlocal correlations in quantum mechanics — measurement / nonlocality foundations; loosely adjacent to Y6.
- 2605.21245 · score 2/10 · Boundary Geometry Turns Entanglement into Steering — EPR-steering geometry; adjacent to Y6's foundations strand but on the steering/Bell side rather than PBR.
- 2605.21293 · score 2/10 · Quantum Nonlocality and Device-Independent Randomness are Robust to Noisy Signaling Channels — Bell-test robustness with noisy signalling; foundations adjacency to Y6.
- 2605.20801 · score 2/10 · Q-SpiRL: Quantum Spiking Reinforcement Learning for Adaptive Robot Navigation — quantum-enhanced spiking RL; tangential QML.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 8 | 2605.20222 | QEL — Quantum End-to-End Learning for CCO | Y1, Y2, Y3 (method) | link |
| 8 | 2605.20288 | SAMP — Adiabatic Manifold for QAOA on k-SAT | Y1, Y3 (method) | link |
| 5 | 2605.20637 | PUBO MST with FALQON | Y2, Y4 (method, scope) | link |
| 5 | 2605.21274 | SDP for Optimal Quantum Cloning | Y5 (method, SDP) | link |
| 4 | 2605.21213 | Quantum RL for Process Synthesis | Y2 (encoding motif) | link |
| 3 | 2605.21346 | QML Advantage with Tens of Noisy Qubits | Y3 (noise / advantage) | link |
| 3 | 2605.21380 | Resource Optimisation for Quantum Oracles | Y4 (Grover oracles) | link |
| 3 | 2605.21447 | Quantum-annealing + MERA for Ising GS | Y2, Y3 (Ising / hybrid) | link |
| 3 | 2605.21164 | Q-SYNTH Quantum GAN Fraud Detection | Y3 (finance scope) | link |
| 2 | 2605.20330 | Gravitational Entanglement Optomechanics | Y6 (foundations) | link |
| 2 | 2605.21243 | State-vector Collapse and Nonlocal Correlations | Y6 (foundations) | link |
| 2 | 2605.21245 | Boundary Geometry → Steering | Y6 (foundations) | link |
| 2 | 2605.21293 | Quantum Nonlocality vs Noisy Signalling | Y6 (foundations) | link |
| 2 | 2605.20801 | Q-SpiRL Quantum Spiking RL | Y3 (QML scope) | link |