quant-ph digest — 2026-05-27
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; listing's internal announce header: Monday, 20 April 2026).
Coverage: all 77 entries scored. 8 relevant (score ≥ 1); 69 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.
Moderately relevant (score 5–7) — 3 papers
Quantum Search without Global Diffusion
- Authors: John Burke, Ciaran McGoldrick
- arXiv: 2604.15435
- Category: new submission — quant-ph; cs.DS
- Score: 7/10 (MED)
- Overlaps with: Y4 — method overlap (Grover / amplitude amplification with structured search space)
- Why it matters: Y4 builds a Grover algorithm whose oracle is restricted to the cardinality-constrained subspace; this paper preserves the quadratic speedup when only the oracle is global and the diffusion is local on partitions. The closed-form recursion for tensor-product initial/target states is exactly the structural regime in which Y4 operates, so the construction may inform tighter rotation counts or shallower mixers for 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 the algorithm's dynamics. This is enabled by an intriguing degeneracy in the principal angles between successive reflections, which collapse to just two distinct values governed by a single recursively…
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 — quant-ph
- Score: 6/10 (MED)
- Overlaps with: Y5 — method overlap (quantum Gibbs-state preparation)
- Why it matters: Y5's GW speed-ups rest on preparing Pauli-sparse Gibbs states efficiently. This paper proves that, in the weak-coupling regime, engineering the transition part of the Lindbladian to satisfy KMS detailed balance drives the fixed point arbitrarily close to the Gibbs state — even when the Lamb shift does not commute with the thermal state. A relaxed sufficient condition for Gibbs preparation is directly useful for the algorithmic backbone of Y5.
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 shows that the role of the KMS detailed balance condition extends well beyond standard Lindbladian dynamics, serving as a general principle for a broader class of dissipative systems.
Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithm
- Authors: Kun Zhang, Kang-Yuan Chen, Xiao-Hui Wang, Vladimir Korepin
- arXiv: 2604.15886
- Category: new submission — quant-ph
- Score: 6/10 (MED)
- Overlaps with: Y4 — method overlap (Grover variants and partial / structured search)
- Why it matters: Proves a long-conjectured optimality result for partial search Grover (GRK), via Pontryagin maximum principle and a global–local–global bang-bang structure. Y4's algorithm uses Grover with O(√(C(n,k)/M)) rotations on a fixed-cardinality subspace; the bang-bang optimality argument is a possible template for proving (or sharpening) the rotation-count claims in Y4, and the partial-search framing parallels "find any feasible solution in the cardinality slice".
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, and exclude non-optimal switching patterns. As a result, we show that the optimal regular extremal has the global-local-global form, which yi…
Tangential (score 1–4) — 5 papers
- 2604.15427 · score 3/10 · Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment — quantum-vs-classical-simulation arena (relevant to Y3's quantum-advantage framing for OTOC-type circuits on superconducting hardware); not optimisation.
- 2604.15920 · score 3/10 · Local qubit invariants on quantum computer — small experimental demonstration on IBM Quantum Platform — scope overlap with Y6's NISQ-on-IBM demonstration genre, but different physics target (LU invariants vs PBR).
- 2604.16144 · score 2/10 · Gravitationally induced wave-function collapse from dynamical bifurcation — foundations of measurement / collapse, adjacent to Y6's ontic-vs-epistemic theme but on the dynamical-collapse side.
- 2604.16051 · score 2/10 · Comment on "A General Framework for Constructing Local Hidden-state Models to Determine the Steerability" — steering / hidden-variable construction, adjacent to Y6 ψ-ontology framework.
- 2604.16276 · score 1/10 · Aziz and Howl's Gravity-Induced Entanglement Channel is Essentially Classical Mechanics — foundations / gravity-induced entanglement debate; only the no-go-style critique resonates faintly with Y6.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 7 | 2604.15435 | Quantum Search without Global Diffusion | Y4 (method: Grover / partition-local diffusion) | link |
| 6 | 2604.15616 | Lamb Shift via KMS Detailed Balance — high-accuracy Gibbs prep | Y5 (method: Gibbs-state preparation) | link |
| 6 | 2604.15886 | Asymptotic optimality of Grover-Radhakrishnan-Korepin | Y4 (method: Grover partial search; Pontryagin optimality) | link |
| 3 | 2604.15427 | TNBP cannot simulate Google's quantum echoes | Y3 (conclusion: classical-vs-quantum simulation gap) | link |
| 3 | 2604.15920 | Local qubit invariants on IBM Quantum Platform | Y6 (scope: small NISQ-on-IBM experiment) | link |
| 2 | 2604.16144 | Gravitationally induced wave-function collapse | Y6 (scope: foundations — collapse / ontology) | link |
| 2 | 2604.16051 | Comment on hidden-state models for steerability | Y6 (scope: foundations — hidden-variable models) | link |
| 1 | 2604.16276 | Aziz/Howl GIE is essentially classical | Y6 (scope: foundations — gravity-induced entanglement debate) | link |