quant-ph digest — 2026-05-26
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. 11 relevant (score ≥ 1); 66 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
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: 9/10 (HIGH)
- Overlaps with: Y4 (Grover-based cardinality-constrained BO) — method
- Why it matters: Provides the first proof that GRK partial-search ordering is asymptotically optimal in oracle query complexity, via a Pontryagin-maximum-principle argument on the SO(3) reduction. Direct method anchor for Y4-style Grover-with-structure analyses.
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…
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: 8/10 (HIGH)
- Overlaps with: Y4 (Grover-based cardinality-constrained BO) — method
- Why it matters: Builds a recursive Grover-style amplitude amplification with only per-partition partial diffusers (oracle is the only global op); 51–96% non-oracle depth reduction at ~9% oracle overhead on 18 qubits. Directly relevant to depth budgeting of Y4-style cardinality-constrained Grover algorithms.
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…
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 (Gibbs states for SDP) — method (Gibbs-state preparation)
- Why it matters: Proves that KMS detailed balance is sufficient for Lindbladian Gibbs-state preparation even when Lamb-shift terms violate the ideal Davies generator — a robustness theorem for the quantum Gibbs sampling primitive used in Y5.
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…
Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment
- Authors: Pablo Bermejo, Benjamin Villalonga, Brayden Ware, Guifre Vidal, Aaron Szasz
- arXiv: 2604.15427
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y3 (quantum advantage discussions), Y5 (classical/quantum-inspired baselines) — conclusion
- Why it matters: Confirms via scaling arguments and explicit simulation that tensor-networks-with-belief-propagation cannot match Google's Quantum Echoes claim — a useful entry in the classical-simulation-vs-quantum-advantage ledger that Y3 and Y5 both touch.
In the recent quantum echoes experiment, Google Quantum AI showed that out-of-time-order correlators (OTOCs) for random-circuit time evolution can be measured using a quantum processor more than 10,000x faster than they can be computed to similar accuracy via classical computation. This claim was substantiated by comparison with a variety of state-of-the-art classical simulation methods. One classical simulation method that was not explicitly tested was tensor networks with belief propagation (TNBP). TNBP should be poorly suited to simulating Google's echoes experiment: the states involved are highly entangled, a challenge for tensor network states; and the Willow chip has dense 2D connectiv…
Quantum-Inspired Simulation of 2D Turbulent Rayleigh-Bénard Convection
- Authors: Nis-Luca van Hülst, Mario Guillaume Cecile, Hai-Yen Van, Tomohiro Hashizume, Eugene de Villiers, Dieter Jaksch
- arXiv: 2604.16179
- Category: cross submission — Fluid Dynamics (physics.flu-dyn); Computational Physics (physics.comp-ph); Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y5 (quantum-inspired classical methods) — method
- Why it matters: Applies MPS to 2D buoyancy-driven Rayleigh-Bénard turbulence up to Ra = 10¹⁰ and finds the bond dimension grows without saturation, in contrast to isothermal flows. A useful data point on the limits of tensor-network compression for physics problems — adjacent to Y5's quantum-inspired SDP solvers.
Turbulent thermal convection governs heat transport in systems ranging from stellar interiors to industrial heat exchangers. Two-dimensional Rayleigh-Bénard convection serves as a paradigm for these flows, reproducing key features such as thin boundary layers, large-scale circulation, and sustained plume dynamics. While Matrix Product State (MPS) methods have demonstrated significant compression of isothermal turbulent fields, their application to buoyancy-driven flows with active thermal coupling has remained unexplored. We apply MPS to two-dimensional Rayleigh-Bénard convection with dynamical simulations up to $\mathrm{Ra} = 10^{10}$. An a priori decomposition of DNS snapshots up to $\math…
Tangential (score 1–4) — 6 papers
- 2604.15441 · score 3/10 · Quantum computation at the edge of chaos — Quantum sparsity via topological entanglement entropy as a VQA regulariser to fight barren plateaus — tangential to Y3's QAOA-landscape concerns.
- 2604.16190 · score 2/10 · Coherence dynamics in Simon's quantum algorithm — Coherence dynamics in Simon's algorithm via Tsallis relative entropy — quantum-algorithm-adjacent but not aligned with Y1–Y6 methods.
- 2604.16051 · score 2/10 · Comment on "A General Framework for Constructing Local Hidden-state Models to Determine the Steerability" — Methodological-priority comment on a Jia et al. paper about local hidden-state models for steerability — foundations-adjacent to Y6's PBR test.
- 2604.16276 · score 2/10 · Aziz and Howl's Gravity-Induced Entanglement Channel is Essentially Classical Mechanics — Critique of Aziz & Howl's claimed gravity-induced entanglement channel as essentially classical wavepacket dynamics — foundations-adjacent to Y6's ontic/epistemic discussion.
- 2604.16283 · score 2/10 · Boson correlations are spurious for classical states — Argues boson correlations from classical (Glauber-Sudarshan-positive) states are a Simpson-paradox artifact — quantum-vs-classical advantage foundations.
- 2604.16144 · score 1/10 · Gravitationally induced wave-function collapse from dynamical bifurcation — Wave-function collapse from gravitational-self-interaction dynamical bifurcation — quantum foundations, not directly aligned with Y6's PBR experimental work.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 9 | 2604.15886 | Asymptotic optimality of Grover-Radhakrishnan-Korepin algori… | Y4 | link |
| 8 | 2604.15435 | Quantum Search without Global Diffusion | Y4 | link |
| 6 | 2604.15616 | Overcoming the Lamb Shift in System-Bath Models via KMS Deta… | Y5 | link |
| 5 | 2604.15427 | Tensor Networks with Belief Propagation Cannot Feasibly Simu… | Y3, Y5 | link |
| 5 | 2604.16179 | Quantum-Inspired Simulation of 2D Turbulent Rayleigh-Bénard … | Y5 | link |
| 3 | 2604.15441 | Quantum computation at the edge of chaos | Y3 | link |
| 2 | 2604.16190 | Coherence dynamics in Simon's quantum algorithm | Y4 (algorithms) | link |
| 2 | 2604.16051 | Comment on "A General Framework for Constructing Local Hidde… | Y6-adj | link |
| 2 | 2604.16276 | Aziz and Howl's Gravity-Induced Entanglement Channel is Esse… | Y6-adj | link |
| 2 | 2604.16283 | Boson correlations are spurious for classical states | Y6-adj | link |
| 1 | 2604.16144 | Gravitationally induced wave-function collapse from dynamica… | Y6-adj | link |