quant-ph digest — 2026-06-03
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. 12 relevant (score ≥ 1); 65 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
- Authors: John Burke, Ciaran Mc Goldrick (Trinity College Dublin)
- arXiv: 2604.15435
- Category: new submission — Quantum Physics (quant-ph); Data Structures and Algorithms (cs.DS)
- Score: 8/10 (HIGH)
- Overlaps with: Y4 — method (Grover / amplitude amplification with structured tensor-product decomposition)
- Why it matters: Replaces the global diffusion operator in Grover-style search with local partial-diffusion reflections acting only on a tensor-product partition of the qubit register, retaining the O(√N) oracle complexity when each partition has ≥ log2(log2 N) qubits. The non-oracle circuit depth drops 51%–96% on 18-qubit experiments, with 9% extra oracle calls. Directly relevant to Y4's Grover-based cardinality-constrained binary optimisation: this is a drop-in candidate for reducing the inner Grover diffusion cost that Y4 flags as the depth bottleneck on near-term hardware.
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.
Asymptotic optimality of the Grover–Radhakrishnan–Korepin algorithm
- Authors: Kun Zhang, Kang-Yuan Chen, Xiao-Hui Wang (Northwest U., Xi'an), Vladimir Korepin (Stony Brook)
- arXiv: 2604.15886
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y4 — method (Grover-family algorithm, structured partial-search optimality proof)
- Why it matters: Closes the long-standing conjecture that the GRK global–local–global ordering is asymptotically optimal for partial search, by recasting the partial-search query-count minimisation as a time-optimal control problem on a 3D invariant subspace and applying Pontryagin's maximum principle to exclude all alternative bang–bang switching patterns. The proof technique — PMP applied to a Grover-operator-family ordering question — is a clean blueprint for proving optimality of structured Grover orderings, of direct interest to Y4's algorithm design.
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.
Moderately relevant (score 5–7) — 3 papers
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 (Gibbs-state preparation algorithms used as the core SDP-relaxation primitive)
- Why it matters: Y5's exponential SDP speed-ups depend on efficient quantum Gibbs-state preparation. This paper proves that engineering the system–bath interaction so the approximate Lindbladian satisfies KMS detailed balance gives a fixed point arbitrarily close to the Gibbs state in the weak-coupling limit, even when the Lamb shift is non-commuting and the approximate Lindbladian deviates substantially from the ideal Davies generator. A potentially useful algorithmic refinement for the Gibbs-state subroutine in Y5's pipeline.
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.
Quantum computation at the edge of chaos
- Authors: Tomohiro Hashizume, Zhengjun Wang, Frank Schlawin, Dieter Jaksch
- arXiv: 2604.15441
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y1/Y3 — method (barren-plateau mitigation in VQAs / QAOA-family parameter-landscape design)
- Why it matters: Introduces "quantum sparsity" as a principle for VQA training, using topological entanglement entropy as a regulariser of the variational cost. Targets the barren-plateau problem that limits QAOA scaling and parameter-landscape geometry — the same regime where Y1's warm-starting and Y3's layerwise optimisation operate. Method overlap is on the parameter/landscape-design side, not on QAOA itself.
A key challenge in classical machine learning is to mitigate overparameterization by selecting sparse solutions. We translate this concept to the quantum domain, introducing quantum sparsity as a principle based on minimizing quantum information shared across multiple parties. This allows us to address fundamental issues in quantum data processing and convergence issues such as the barren plateau problem in Variational Quantum Algorithm (VQA). We propose a practical implementation of this principle using the topological Entanglement Entropy (TEE) as a cost function regularizer.
Observable-Guided Generator Selection for Improving Trainability in Quantum Machine Learning
- Authors: Hiroshi Ohno
- arXiv: 2604.15693
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y1/Y3 — method (Pauli-string generator design for parameterised unitaries, gradient/Hessian-aware ansatz selection)
- Why it matters: Selects Pauli-string generators for parameterised unitaries by a binary-optimisation criterion favouring mutually anti-commuting generators (large gradient, suppressed Hessian interference). Adjacent to QAOA mixer/cost-Hamiltonian design and to the parameter-landscape/trainability concerns of warm-started QAOA (Y1) and layerwise QAOA (Y3). Not a portfolio paper, but the generator-selection framing is a method-level handle on the same problem QAOA wrestles with.
To study generator design for parameterized unitaries in quantum machine learning (QML), we propose an observable-guided generator selection algorithm for n-qubit Pauli-string generator pools. The proposed method selects generators based on two criteria: maintaining large first-order sensitivity in the gradients and suppressing second-order interference in the Hessian matrix. Under a restricted setting with Pauli-string observables and candidate generators, the selection problem can be formulated as a binary optimization problem that favors mutually anti-commuting generators.
Tangential (score 1–4) — 7 papers
- 2604.16179 · score 4/10 · Quantum-Inspired Simulation of 2D Turbulent Rayleigh-Bénard Convection — MPS-based quantum-inspired classical solver for turbulence; thematic parallel to Y5's dequantisable Gibbs-SDP construction (both demonstrate strong quantum-inspired classical performance on previously-quantum-targeted problems), but methods are otherwise unrelated.
- 2604.15666 · score 3/10 · Explainable quantum regression algorithm with encoded data structure — hybrid VQA mentioning combinatorial optimisation in its motivation; method (interpretable variational regression with explicit data-table encoding) is not QAOA but lives in the same VQA family Y1–Y3 operate on.
- 2604.15603 · score 2/10 · A Game Theoretic Approach for Optimizing Quantum Error Budget Distribution — fault-tolerant compiler resource estimation via potential-game Nash equilibria; touches Y3-style end-to-end quantum-resource accounting but for FT rather than NISQ-QAOA, so only loosely scope-relevant.
- 2604.16190 · score 2/10 · Coherence dynamics in Simon's quantum algorithm — coherence-resource analysis of a specific quantum algorithm; same quantum-algorithm-family flavour as Y4 but no method or scope overlap with Grover-amplification.
- 2604.16051 · score 2/10 · Comment on "A General Framework for Constructing Local Hidden-state Models to Determine the Steerability" — attribution/comment paper on LHS-model construction; PBR-adjacent foundations (Y6) but no methodological tie.
- 2604.16144 · score 2/10 · Gravitationally induced wave-function collapse from dynamical bifurcation — gravity-induced collapse model; foundations-of-QM territory tangential to Y6's PBR test.
- 2604.16276 · score 2/10 · Aziz and Howl's Gravity-Induced Entanglement Channel is Essentially Classical Mechanics — critique of a gravity-induced entanglement claim; foundations-of-QM, distant cousin of Y6's no-go-test work.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 8 | 2604.15435 | Quantum Search without Global Diffusion | Y4 (Grover / amplitude amplification) | link |
| 8 | 2604.15886 | Asymptotic optimality of GRK | Y4 (Grover-family optimality proof) | link |
| 6 | 2604.15616 | KMS Detailed Balance Gibbs thermalisation | Y5 (Gibbs-state preparation primitive) | link |
| 5 | 2604.15441 | Quantum computation at the edge of chaos | Y1/Y3 (barren plateau / VQA training) | link |
| 5 | 2604.15693 | Observable-guided generator selection | Y1/Y3 (Pauli-string generator design) | link |
| 4 | 2604.16179 | Quantum-inspired MPS Rayleigh-Bénard | Y5 (quantum-inspired classical performance) | link |
| 3 | 2604.15666 | Explainable quantum regression | Y1–Y3 (hybrid VQA family) | link |
| 2 | 2604.15603 | Game-theoretic FT error budget | Y3 (resource accounting, loose) | link |
| 2 | 2604.16190 | Coherence dynamics in Simon's algorithm | Y4 (quantum-algorithm family, loose) | link |
| 2 | 2604.16051 | Comment on LHS-models steerability | Y6 (foundations, loose) | link |
| 2 | 2604.16144 | Gravity-induced wavefunction collapse | Y6 (foundations, loose) | link |
| 2 | 2604.16276 | Aziz-Howl GIE critique | Y6 (foundations, loose) | link |