quant-ph digest — 2026-05-29
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 from the Friday 29 May 2026 announce cycle)
Coverage: all 103 entries scored. 23 relevant (score ≥ 1); 80 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
Evaluating Parameter Transfer in FALQON Across Graph Families
- Authors: Alisson dos Passos Fumaco, Marcos Vinicius Reballo, Fernando Augusto Caletti de Barros, Gabriel Fernandes Thomaz, Eduardo I. Duzzioni
- arXiv: 2605.29917
- Category: new submission — Quantum Physics (quant-ph)
- Score: 9/10 (HIGH)
- Overlaps with: Y1 (warm-started QAOA, 3-regular MaxCut), Y3 (layerwise parameter optimisation) — method axis
- Why it matters: FALQON is a QAOA sibling whose feedback gains are the analogue of QAOA angles; small-donor parameter transfer is exactly the kind of measurement-cost reduction Y1 targets with iterative warm-starting. Worth a direct citation in the next QAOA warm-starting paper.
We evaluate FALQON parameter transfer for Max-Cut, transferring sequences from small donors ($n \in \{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.
Non-Abelian Mixer for QAOA on Hybrid Oscillator-Qubit Quantum Processors
- Authors: Thinh Le, Hansika Weerasena, Jianqing Liu
- arXiv: 2605.30234
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y2 (hard-mixer QAOA), Y6 (superconducting hardware) — method axis
- Why it matters: Replaces the default Σ X_i mixer with a hardware-native non-Abelian QSP block on GKP-encoded oscillator-qubit pairs; the "mixer is the design surface" framing parallels Y2 directly.
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. We evaluate the proposed ansatz on unweighted Erdős-Rényi grap…
Moderately relevant (score 5–7) — 8 papers
Quantitative semidefinite certificates for ground-state energies of Pauli Hamiltonians
- Authors: Igor Klep, Nando Leijenhorst, Victor Magron
- arXiv: 2605.29959
- Category: new submission — Quantum Physics (quant-ph); Optimization and Control (math.OC)
- Score: 7/10 (MED)
- Overlaps with: Y5 (SDP relaxations + Pauli sparsity) — method axis
- Why it matters: Proves explicit finite-level convergence rates for NPA-type SDP hierarchies on Pauli Hamiltonians — closely related to the SDP-relaxation machinery Y5 exploits via Pauli-sparse Gibbs states.
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. For $k$-local Hamiltonians whose Pauli expansion contains only even-weight terms, we show that both the NPA-type lower-bound hierarchy and the upper-bound hierarchy on the spectral minimum have error at most $C(k)\xi^{n,4}_{…
Quantum optimization beyond QUBO for industrial logistics and scheduling
- Authors: Juan F. R. Hernandez, Pavle Nikacevic, Enrique Solano, Chinonso Onah, Agneev Guin, … (2 more)
- arXiv: 2605.30252
- Category: new submission — Quantum Physics (quant-ph)
- Score: 6/10 (MED)
- Overlaps with: Y2 (constrained combinatorial), Y3 (end-to-end optimisation), Y4 (cardinality / combinatorial) — scope axis
- Why it matters: HUBO formulations for industrial scheduling and vehicle routing with hybrid quantum-classical workflows — adjacent to all three optimisation Y-papers, though no portfolio or cardinality focus.
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. This captures process intricacies, such as highly correlated assembly-line scheduling rules, which are difficult to express faithfully with the standard quadratic (QUBO) form, while at the same time reducing the number of bina…
Hybrid Gaussian-exponential zero-noise extrapolation for periodic circuits
- Authors: Tao Wang, Yun Shang
- arXiv: 2605.29242
- Category: new submission — Quantum Physics (quant-ph)
- Score: 6/10 (MED)
- Overlaps with: Y3 (noise regimes), Y4 (Grover), Y6 (NISQ hardware) — scope axis
- Why it matters: Error mitigation tailored to periodic circuits; explicitly tested on Trotterised Ising and Grover. Y3 specifically argues thermal-relaxation noise precludes advantage; this paper attacks that exact regime.
Zero-noise extrapolation provides a practical means of suppressing gate errors in current noisy intermediate-scale quantum hardware. The accuracy of the zero-noise estimate depends sensitively on the fidelity of the assumed noise model to the actual error scaling. This work introduces a hybrid Gaussian-exponential extrapolation scheme tailored for quantum circuits with periodic structure, which are ubiquitous in quantum algorithms. Under Pauli diagonal errors, by constructing and analyzing an approximate Markov process for the transfer of Pauli operators, we prove a central limit theorem: the noise amplification factor weakly approaches a log-normal distribution, which motivates augmenting t…
Exponentially Fast Solution State Preparation for the Heat Equation and its use for Option Pricing
- Authors: Gumaro Rendon, Stepan Smid, Sarvagya Upadhyay
- arXiv: 2605.28950
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y3 (quantum finance) — scope axis
- Why it matters: Quantum-finance scope overlap with Y3; algorithmic angle is heat-equation state prep, not portfolio.
In this work, we present the methods necessary to price an important set of derivatives on a quantum device while offering an advantage over existing classical methods. The methods developed here, in conjunction with ~\cite{GumaroS2026}, also provide an exponential advantage in requirement of qubits when pricing some option contracts with path-dependent payoff compared to state-of-the-art quantum Monte Carlo methods.
Elfs, transducers and quantum walks
- Authors: Simon Apers, Jérémie Roland, Yuxin Zhang
- arXiv: 2605.30013
- Category: new submission — Quantum Physics (quant-ph); Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)
- Score: 5/10 (MED)
- Overlaps with: Y4 (Grover-type structured search) — method axis
- Why it matters: Quantum-walk speed-ups for search and sampling, in the same family of algorithmic primitives as the structured-Grover machinery in Y4.
Electric flow sampling (elfs) is a new tool in the quantum walk toolbox and a useful primitive for solving search, sampling and optimization problems on graphs. We refine this tool by showing that there exists a zero-error transducer for implementing elfs. More broadly, we establish a zero-error transducer for reflecting about the intersection of two subspaces, yielding an errorfree transducer version of the effective gap lemma. Building on this result, we obtain improved quantum walk algorithms for estimating effective resistances and span program witness sizes with an optimal error scaling, and for sampling from the random walk arrival distribution, via the composition of many elfs. Using …
Alternative adiabatic quantum dynamics with algorithmic applications
- Authors: Joseph Cunningham, Jérémie Roland
- arXiv: 2605.30110
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y1 (QAOA = discretised adiabatic), Y3 (algorithm scaling) — method axis
- Why it matters: Alternative gate-based realisations of adiabatic evolution with derived "adiabatic theorems"; adjacent to QAOA design because QAOA is one such discretised adiabatic alternative.
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the adiabatic theorem. We propose several alternative processes that achieve the same goal, but can easily be implemented on a gate-based quantum computer without the overhead of simulating time-dependent Hamiltonian evolution. We give a general framework for deriving `adiabatic' theorems for these processes. As an application, we give various algorithms for solving the Quantum Linear Systems Problem (QLSP) with optimal scaling in the condition number. One of these a…
Overcoming the Matrix-Product-State Encoding Barrier via DMRG-Guided Probabilistic Imaginary-Time Evolution
- Authors: Masari Watanabe, Hirofumi Nishi, Taichi Kosugi, Shinji Tsuneyuki, Yu-ichiro Matsushita
- arXiv: 2605.30141
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y3 (hybrid quantum-classical workflows) — method axis
- Why it matters: Three-stage hybrid quantum-classical pipeline with deterministic scheduling — parallels the dual-annealing + layerwise hybrid workflow Y3 advocates.
Ground-state preparation is a fundamental task in quantum simulation, because the overlap of the prepared state with the true ground state significantly affects the overall cost of subsequent quantum algorithms. We propose a three-stage framework in which a matrix product state (MPS) of an $N$-site system obtained by the density-matrix renormalization group (DMRG) is loaded onto an $N$-qubit quantum register through an optimization-free matrix product disentangler (MPD) encoding circuit, and the residual error is then reduced by probabilistic imaginary-time evolution (PITE). We demonstrate that the central-bond Schmidt rank of intermediate states during MPS encoding grows logistically with t…
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: Y3 (hybrid optimisation, QUBO) — method axis
- Why it matters: Hybrid pipeline where classical reconstruction stabilises the global background and quantum optimisation refines a QUBO-encoded ROI; the "quantum-where-it-helps" pattern resembles Y3.
Quantum optimization for computed tomography (CT) reconstruction is constrained by the number of binary variables required for image representation, making direct whole-image quantum reconstruction difficult for large or structurally complex objects. We propose a hybrid region-of-interest (ROI) refinement framework in which a coarse global image is first reconstructed by quantum tomographic reconstruction (QTR) and quantum compressed sensing tomographic reconstruction (QCSTR), filtered backprojection (FBP), or simultaneous algebraic reconstruction technique (SART), and quantum optimization is then applied only to the selected ROI through a residual projection-image formulation. This strategy…
Tangential (score 1–4) — 13 papers
- 2605.29872 · score 4/10 · Claim against Measurement: Statistical Artefacts in Quantum Error Mitigation Benchmarks — Statistical artefacts in QEM benchmarks — parameter sensitivity + drift can flip ZNE conclusions; relevant to NISQ benchmarking sanity (Y3 noise regimes, Y6 hardware claims).
- 2605.29723 · score 4/10 · Treewidth-Aware Gate Cut Selection for Reducing Transpilation Overhead on Superconducting Quantum Devices — TW2S graph-only gate-cut selection for IBM superconducting devices — NISQ transpilation overhead, adjacent to Y6 hardware scope.
- 2605.30026 · score 4/10 · On the question of noise as a resource in quantum computing — Non-unital noise as a resource for faster Haar mixing — Y3-adjacent noise-regime story.
- 2605.29944 · score 4/10 · Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation — Rank-width FPT quantum-circuit simulation matching tensor-network bounds — dequantisation / classical-simulation angle adjacent to Y5.
- 2605.28986 · score 4/10 · Comparing Classical Simulation and Sample-Based Learning of Quantum Systems: Learning the Hardness of Quantum Systems from Samples — Learning vs simulation hardness with autoregressive nets — empirical dequantisation probe of entanglement / non-stabilizerness.
- 2605.29521 · score 3/10 · Ground-state estimation of the Heisenberg model on frustrated lattices with Sample-based Krylov Quantum Diagonalization — Sample-based Krylov quantum diagonalization for frustrated Heisenberg — quantum-algorithm scope, not combinatorial optimisation.
- 2605.29589 · score 3/10 · Bell's theorem: why probability factorisation fails — Bell's theorem via counterfactual single-spin sequential measurements — foundations adjacent to Y6.
- 2605.29181 · score 3/10 · A Variational Quantum Algorithm for Nonlinear Finite Element Analysis of Hyperelastic Materials — VQA for nonlinear FEM hyperelasticity — generic NISQ VQA scope.
- 2605.30217 · score 2/10 · Programmable Dissipation via Partial Quantum Error Correction — Programmable dissipation via partial QEC — open-system simulation primitive.
- 2605.29514 · score 2/10 · Non-Clifford Crosstalk Noise in Surface Codes Using Hybrid Stabilizer-Tensor Network Methods — Coherent crosstalk on surface code via hybrid stabilizer-tensor — QEC noise modelling.
- 2605.29775 · score 2/10 · Incompleteness is necessary for activation of nonlocality without entanglement — Incompleteness conditions for nonlocality-without-entanglement activation — LOCC foundations.
- 2605.30238 · score 2/10 · Indefinite Causal Order Reverses the Real-Complex Hierarchy — Indefinite causal order reverses real-vs-complex hierarchy — process-matrix foundations.
- 2605.30067 · score 2/10 · Quantum Mechanics: Problems and Paradoxes — Quantum Mechanics: Problems and Paradoxes — graduate-level foundations textbook.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 9 | 2605.29917 | Evaluating Parameter Transfer in FALQON Across Graph Families | Y1, Y3 | link |
| 8 | 2605.30234 | Non-Abelian Mixer for QAOA on Hybrid Oscillator-Qubit Quantum Processors | Y2, Y6 | link |
| 7 | 2605.29959 | Quantitative semidefinite certificates for ground-state energies of Pauli Hamiltonians | Y5 | link |
| 6 | 2605.29242 | Hybrid Gaussian-exponential zero-noise extrapolation for periodic circuits | Y3, Y4, Y6 | link |
| 6 | 2605.30252 | Quantum optimization beyond QUBO for industrial logistics and scheduling | Y2, Y3, Y4 | link |
| 5 | 2605.28950 | Exponentially Fast Solution State Preparation for the Heat Equation and its use for Opt… | Y3 | link |
| 5 | 2605.29472 | High-Fidelity ROI CT Reconstruction with Limited Quantum Resources via Hybrid Classical… | Y3 | link |
| 5 | 2605.30013 | Elfs, transducers and quantum walks | Y4 | link |
| 5 | 2605.30110 | Alternative adiabatic quantum dynamics with algorithmic applications | Y1, Y3 | link |
| 5 | 2605.30141 | Overcoming the Matrix-Product-State Encoding Barrier via DMRG-Guided Probabilistic Imag… | Y3 | link |
| 4 | 2605.28986 | Comparing Classical Simulation and Sample-Based Learning of Quantum Systems: Learning t… | — | link |
| 4 | 2605.29723 | Treewidth-Aware Gate Cut Selection for Reducing Transpilation Overhead on Superconducti… | — | link |
| 4 | 2605.29872 | Claim against Measurement: Statistical Artefacts in Quantum Error Mitigation Benchmarks | — | link |
| 4 | 2605.29944 | Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation | — | link |
| 4 | 2605.30026 | On the question of noise as a resource in quantum computing | — | link |
| 3 | 2605.29181 | A Variational Quantum Algorithm for Nonlinear Finite Element Analysis of Hyperelastic M… | — | link |
| 3 | 2605.29521 | Ground-state estimation of the Heisenberg model on frustrated lattices with Sample-base… | — | link |
| 3 | 2605.29589 | Bell's theorem: why probability factorisation fails | — | link |
| 2 | 2605.29514 | Non-Clifford Crosstalk Noise in Surface Codes Using Hybrid Stabilizer-Tensor Network Me… | — | link |
| 2 | 2605.29775 | Incompleteness is necessary for activation of nonlocality without entanglement | — | link |
| 2 | 2605.30067 | Quantum Mechanics: Problems and Paradoxes | — | link |
| 2 | 2605.30217 | Programmable Dissipation via Partial Quantum Error Correction | — | link |
| 2 | 2605.30238 | Indefinite Causal Order Reverses the Real-Complex Hierarchy | — | link |