quant-ph digest — 2026-05-15
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; arXiv announce cycle: 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) — 1 paper
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: 8/10 (HIGH)
- Overlaps with: Y5 — method (quantum Gibbs-state preparation, the SDP-solver subroutine)
- Why it matters: This paper improves the end-to-end complexity of system-bath-interaction Gibbs-state preparation from
1/ε4to1/εby exploiting exact KMS detailed balance to cancel the noncommuting-Lamb-shift bias at constant interaction time. Y5's quantum SDP relaxation has Gibbs-state cost as its inner subroutine, so a linear-in-1/ε bound propagates directly into a tighter end-to-end SDP runtime.
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.
Moderately relevant (score 5–7) — 2 papers
Quantum Search without Global Diffusion
- Authors: (see arXiv listing)
- arXiv: 2604.15435
- Category: new submission — Quantum Physics (quant-ph); Data Structures and Algorithms (cs.DS)
- Score: 6/10 (MED)
- Overlaps with: Y4 — method (Grover / amplitude amplification variants for structured search spaces)
- Why it matters: Shows the quadratic Grover speedup can be preserved when only the oracle is global and diffusion acts locally on tensor-product partitions of the search register, with closed-form optimal angles. For Y4's cardinality-constrained Grover search, where the feasible space has a tensor-/lattice-like structure, this could potentially give a route to gate-depth-reduced amplitude amplification variants.
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.
Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithm
- Authors: (see arXiv listing)
- arXiv: 2604.15886
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y4 — method (Grover variant; partial-search lower bound techniques)
- Why it matters: Proves the optimality of the Grover-Radhakrishnan-Korepin partial-search algorithm in the large-block limit, formulating partial search as a time-optimal control problem and applying Pontryagin's maximum principle. The control-theoretic lower-bound techniques here could inform tighter complexity analyses for Y4's cardinality-Grover algorithm in regimes where one wants to find a block of feasible solutions rather than a single bitstring.
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.
Tangential (score 1–4) — 4 papers
- 2604.15441 · score 3/10 · Quantum computation at the edge of chaos — VQA-adjacent: proposes "quantum sparsity" (topological entanglement entropy as a regularizer) to mitigate barren plateaus in variational quantum algorithms; method-adjacent to QAOA layerwise optimization in Y1–Y3 but not directly applied to combinatorial optimization.
- 2604.15693 · score 3/10 · Observable-Guided Generator Selection for Improving Trainability in Quantum Machine Learning — VQA generator-design heuristics for trainability; conceptually adjacent to mixer/Hamiltonian design in QAOA (Y2's hard mixer, Y1's warm-start operator), though framed for QML not optimization.
- 2604.16051 · score 3/10 · Comment on "A General Framework for Constructing Local Hidden-state Models to Determine the Steerability" — LHS / LHV foundations adjacency to Y6 (PBR test of epistemic models); same quantum-foundations family, different non-classicality witness.
- 2604.16144 · score 2/10 · Gravitationally induced wave-function collapse from dynamical bifurcation — foundations of QM; tangential to Y6 only as a sibling line on the boundary between classical and quantum descriptions (objective collapse rather than ontic vs epistemic).
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 8 | 2604.15616 | KMS detailed balance — system-bath Gibbs preparation | Y5 method | link |
| 6 | 2604.15435 | Quantum Search without Global Diffusion | Y4 method | link |
| 5 | 2604.15886 | Asymptotic optimality of GRK partial-search Grover | Y4 method | link |
| 3 | 2604.15441 | Quantum computation at the edge of chaos (TEE/VQA) | Y1–Y3 method-adjacent | link |
| 3 | 2604.15693 | Observable-guided generator selection (QML trainability) | Y1–Y3 method-adjacent | link |
| 3 | 2604.16051 | Comment on local hidden-state models for steerability | Y6 foundations | link |
| 2 | 2604.16144 | Gravity-induced wave-function collapse | Y6 foundations | link |