quant-ph digest — 2026-05-12
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 (46 new + 12 cross = 58 entries)
Coverage: all 58 entries scored. 13 relevant (score ≥ 1); 45 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
Constrained Counterdiabatic Quantum Approximate Optimization Algorithm for Portfolio Optimization
- Authors: Jose Falla, Ilya Safro (University of Delaware)
- arXiv: 2605.06858
- Category: new submission — quant-ph
- Score: 10/10 (HIGH)
- Overlaps with: Y2, Y3 (scope: constrained portfolio + QAOA; method: Hamming-weight-preserving XY mixer, Dicke initialization, CVaR-QAOA); Y1 (method: structured QAOA variants and parameter-rich ansätze); Y4 (scope: cardinality-constrained binary optimization).
- Why it matters: Direct portfolio×QAOA hit. Adds a Sels–Polkovnikov-style counterdiabatic correction to XY-mixer QAOA with a three-body Pauli operator pool derived from the commutator of the Ising cost and the XY mixer; benchmarks against XY-mixer / Grover-mixer / penalty-based baselines and reports improved approximation ratios at fixed depth.
We introduce a counterdiabatic (CD) extension of the Quantum Approximate Optimization Algorithm (QAOA) for constrained portfolio optimization. By incorporating approximate adiabatic gauge potentials generated from nested commutators of the Ising-type portfolio problem Hamiltonian and the Hamming weight-preserving XY mixer Hamiltonian into our variational ansatz, the resulting Constrained Counterdiabatic QAOA (CCD-QAOA) achieves improved optimization performance under realistic budget and risk constraints. Benchmarking against standard XY-mixer QAOA, Grover-mixer QAOA, and penalty-based QAOA formulations, our numerical simulations demonstrate that, for a fixed QAOA depth, our CCD-QAOA approach consistently results in better approximation ratios.
Breaking QAOA's Fixed Target Hamiltonian Barrier: A Fully Connected Quantum Boltzmann Machine via Bilevel Optimization
- Authors: Liu Jun (Hunan University of Finance and Economics)
- arXiv: 2605.07473
- Category: new submission — quant-ph; cond-mat.stat-mech; cs.ET; cs.LG
- Score: 8/10 (HIGH)
- Overlaps with: Y1 (method: QAOA variants and adaptive parameter scheduling; both papers turn a traditionally fixed object — initial state / Hamiltonian coefficients — into an adaptive one); Y3 (method: depth vs trainability tension in QAOA optimization; noise-regime scan).
- Why it matters: Proposes a bilevel QAOA: the cost-Hamiltonian's structural parameters (b_i, w_ij) are made learnable in an outer loop, while the variational angles (β, γ) are optimized in the inner loop. Demonstrates on a 4-qubit Boltzmann-machine target distribution with NISQ-typical depolarizing noise. The structural idea — making an "always fixed" ingredient of QAOA adaptive — parallels Y1's warm-starting philosophy.
To overcome the limitations of classical partially connected Boltzmann machines and mainstream quantum Boltzmann machines (QBMs), this work extends the conventional circuit of the quantum approximate optimization algorithm (QAOA) to a bilevel optimization architecture and proposes a fully connected QBM. … The inner-loop training simulates positive phase energy minimization based on the computational process of the conventional QAOA circuit, whereas the outer-loop training simulates negative phase contrastive divergence learning by optimizing the structural parameters of the target Hamiltonian. … Under the typical noise level of current mainstream commercial quantum computing devices, the average probability of measuring the target quantum state reaches 0.6047; when the noise rises to a more stringent level with doubled intensity, this probability remains at 0.3859.
Moderately relevant (score 5–7) — 5 papers
Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics
- Authors: Steven Abel, Andrei Constantin, Luca A. Nutricati
- arXiv: 2605.06857
- Category: new submission — quant-ph; cond-mat.dis-nn; cond-mat.stat-mech; cs.ET
- Score: 6/10 (MED)
- Overlaps with: Y1, Y3 (scope: discrete optimisation on quantum hardware; method: adiabatic-to-QAOA correspondence), Y2 (scope: constrained binary optimization).
- Why it matters: Wide-scope review of quantum annealing for discrete optimization, sampling, and many-body dynamics. Useful as a citation pool / context for Y1/Y3 introductions, and the sampling-as-many-body-dynamics framing connects to Y5's Gibbs-state route.
Quantum annealing is a computational paradigm in which optimisation problems are mapped onto the energy landscape of an interacting quantum system and explored through its dynamical evolution. … Modern quantum annealers realise programmable spin systems with thousands of qubits, placing them among the largest controllable quantum devices currently available. As a result, their significance extends beyond optimisation: they also function as experimental platforms for studying non-equilibrium many-body quantum dynamics in regimes that are difficult to access using classical [methods].
Compositional Quantum Heuristics for Max-Clique Detection
- Authors: Tiffany Duneau, Colin Krawchuk, Anna Pearson
- arXiv: 2605.07611
- Category: new submission — quant-ph
- Score: 6/10 (MED)
- Overlaps with: Y1 (scope: graph combinatorial optimization — max-clique is closely related to MaxCut on which Y1's iterative warm-starting is benchmarked); method overlap on parameterised quantum circuits / variational ansätze for graph problems.
- Why it matters: Tackles barren plateaus in QML by composing smaller permutation-equivariant subcomponents into a graph neural network for max-clique detection. The symmetry-induced inductive bias is a complementary route to Y1's warm-starting for circumventing trainability issues in QAOA-style ansätze.
Quantum machine learning holds the promise of combining the success of classical machine learning methods with the power of quantum computing, however one of the largest obstacles facing the field is the problem of barren plateaus. … In this work we investigate a compositional approach to mitigate this trade-off by assembling larger quantum models from smaller subcomponents. … We use this framework to design permutation-equivariant quantum graph neural networks for identifying maximal cliques in graphs.
A Unified Local Light-shifts Encoding For Solving Optimization Problems on a Rydberg Annealer
- Authors: Kapil Goswami, Peter Schmelcher
- arXiv: 2605.07627
- Category: new submission — quant-ph; math.OC; physics.atom-ph; physics.comp-ph
- Score: 6/10 (MED)
- Overlaps with: Y2, Y3, Y4 (scope: QUBO/Ising-form binary optimization; alternate hardware for the same problem class).
- Why it matters: Unified Rydberg-atom encoding for a broad QUBO family (2-SAT, XOR-SAT, set packing, quadratic assignment, binary clustering, protein folding). Useful comparator for Y2/Y3 portfolio-as-QUBO instances if a Rydberg native baseline is ever needed; the encoding-resource discussion mirrors Y2's quasi-binary trade-off.
Combinatorial optimization problems play a central role in computer science with many real world applications. … We present a unified framework for solving such optimization problems represented in the quadratic unconstrained binary optimization (QUBO) formalism, namely two-SAT, XOR-SAT, mixed-two-XOR-SAT, set packing, quadratic assignment, binary clustering, and protein folding … A direct mapping from the QUBO form of these problems onto the Rydberg quantum platform is demonstrated as our first step.
Reducibility of native weighted graphs on Rydberg Arrays
- Authors: J. Kombe, J. D. Pritchard
- arXiv: 2605.07952
- Category: new submission — quant-ph; cond-mat.dis-nn; cond-mat.quant-gas; physics.atom-ph
- Score: 5/10 (MED)
- Overlaps with: Y4 (scope: combinatorial optimization on a fixed-support feasible set — here MIS/MWIS), and the dequantisation/classical-preprocessing theme touched by Y5 (where classical reductions absorb part of the quantum claim).
- Why it matters: Uses state-of-the-art kernelisation to classically reduce MIS/MWIS instances on unit-disk graphs natively realised on Rydberg arrays. Identifies which problem regimes remain "quantum-required" after classical preprocessing — a dequantisation-style scan exactly analogous to Y5's discussion of when SDP relaxations are classically tractable.
We investigate the classical reducibility of random unit-disk graph (UDG) instances of the maximum independent set (MIS) and maximum weighted independent set (MWIS) problems, which can be natively realised in Rydberg atom quantum processors. Using state-of-the-art kernelisation techniques, we systematically probe how far classical preprocessing can simplify such native optimisation problems of varying size and connectivity. … By exploring where classical reductions cease to be effective, we aim to delineate the regime of problem instances that remain computationally demanding — those most relevant for testing and benchmarking near-term quantum optimisation hardware.
Box model of quantum annealing
- Authors: Yang Wei Koh, Youjin Deng
- arXiv: 2605.07144
- Category: new submission — quant-ph
- Score: 5/10 (MED)
- Overlaps with: Y1 (method: diabatic transitions and gap-driven dynamics, which Y1's warm-starting reshapes); Y3 (method: residual-energy/approximation-ratio analysis under annealing speed).
- Why it matters: A clean, continuous-space toy model of annealing with controllable landscape roughness; identifies "flat gaps" as a mechanism for wave-function trapping during diabatic transitions. Connects to the same gap-vs-speed trade-off Y1 mitigates via measurement-based warm-starting.
A particle-in-a-box model of continuous space quantum annealing is proposed and studied numerically by solving the Schrödinger wave equation directly. Three types of energy landscapes with multiple local minima are considered … Simulation results show that the residual energy as a function of annealing speed is largely independent of these two factors. The prevalence of diabatic transitions during annealing is observed, and the discrepancy between our numerical results and the Landau-Zener formula is discussed. An interesting feature in the energy gap spectrum, which we call flat gaps, is examined.
Tangential (score 1–4) — 6 papers
- 2605.07518 · score 4/10 · Loop Composition in Quantum Algorithms — Method-adjacent to Y4: applies branching/looping composition to Grover's algorithm via the quantum-walk formalism, recovering optimal variable-time Grover scaling. Useful for thinking about composable Grover-based subroutines à la Y4.
- 2605.07868 · score 3/10 · Systematic frequency-collision analysis of the cross-resonance gate outside the straddling regime — Scope-adjacent to Y6: hardware engineering for fixed-frequency transmons (Eagle/Heron lineage), proposing far-detuned CR-gate operation to reduce collisions. Background reading for the IBM hardware platform Y6 uses.
- 2605.07228 · score 3/10 · Kochen-Specker nonlocal hidden variables must include time-ordering to allow for measurement independence of several agents — Foundations / PBR-adjacent: shows multi-agent contextual hidden-variable ontologies require time-ordering of contexts.
- 2605.07090 · score 2/10 · Decoherence without the state: A causal quantum Darwinist approach — Foundations: a dynamics-first reformulation of Darwinist decoherence; tangentially adjacent to the ontic/epistemic line Y6 tests experimentally.
- 2605.06848 · score 2/10 · Quantum Darwinism and the quality of Petz recovery — Foundations: Petz-recovery quality for einselected information from environmental fragments. Tangential to PBR (Y6) only via Quantum Darwinism's role in the measurement-problem literature.
- 2605.07033 · score 2/10 · Analytic C_{ℓ_1} norm of Coherence Evolution for Bell States under a Two-Qubit Superconducting Hamiltonian — Tangential to Y6's superconducting platform; analytic two-qubit coherence dynamics with no hardware experiment.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 10 | 2605.06858 | CCD-QAOA for portfolio optimization | Y2, Y3, Y1, Y4 | link |
| 8 | 2605.07473 | Bilevel-optimization QAOA QBM | Y1, Y3 | link |
| 6 | 2605.06857 | Quantum annealing review | Y1, Y3, Y2 | link |
| 6 | 2605.07611 | Compositional quantum heuristics for max-clique | Y1 | link |
| 6 | 2605.07627 | Unified light-shifts encoding for Rydberg-annealer QUBOs | Y2, Y3, Y4 | link |
| 5 | 2605.07952 | Reducibility of native Rydberg-array MIS/MWIS | Y4, Y5 | link |
| 5 | 2605.07144 | Box model of quantum annealing | Y1, Y3 | link |
| 4 | 2605.07518 | Loop composition in quantum algorithms (Grover) | Y4 | link |
| 3 | 2605.07868 | CR-gate frequency-collision analysis | Y6 | link |
| 3 | 2605.07228 | Kochen-Specker time-ordering for measurement independence | Y6 | link |
| 2 | 2605.07090 | Decoherence without the state (Darwinist) | Y6 | link |
| 2 | 2605.06848 | Quantum Darwinism and Petz recovery | Y6 | link |
| 2 | 2605.07033 | C_ℓ1 norm coherence — Bell states on 2-qubit SC Hamiltonian | Y6 | link |