quant-ph digest — 2026-06-17
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 for Monday, 20 April 2026)
Coverage: all 77 entries scored. 7 relevant (score ≥ 1); 70 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) — 0 papers
None today. No paper matched a Y1–Y6 method family or conclusion strongly enough for the HIGH bucket — no QAOA, portfolio, Goemans–Williamson/SDP, ADMM, or PBR work in this cycle. Deep-analysis pass skipped accordingly.
Moderately relevant (score 5–7) — 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: 7/10 (MED)
- Overlaps with: Y4 — method axis (Grover / amplitude-amplification family). Restructures the diffusion operator so only the oracle is global; adjacent to Y4's Grover-over-structured-feasible-space construction, though applied to generic search rather than cardinality-constrained optimisation.
- Why it matters: Shows the quadratic speed-up survives when diffusion acts locally on non-overlapping partitions — directly relevant to engineering Grover circuits over factorisable feasible sets, the regime Y4 exploits for cardinality constraints.
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. We present a recursive construction that, when the initial and target states both decompose as tensor products over these chosen partitions, admits an exact closed-form solution for the algorithm's dynamics.
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: 6/10 (MED)
- Overlaps with: Y4 — method axis (Grover search). Proves optimality of the GRK partial-search algorithm via a time-optimal control / Pontryagin formulation; same Grover method family Y4 builds on, but for partial (block) search rather than constrained binary optimisation.
- Why it matters: The bang-bang / switching-function machinery for proving Grover-type optimality is a tool Yuan could borrow when arguing rotation-count optimality of the Y4 cardinality-Grover algorithm.
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. We formulate partial search as a time-optimal control problem and apply the Pontryagin maximum principle to derive the switching-function dynamics, establish the bang-bang structure of regular extremals.
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: 5/10 (MED)
- Overlaps with: Y5 — method axis (quantum Gibbs states). Rigorous guarantees for preparing Gibbs states via engineered Lindbladians; Gibbs-state preparation is the engine of Y5's Pauli-sparse SDP relaxations, though this paper targets thermalisation accuracy rather than Goemans–Williamson relaxations.
- Why it matters: A cleaner Gibbs-state-preparation primitive with KMS detailed balance could tighten the cost/accuracy trade-offs underlying Y5's Gibbs-state SDP solver.
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. Importantly, this remains true even when the approximate Lindbladian differs substantially from the ideal Davies generator and the Lamb shift term does not commute with the thermal state.
Tangential (score 1–4) — 4 papers
- 2604.15441 · score 3/10 · Quantum computation at the edge of chaos — VQA trainability / barren-plateau mitigation via a topological-entanglement-entropy regulariser; adjacent to the variational-optimisation machinery behind QAOA (Y1/Y3) but not constrained combinatorial optimisation.
- 2604.16051 · score 3/10 · Comment on "A General Framework for Constructing Local Hidden-state Models to Determine the Steerability" — ontological / hidden-state-model foundations, PBR-adjacent to Y6 but on steering rather than the epistemic/ontic no-go tested in Y6.
- 2604.15427 · score 2/10 · Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment — classical-simulation-vs-quantum-advantage debate (conclusion axis), but for OTOC sampling, not optimisation advantage or dequantisation of the Y kind.
- 2604.15693 · score 2/10 · Observable-Guided Generator Selection for Improving Trainability in QML — casts generator selection as a binary optimisation over anti-commuting Pauli strings; only a passing scope link to constrained binary optimisation, core topic is QML trainability.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 7 | 2604.15435 | Quantum Search without Global Diffusion | Y4 (method: Grover) | link |
| 6 | 2604.15886 | Optimality of Grover-Radhakrishnan-Korepin | Y4 (method: Grover) | link |
| 5 | 2604.15616 | KMS detailed balance Gibbs-state prep | Y5 (method: Gibbs states) | link |
| 3 | 2604.15441 | Quantum computation at the edge of chaos | Y1/Y3 (method: VQA trainability) | link |
| 3 | 2604.16051 | Comment on local hidden-state models | Y6 (scope: foundations) | link |
| 2 | 2604.15427 | TNBP cannot simulate Google echoes | conclusion: advantage debate | link |
| 2 | 2604.15693 | Observable-guided generator selection (QML) | scope: binary optimisation | link |