quant-ph digest — 2026-04-20
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, Monday 20 April 2026 announce cycle)
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) — 0 papers
None today — no QAOA / portfolio / SDP / cardinality / PBR papers in this cycle.
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 (MED)
- Overlaps with: Y4 — method (Grover / quantum amplitude amplification, structured search)
- Why it matters: Shows the quadratic Grover speedup is preserved when the oracle is the only global operator and all diffusion acts locally on non-overlapping partitions of the search register. Directly relevant to Y4's Grover-with-structured-feasible-space construction, and could enable hardware-frugal variants of the cardinality-constrained Grover routine.
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
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 (MED)
- Overlaps with: Y5 — method (quantum Gibbs-state / thermal-state preparation)
- Why it matters: Proves high-accuracy convergence to the Gibbs state under KMS detailed balance with time-bounded system–bath interactions, robust to the Lamb-shift term. This is precisely the Gibbs-state-preparation primitive Y5 relies on for its structured Goemans–Williamson SDP relaxations; tighter preparation guarantees could sharpen Y5's resource estimates.
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
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 (MED)
- Overlaps with: Y4 — method (Grover search family / partial search optimality)
- Why it matters: Proves asymptotic optimality of the Grover–Radhakrishnan–Korepin partial-search algorithm via a time-optimal control formulation. Method-family overlap with Y4's Grover-based approach; a useful reference on the fundamental limits of Grover-type speedups for structured/partial search.
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
Tangential (score 1–4) — 4 papers
- 2604.15441 · score 4/10 · Quantum computation at the edge of chaos — VQA trainability / barren-plateau mitigation via quantum sparsity — adjacent to QAOA optimisation-landscape concerns in Y1/Y3.
- 2604.15427 · score 3/10 · Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment — Classical-simulability assessment of a quantum-advantage claim (TNBP vs Google echoes) — dequantisation-flavoured, loosely touching Y5's quantum-inspired theme.
- 2604.15693 · score 3/10 · Observable-Guided Generator Selection for Improving Trainability in Quantum Machine Learning with a $ \mathfrak{g} $-Purity Interpretation under Restricted Settings — QML generator-selection cast as a binary optimisation favouring anti-commuting generators; trainability angle tangential to QAOA landscapes.
- 2604.16051 · score 2/10 · Comment on "A General Framework for Constructing Local Hidden-state Models to Determine the Steerability" — Foundations comment on local-hidden-state/hidden-variable model construction (steering) — PBR/epistemic-adjacent to Y6.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 6 | 2604.15435 | Quantum search w/o global diffusion | Y4 method | link |
| 6 | 2604.15616 | KMS detailed-balance Gibbs prep | Y5 method | link |
| 5 | 2604.15886 | GRK partial-search optimality | Y4 method | link |
| 4 | 2604.15441 | Quantum computation at edge of chaos | Y1/Y3 adj | link |
| 3 | 2604.15427 | TNBP can't simulate Google echoes | Y5 adj | link |
| 3 | 2604.15693 | Observable-guided generator selection | QAOA adj | link |
| 2 | 2604.16051 | Comment: local-hidden-state models | Y6 adj | link |