quant-ph digest — 2026-06-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)
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
No highly relevant papers in today's announce cycle. (Deep-analysis pass skipped — runs only on HIGH-bucket papers.)
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). A structural variant that preserves the quadratic speedup with only a global oracle and otherwise local reflections.
- Why it matters: Y4's Grover-based cardinality-constrained solver relies on amplitude amplification over a structured feasible set; a localised-diffusion construction could lower the per-iteration gate cost or map naturally onto partitioned constraint structure.
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 dynami…
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: 5/10 (MED)
- Overlaps with: Y5 — method (quantum Gibbs-state preparation). Provides a thermal-state-preparation algorithm with provable closeness to the Gibbs state in the weak-coupling limit.
- Why it matters: Y5's GW/SDP speed-ups are bottlenecked by preparing Pauli-sparse quantum Gibbs states; a Lamb-shift-robust, time-bounded thermalization primitive is directly relevant to the cost and accuracy of that subroutine.
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 sho…
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, block/partial structure). Proves optimality of partial Grover search (identify the block containing the target) via a time-optimal control formulation.
- Why it matters: Y4 searches a structured feasible space of fixed-cardinality strings; partial-search optimality bounds are useful when only the constraint-satisfying block — not the exact optimum — needs to be located, and the Pontryagin-control framing is a transferable analysis tool.
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 ban…
Tangential (score 1–4) — 4 papers
- 2604.15441 · score 3/10 · Quantum computation at the edge of chaos — quantum-sparsity principle for VQA trainability / barren-plateau mitigation; QAOA (Y1–Y4) is a VQA, so the trainability angle is adjacent, but the framing (TEE, edge of chaos) is far from constrained optimisation.
- 2604.15920 · score 3/10 · Local qubit invariants on quantum computer — circuits for directly measuring local-unitary / entanglement invariants, demonstrated on the IBM Quantum Platform; scope-only overlap with Y6 (foundational quantity measured on IBM superconducting hardware).
- 2604.15693 · score 2/10 · Observable-Guided Generator Selection for Improving Trainability in QML — Pauli-string generator selection cast as a binary optimisation favouring anti-commuting generators; tangential to QAOA trainability and to binary-optimisation formulations.
- 2604.16051 · score 2/10 · Comment on "A General Framework for Constructing Local Hidden-state Models…" — local hidden-state / steerability methodology dispute; foundations-adjacent to Y6's ontic/epistemic theme only.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 6 | 2604.15435 | Quantum Search without Global Diffusion | Y4 (method: Grover/AA) | link |
| 5 | 2604.15616 | KMS Detailed Balance Gibbs-state prep | Y5 (method: Gibbs prep) | link |
| 5 | 2604.15886 | Optimality of GRK partial search | Y4 (method: Grover) | link |
| 3 | 2604.15441 | Quantum computation at edge of chaos | Y1–Y4 (VQA trainability) | link |
| 3 | 2604.15920 | Local qubit invariants on QC | Y6 (scope: IBM hardware) | link |
| 2 | 2604.15693 | Observable-guided generator selection | Y1–Y4 (trainability) | link |
| 2 | 2604.16051 | Comment on LHS steerability models | Y6 (foundations) | link |