quant-ph digest — 2026-06-07
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; 46 replacements excluded by design).
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) — 0 papers
No papers in today's announce cycle scored in the HIGH bucket — no portfolio/QAOA, Grover-cardinality, SDP/Goemans–Williamson, or PBR/foundations direct hits. 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: 6/10 (MEDIUM)
- Overlaps with: Y4 — method (Grover / quantum amplitude amplification with structured search registers)
- Why it matters: Shows the quadratic speedup survives when the oracle is the only global operator and the diffusion is replaced by local operations on non-overlapping partitions — directly relevant to Y4's Grover-over-structured-feasible-spaces construction, where the feasible set factorises and a partition-local diffusion could cut circuit depth.
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 dy
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: 6/10 (MEDIUM)
- Overlaps with: Y5 — method (quantum Gibbs-state preparation)
- Why it matters: Provides a rigorous weak-coupling Gibbs-state preparation algorithm with KMS detailed balance that converges regardless of the Lamb-shift structure. Y5's quantum SDP / Goemans–Williamson speed-up hinges on preparing Pauli-sparse Gibbs states, so a more robust, time-bounded thermalization primitive is a candidate subroutine to benchmark against.
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. Our result sho
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: 5/10 (MEDIUM)
- Overlaps with: Y4 — method (Grover search; partial/block search optimality)
- Why it matters: Proves the long-conjectured optimality of the GRK partial-search algorithm via a Pontryagin-maximum-principle time-optimal control formulation. The same control-theoretic framing of Grover dynamics could sharpen the rotation-count bounds (O(√(C(n,k)/M))) in Y4's cardinality-constrained 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
Tangential (score 1–4) — 3 papers
- 2604.15693 · score 4/10 · Observable-Guided Generator Selection for Improving Trainability in Quantum Machine Learning — casts Pauli-string generator selection as a binary optimization favoring anti-commuting generators (scope overlap with QUBO/binary optimization); trainability/barren-plateau angle is adjacent to QAOA ansatz design (Y1).
- 2604.15441 · score 3/10 · Quantum computation at the edge of chaos — "quantum sparsity" regularizer (topological entanglement entropy) to mitigate barren plateaus in VQAs; tangential to QAOA trainability/parameter-landscape themes in Y1–Y3.
- 2604.16051 · score 2/10 · Comment on "A General Framework for Constructing Local Hidden-state Models to Determine the Steerability" — hidden-variable/hidden-state ontological-model construction; PBR-adjacent foundations (Y6), but a methodological-attribution comment rather than a no-go result.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 6 | 2604.15435 | Quantum Search without Global Diffusion | Y4 (method: Grover/AA) | link |
| 6 | 2604.15616 | KMS detailed-balance Gibbs-state thermalization | Y5 (method: Gibbs prep) | link |
| 5 | 2604.15886 | Optimality of Grover-Radhakrishnan-Korepin | Y4 (method: Grover) | link |
| 4 | 2604.15693 | Observable-guided generator selection (QML) | Y1/Y4 (binary opt; trainability) | link |
| 3 | 2604.15441 | Quantum computation at the edge of chaos | Y1–Y3 (VQA trainability) | link |
| 2 | 2604.16051 | Comment on local hidden-state models | Y6 (foundations) | link |