quant-ph digest — 2026-06-09
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) — 0 papers
No HIGH-scoring papers in today's announce cycle. Deep-analysis pass skipped.
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, partitioned search registers)
- Why it matters: Shows the quadratic speedup survives when only the oracle is global and all other operations act locally on non-overlapping partitions — directly relevant to Y4's Grover algorithm over the structured cardinality-constrained feasible space, where partitioning the search register could cut diffusion cost.
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.
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, the algorithmic primitive underpinning the Gibbs-state SDP relaxations)
- Why it matters: A rigorous guarantee that a KMS-detailed-balance Lindbladian converges to the Gibbs state in the weak-coupling limit despite Lamb-shift terms — Y5's GW speed-ups rest on preparing/sampling quantum Gibbs states, so improved thermalization guarantees feed straight into that pipeline.
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.
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 family; partial / block search and its query-time optimality)
- Why it matters: Proves the GRK partial-search algorithm is asymptotically optimal via a time-optimal control / Pontryagin formulation. Y4's Grover-based cardinality-constrained solver lives in the same algorithmic family; the bang-bang control framing is a transferable lens for analysing rotation counts.
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.
Tangential (score 1–4) — 3 papers
- 2604.15427 · score 3/10 · Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment — conclusion-axis brush with Y3/Y5: a classical (de)quantization attempt failing to match a quantum-advantage claim, though the scope (random-circuit OTOCs) is far from optimisation.
- 2604.16051 · score 3/10 · Comment on "A General Framework for Constructing Local Hidden-state Models to Determine the Steerability" — foundations/hidden-variable-model territory adjacent to Y6's ontic/epistemic PBR test, but on steering rather than ψ-ontology.
- 2604.15693 · score 2/10 · Observable-Guided Generator Selection for Improving Trainability in QML — incidental contact with Y2/Y5: generator selection cast as a binary optimisation over anti-commuting Pauli-string generators, but the context is QML trainability, not constrained optimisation.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 6 | 2604.15435 | Quantum Search without Global Diffusion | Y4 (method) | link |
| 6 | 2604.15616 | KMS detailed-balance Gibbs thermalization | Y5 (method) | link |
| 5 | 2604.15886 | Optimality of Grover-Radhakrishnan-Korepin | Y4 (method) | link |
| 3 | 2604.15427 | TNBP can't simulate Google Quantum Echoes | Y3/Y5 (conclusion) | link |
| 3 | 2604.16051 | Comment on local hidden-state / steerability | Y6 (foundations) | link |
| 2 | 2604.15693 | Observable-guided generator selection (QML) | Y2/Y5 (scope) | link |