quant-ph digest — 2026-05-31
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 (85 new + 18 cross = 103 entries, announce cycle Friday 29 May 2026)
Coverage: all 103 entries scored. 10 relevant (score ≥ 1); 93 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) — 3 papers
Non-Abelian Mixer for QAOA on Hybrid Oscillator-Qubit Quantum Processors
- Authors: Thinh Le, Hansika Weerasena, Jianqing Liu (NC State Univ.)
- arXiv: 2605.30234
- Category: new submission — Quantum Physics (quant-ph)
- Score: 9/10 (HIGH)
- Overlaps with: Y1 (method — QAOA on unweighted graphs, mixer design for MaxCut), Y2 (method — hardware-native non-Abelian mixer is the conceptual cousin of the constraint-preserving quasi-binary mixer)
- Why it matters: Proposes a hardware-native non-Abelian QAOA mixer for hybrid CV-DV processors built from alternating
x̂/p̂-coupled conditional displacements. On Erdős–Rényi MaxCut, the new mixer consistently improves the approximation ratio (Δ ≈ 0.13) and optimal-solution probability (Δ ≈ 0.16) over the transverse-field baseline. Direct method-and-scope hit on Y1's QAOA programme.
The realization of universal control in hybrid oscillator-qubit quantum processors enables the systematic design and implementation of quantum algorithms. However, the algorithmic development for such platforms remains at an early stage. While the Quantum Approximate Optimization Algorithm (QAOA) has been extensively studied in both continuous-variable (CV) and discrete-variable (DV) quantum systems, its development in the hybrid CV-DV setting remains limited. In this paper, we propose a hardware-native non-Abelian mixer for QAOA on hybrid CV-DV quantum processors and develop a corresponding hybrid ansatz for the Max-Cut problem.
Evaluating Parameter Transfer in FALQON Across Graph Families
- Authors: A. dos Passos Fumaco, M. V. Reballo, F. A. C. de Barros, G. F. Thomaz, E. I. Duzzioni (Eldorado / UFSC, Brazil)
- arXiv: 2605.29917
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y1 (method — parameter scheduling / transfer for shallow QAOA-family algorithms on 3-regular MaxCut), Y3 (method — parameter-search efficiency)
- Why it matters: Direct cousin of Y1's iterative warm-start, on the same canonical 3-regular MaxCut benchmark. Shows that FALQON feedback schedules transfer almost losslessly from cheap 8-node donors to larger recipients when the recipient is dense, but suffer in sparse cross-family settings. Combining Y1's iterative refinement on top of transfer is a natural follow-up.
We evaluate FALQON parameter transfer for Max-Cut, transferring sequences from small donors (n ∈ {8,10,12}) to 14-node recipients. Using 3-regular and Erdős–Rényi families, we show that transfer success is dictated by the recipient graph, not the donor. Transfer excels for dense recipients — achieving high approximation ratios regardless of the donor — but remains challenging in sparse cross-family cases. Crucially, performance is highly resilient to donor size, with 8-node donors matching larger instances. Thus, cheap small graphs can provide robust parameters for larger targets, significantly reducing the measurement overhead of the feedback loop.
Quantitative semidefinite certificates for ground-state energies of Pauli Hamiltonians
- Authors: Igor Klep (Ljubljana), Nando Leijenhorst, Victor Magron (LAAS-CNRS)
- arXiv: 2605.29959
- Category: new submission — Quantum Physics (quant-ph); Optimization and Control (math.OC)
- Score: 8/10 (HIGH)
- Overlaps with: Y5 (method — SDP / SoS relaxations for Pauli Hamiltonians; complementary certificate rates for the same problem class Y5 attacks computationally)
- Why it matters: First explicit finite-level convergence rates for NPA / Lasserre hierarchies on k-local Pauli Hamiltonians, with error bounded by Krawtchouk roots
C(k) ξd+1n,4/n, dimension-independent in n,d. Methodologically complementary to Y5's Pauli-sparse Gibbs-state SDP solver — that paper gives speed, this one gives accuracy guarantees.
The k-local Hamiltonian problem is a central model for quantum many-body systems and Hamiltonian complexity. Semidefinite programming and noncommutative sum-of-squares hierarchies provide systematic certificates for ground-state energies, but existing finite-convergence results give no quantitative guarantee on the accuracy of the low hierarchy levels accessible in computation. We prove explicit finite-level convergence rates for these hierarchies in the Pauli setting.
Moderately relevant (score 5–7) — 4 papers
Quantum optimization beyond QUBO for industrial logistics and scheduling
- Authors: J. F. R. Hernandez, P. Nikacevic, E. Solano, C. Onah, A. Guin, A.-C. Voigt, A. Dalal
- arXiv: 2605.30252
- Category: new submission — Quantum Physics (quant-ph)
- Score: 6/10 (MED)
- Overlaps with: Y2 (scope — constrained binary optimisation, qubit-efficient encodings), Y3 (scope — end-to-end resource analysis for industrial-scale optimisation), Y4 (scope — cardinality-style constraints in vehicle routing)
- Why it matters: Studies HUBO (higher-order unconstrained binary optimisation) for vehicle routing, scheduling, and assembly-line problems with bias-field digitised counterdiabatic quantum optimisation. The encoding-vs-circuit-depth trade-off (HUBO reduces qubits but increases higher-order terms) parallels Y2's quasi-binary encoding analysis.
The increasing complexity of industrial scheduling and transport routing problems motivates the study of alternative optimization formulations and computational paradigms. In this work, we study how higher-order unconstrained binary optimization (HUBO) formulations of such problems map onto quantum optimization workflows in both noisy and fault-tolerant regimes. We consider three representative logistics and manufacturing use cases and formulate each as a HUBO problem.
High-Fidelity ROI CT Reconstruction with Limited Quantum Resources via Hybrid Classical-Quantum Refinement
- Authors: Hyunju Lee, Jeonghwa Lee, Kyungtaek Jun
- arXiv: 2605.29472
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y4 (method — classical-quantum hybrid for hard combinatorial subproblems; analogous to ADMM splitting), Y3 (scope — QUBO-based optimisation in a noisy regime)
- Why it matters: A two-stage hybrid framework where a classical coarse reconstruction stabilises a QUBO-formulated quantum optimisation restricted to a region of interest. The architectural pattern (classical preconditioner + quantum solver for a hard residual) is the same shape as Y4's Grover-ADMM split.
Quantum optimization for computed tomography (CT) reconstruction is constrained by the number of binary variables required for image representation. We propose a hybrid region-of-interest (ROI) refinement framework in which a coarse global image is first reconstructed by classical or quantum tomographic methods, and quantum optimization is then applied only to the selected ROI through a residual projection-image formulation. This strategy reduces the effective QUBO size while preserving high-fidelity reconstruction in the target region.
Verifying Adversarial Robustness in Quantum Machine Learning: from theory to physical validation via a software tool
- Authors: Ji Guan, Mingsheng Ying
- arXiv: 2605.29877
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y5 (method — SDP-based tightest bound), Y6 (scope — NISQ superconducting hardware benchmark)
- Why it matters: SDP-based optimal robustness certificate for QML models, benchmarked on a 20-qubit superconducting processor. The SDP machinery is the same family Y5 dequantises; the hardware benchmark is in the same regime as Y6's PBR experiment.
Certifying the robustness of QML models, particularly on NISQ hardware, is a fundamental step toward trustworthy quantum AI. The core of our framework is a fidelity-based robustness lower bound computable directly from the measurement outcome distribution. The optimal bound can be computed via semidefinite programming (SDP). We provide an efficient formal verification framework, VeriQR (the first dedicated QML robustness verification tool), and the first experimental benchmark of quantum adversarial robustness on a 20-qubit superconducting processor.
On the question of noise as a resource in quantum computing
- Authors: J. Montes, F. Borondo, G. G. Carlo
- arXiv: 2605.30026
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y3 (conclusion — noise/quantum-advantage interplay), Y6 (scope — NISQ noise channel analysis)
- Why it matters: Argues that non-unital noise (amplitude damping) combined with a universal gate set induces volume expansion on the manifold of pure states, accelerating approach to Haar-like behaviour. Directly relevant to Y3's discussion of when noise precludes vs. enables quantum advantage.
Noise is usually regarded as the main obstacle to achieving a scalable quantum advantage, but recent evidence in quantum reservoir computing suggests that certain channels can, in appropriate regimes, improve performance. We propose a geometric mechanism to explain how non-unital noise applied together with a universal gate set leads to a faster approach to Haar-like distributions of the final states. We find that noise of this kind induces an effective volume expansion on the manifold of pure states.
Tangential (score 1–4) — 3 papers
- 2605.29181 · score 3/10 · A Variational Quantum Algorithm for Nonlinear Finite Element Analysis of Hyperelastic Materials — VQA in the QAOA-adjacent family, but the application (FEA on hyperelastic continuum) is far from combinatorial optimisation.
- 2605.29242 · score 3/10 · Hybrid Gaussian-exponential zero-noise extrapolation for periodic circuits — Error-mitigation methodology benchmarked on Trotterised Ising and Grover; tangentially relevant to Y3/Y6's NISQ noise modelling.
- 2605.30261 · score 3/10 · Qubit-efficient variational algorithm for nuclear structure — VQE on IBM hardware with three qubit-mapping strategies; relevant only as another NISQ-on-Eagle benchmark.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 9 | 2605.30234 | Non-Abelian Mixer for QAOA on Hybrid CV-DV Processors | Y1, Y2 (method) | link |
| 8 | 2605.29917 | FALQON Parameter Transfer Across Graph Families | Y1, Y3 (method) | link |
| 8 | 2605.29959 | SDP Certificates for Pauli Hamiltonian Ground States | Y5 (method) | link |
| 6 | 2605.30252 | Quantum Optimization Beyond QUBO for Logistics | Y2, Y3, Y4 (scope) | link |
| 5 | 2605.29472 | Hybrid Classical-Quantum CT Refinement (QUBO) | Y3, Y4 (method) | link |
| 5 | 2605.29877 | Verifying Adversarial Robustness in QML (SDP) | Y5, Y6 (method/scope) | link |
| 5 | 2605.30026 | Noise as a Resource in Quantum Computing | Y3, Y6 (conclusion/scope) | link |
| 3 | 2605.29181 | VQA for Nonlinear FEA of Hyperelastic Materials | VQA-adjacent | link |
| 3 | 2605.29242 | Hybrid Gaussian-Exponential ZNE for Periodic Circuits | NISQ (Y3/Y6) | link |
| 3 | 2605.30261 | Qubit-Efficient VQE for Nuclear Structure on IBM HW | NISQ (Y6) | link |