quant-ph digest — 2026-04-26
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 (59 new + 18 cross = 77 entries; announce cycle Monday 2026-04-20).
Coverage: all 77 entries scored. 13 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) — 3 papers
Quantum Search without Global Diffusion
- Authors: John Burke, Ciaran McGoldrick
- arXiv: 2604.15435
- Category: new submission — Quantum Physics (quant-ph); Data Structures and Algorithms (cs.DS)
- Score: 8/10 (HIGH)
- Overlaps with: Y4 (method): structured-Grover variant — recursive local diffusion preserves O(√N) and the quadratic speedup; Y2 (method, weaker): block-local construction parallels hard-mixer design.
- Why it matters: Local diffusion eliminates the global non-oracle reflection at the heart of Grover/QAA — exactly the depth-bottleneck Y4's structured Grover hits on heavy-hex hardware. Drop-in candidate for a Y4 follow-up.
Quantum search is among the most important algorithms in quantum computing. At its core is quantum amplitude amplification, a technique that achieves a quadratic speedup over classical search by combining two global reflections: the oracle, which marks the target, and the diffusion operator, which reflects about the initial state. We show that this speedup can be preserved when the oracle is the only global operator, with all other operations acting locally on non-overlapping partitions of the search register.
Overcoming the Lamb Shift in System-Bath Models via KMS Detailed Balance: High-Accuracy Thermalization with Time-Bounded Interactions
- Authors: Hongrui Chen, Zhiyan Ding, Ruizhe Zhang
- arXiv: 2604.15616
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y5 (method): improves end-to-end ε-dependence of system-bath quantum Gibbs preparation from ε⁻⁴/ε⁻² to ε⁻¹ — directly tightens Y5's quantum-regime resource estimates.
- Why it matters: Resolves the long-standing Lamb-shift bias in system-bath Gibbs preparation under constant interaction time, giving the best known Õ(ε⁻¹) end-to-end Hamiltonian-evolution complexity. Direct upgrade for Y5's Gibbs-preparation cost model.
We investigate quantum thermal state preparation algorithms based on system-bath interactions and uncover a surprising phenomenon in the weak-coupling regime. We rigorously prove that, if the system-bath interaction is engineered so that the transition part of the approximate Lindbladian generator satisfies the KMS detailed balance condition, then the unique fixed point of the dynamics can be made arbitrarily close to the Gibbs state in the weak-coupling limit, regardless of the structure of the Lamb shift term.
Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithm
- Authors: Kun Zhang, Kang-Yuan Chen, Xiao-Hui Wang, Vladimir Korepin
- arXiv: 2604.15886
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y4 (method/scope): proves asymptotic optimality of Grover–Radhakrishnan–Korepin partial-search via Pontryagin maximum principle — same structured-Grover family as Y4, gives lower bound + reusable PMP toolkit.
- Why it matters: First proof of GRK optimality after 20 years of conjecture; uses Pontryagin maximum principle and three-bang-block compression — a reusable methodology for proving optimality of Y4's Grover-ADMM iteration ordering.
Grover's algorithm is a cornerstone of quantum algorithms and is strictly optimal in oracle-query complexity. While the full search problem admits no further improvement, one may trade accuracy for speed in the partial search problem, where the task is to identify only the block containing the target item. The best known quantum algorithm for the partial search problem is the Grover-Radhakrishnan-Korepin (GRK) algorithm, whose optimality has long been conjectured but not proved. In this work, we prove the optimality of GRK in the large-block limit.
Moderately relevant (score 5–7) — 0 papers
None today.
Tangential (score 1–4) — 10 papers
- 2604.15427 · score 3/10 · Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment — TNBP cannot reproduce Google's quantum echoes — feeds the dequantisation/quantum-advantage debate Y3/Y5 sit in.
- 2604.15441 · score 4/10 · Quantum computation at the edge of chaos — TEE-regularised VQA tackles the same barren-plateau / trainability surface Y1/Y3 navigate (different mechanism).
- 2604.15693 · score 4/10 · Observable-Guided Generator Selection for Improving Trainability in Quantum Machine Learning with a $ \mathfrak{g} $-Purity Interpretation under Restricted Settings — Observable-guided generator selection (anti-commuting Pauli pools) is methodologically adjacent to Y2-style hard mixer design.
- 2604.16051 · score 3/10 · Comment on "A General Framework for Constructing Local Hidden-state Models to Determine the Steerability" — Comment on local hidden-state model construction — same foundational quantum-correlations terrain as Y6.
- 2604.16107 · score 2/10 · Entanglement and photoelectron holography in dissociative photoionization: molecular quantum eraser — Photoelectron–ion entanglement and quantum eraser — foundations adjacent to Y6.
- 2604.16144 · score 2/10 · Gravitationally induced wave-function collapse from dynamical bifurcation — Gravity-induced wavefunction collapse model — foundations adjacent to Y6.
- 2604.16179 · score 4/10 · Quantum-Inspired Simulation of 2D Turbulent Rayleigh-Bénard Convection — Quantum-inspired MPS for 2D turbulence — same "quantum-inspired classical algorithm" theme as Y5's SDP dequantisation, different domain.
- 2604.16190 · score 3/10 · Coherence dynamics in Simon's quantum algorithm — Coherence dynamics analysis of Simon's oracle algorithm — algorithm-analysis sibling to Y4's Grover analysis.
- 2604.16276 · score 2/10 · Aziz and Howl's Gravity-Induced Entanglement Channel is Essentially Classical Mechanics — Critique of gravity-induced entanglement claim — foundations adjacent to Y6.
- 2604.16283 · score 4/10 · Boson correlations are spurious for classical states — Boson correlations as Simpson-paradox spurious effects — touches Y6 (nonclassicality) and Y3 (quantum advantage debates).
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 8 | 2604.15435 | Quantum Search without Global Diffusion | Y4, Y2 | link |
| 8 | 2604.15616 | Overcoming the Lamb Shift in System-Bath Models via KMS Detailed Ba… | Y5 | link |
| 8 | 2604.15886 | Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithm | Y4 | link |
| 4 | 2604.15441 | Quantum computation at the edge of chaos | Y1, Y3 | link |
| 4 | 2604.15693 | Observable-Guided Generator Selection for Improving Trainability in… | Y2 | link |
| 4 | 2604.16179 | Quantum-Inspired Simulation of 2D Turbulent Rayleigh-Bénard Convection | Y5 | link |
| 4 | 2604.16283 | Boson correlations are spurious for classical states | Y6, Y3 | link |
| 3 | 2604.15427 | Tensor Networks with Belief Propagation Cannot Feasibly Simulate Go… | Y3, Y5 | link |
| 3 | 2604.16051 | Comment on "A General Framework for Constructing Local Hidden-… | Y6 | link |
| 3 | 2604.16190 | Coherence dynamics in Simon's quantum algorithm | Y4 | link |
| 2 | 2604.16107 | Entanglement and photoelectron holography in dissociative photoioni… | Y6 | link |
| 2 | 2604.16144 | Gravitationally induced wave-function collapse from dynamical bifur… | Y6 | link |
| 2 | 2604.16276 | Aziz and Howl's Gravity-Induced Entanglement Channel is Essent… | Y6 | link |