quant-ph digest — 2026-06-05

Generated 2026-06-05 · 77 entries scored · 9 relevant

Scored against Yuan's research programme (Y1–Y6):

Source

arXiv listing: https://arxiv.org/list/quant-ph/new (59 new + 18 cross = 77 entries)

Coverage: all 77 entries scored. 9 relevant (score ≥ 1); 68 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

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

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) — 1 papers

Overcoming the Lamb Shift in System-Bath Models via KMS Detailed Balance: High-Accuracy Thermalization with Time-Bounded Interactions

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 s

Tangential (score 1–4) — 6 papers

Summary table

ScorearXiv IDShort titleOverlapsarXiv
82604.15435Quantum Search without Global DiffusionY4link
82604.15886Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithmY4link
72604.15616Overcoming the Lamb Shift in System-Bath Models via KMS Detailed Balance: High-Accuracy Th…Y5link
42604.15441Quantum computation at the edge of chaosY1/Y2/Y3link
32604.15666Explainable quantum regression algorithm with encoded data structureY2link
32604.15693Observable-Guided Generator Selection for Improving Trainability in Quantum Machine Learni…Y1/Y2link
32604.16023MacWilliams Identities for Intrinsic Quantum CodesY5link
22604.16051Comment on "A General Framework for Constructing Local Hidden-state Models to Determine th…Y6link
12604.16144Gravitationally induced wave-function collapse from dynamical bifurcationY6link