quant-ph digest — 2026-05-24
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)
Coverage: all 77 entries scored. 6 relevant (score ≥ 1); 71 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
Quantum Search without Global Diffusion
- Authors: John Burke, Ciaran Mc Goldrick
- arXiv: 2604.15435
- Category: new submission — Quantum Physics (quant-ph); Data Structures and Algorithms (cs.DS)
- Score: 8/10 (HIGH)
- Overlaps with: Y4 (method — Grover-family algorithm with structured non-oracle operations), Y1/Y2 (method — recursive/locality-preserving construction for amplitude amplification)
- Why it matters: Proves the global diffusion operator in Grover-style amplitude amplification can be entirely replaced by local reflections when the state-preparation unitary and target factorise across a partition, preserving O(√N) oracle complexity while cutting non-oracle circuit depth by 51%–96% at 18 qubits. The principal-angle-collapse technique (exponentially large eigenspaces reduce to a scalar 2×2 problem) is exactly the structural machinery worth checking against Y4's cardinality-constrained Grover.
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 th
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 — Grover-family asymptotic optimality), Y1 (method — multi-stage Grover-like protocols)
- Why it matters: Settles the long-conjectured optimality of the GRK partial-search algorithm by recasting the problem as a time-optimal control problem on 𝔰𝔬(3), then applying Pontryagin's maximum principle to prove the global–local–global (XYX) structure is uniquely optimal. The control-theoretic framework is a methodological template that could be adapted to argue (in)optimality of Y4's cardinality-constrained Grover.
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 dynamic
Moderately relevant (score 5–7) — 0 papers
None today.
Tangential (score 1–4) — 4 papers
- 2604.15441 · score 3/10 · Quantum computation at the edge of chaos — Introduces "quantum sparsity" via a topological-entanglement-entropy regulariser for VQAs, targeting barren plateaus. Method-adjacent to QAOA optimisation (Y1/Y2/Y3) but distinct mechanism (TEE regularisation, not warm-starting / mixer design).
- 2604.15693 · score 3/10 · Observable-Guided Generator Selection for Improving Trainability in QML with a 𝔤-Purity Interpretation — Selects parameterised-unitary generators from a Pauli-string pool favouring mutually anti-commuting generators. Method-adjacent to QAOA hard-mixer design (Y1/Y2), but the application is QML trainability rather than constrained optimisation.
- 2604.16051 · score 2/10 · Comment on "A General Framework for Constructing Local Hidden-state Models to Determine the Steerability" — Brief priority/attribution comment on local-hidden-state model construction. Foundations-adjacent to Y6 (ontic/epistemic / hidden-state models) but a procedural note, not a result.
- 2604.16283 · score 2/10 · Boson correlations are spurious for classical states — Argues that boson correlations from Glauber–Sudarshan-classical states are a manifestation of Simpson's paradox via symmetry breaking. Touches on nonclassicality and "quantum advantage" foundations, conceptually adjacent to Y6 but distinct framework (P-representation, not PBR/ontic models).
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 8 | 2604.15435 | Quantum Search without Global Diffusion | Y4, Y1/Y2 (method) | link |
| 8 | 2604.15886 | Asymptotic optimality of GRK algorithm | Y4, Y1 (method) | link |
| 3 | 2604.15441 | Quantum computation at the edge of chaos | Y1/Y2/Y3 (VQA method-adjacent) | link |
| 3 | 2604.15693 | Observable-Guided Generator Selection (QML) | Y1/Y2 (Pauli mixer-adjacent) | link |
| 2 | 2604.16051 | Comment on LHS models for steerability | Y6 (foundations-adjacent) | link |
| 2 | 2604.16283 | Boson correlations spurious for classical states | Y6 (foundations-adjacent) | link |