quant-ph digest — 2026-06-10
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 + 64 cross = 123 entries)
Coverage: all 123 entries scored. 10 relevant (score ≥ 1); 113 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 HIGH-scoring papers in today's announce cycle. Deep-analysis pass skipped.
Moderately relevant (score 5–7) — 5 papers
Efficient thermalization and universal quantum computing with quantum Gibbs samplers
- Authors: Cambyse Rouzé, Daniel Stilck França, Álvaro M. Alhambra
- arXiv: 2403.12691
- Category: cross submission — Quantum Physics (quant-ph); Mathematical Physics (math-ph)
- Score: 7/10 (MED)
- Overlaps with: Y5 — method axis (quantum Gibbs-state preparation / Pauli-sparse thermalization). Author overlap: Daniel Stilck França is a Y5 coauthor.
- Why it matters: Proves a dissipative evolution thermalizes to the Gibbs state in time polynomial in system size for any Lieb-Robinson Hamiltonian (high-T), and equates the low-T regime to BQP — the exact quantum-Gibbs-sampling primitive Y5 leverages for structured Goemans-Williamson/SDP relaxations. Direct collaborator authorship makes this a strong read-and-cite candidate.
The preparation of thermal states of matter is a crucial task in quantum simulation. In this work, we prove that a recently introduced, efficiently implementable dissipative evolution thermalizes to the Gibbs state in time scaling polynomially with system size at high enough temperatures for any Hamiltonian that satisfies a Lieb-Robinson bound, such as local Hamiltonians on a lattice. Furthermore, we show the efficient adiabatic preparation of the associated purifications or ``thermofield double'' states. These results establish the efficient preparation of high-temperature Gibbs states and their purifications. In the low-temperature regime, we show that implementing this family of dissipative evolutions for in…
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 axis (Grover / amplitude amplification with structured registers).
- Why it matters: Shows the quadratic Grover speedup survives when the oracle is the only global operator and all diffusion acts locally on non-overlapping partitions — a structural reworking of the amplitude-amplification machinery Y4 builds its cardinality-constrained search around, with up to 51–96% non-oracle depth reductions.
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…
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: 6/10 (MED)
- Overlaps with: Y4 — method axis (Grover partial search, oracle-query-complexity optimality, global-local-global rotation schedule).
- Why it matters: A control-theoretic (Pontryagin maximum principle) proof that the GRK partial-search algorithm is optimal in the large-block limit, yielding a "global-local-global" bang-bang structure — directly informative for how Y4 counts and schedules Grover rotations over structured feasible blocks.
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…
Inference of maximum parsimony phylogenetic trees with model-based classical and quantum methods
- Authors: Jiawei Zhang, Yibo Chen, Yang Zhou, Jun-Han Huang
- arXiv: 2508.00468
- Category: cross submission — Quantum Physics (quant-ph)
- Score: 6/10 (MED)
- Overlaps with: Y2 / Y3 / Y4 — scope axis (NP-hard constrained combinatorial optimization solved with quantum solvers) + method axis (compact, variable-efficient discrete-optimization encodings).
- Why it matters: Designs three optimization models for classical and quantum solvers, with a "branch-based" model that drastically cuts variable and constraint counts — squarely parallel to Y2's quasi-binary encoding philosophy of shrinking qubit/variable footprints for constrained combinatorial problems, with quantum simulations finding exact optima on small instances.
The maximum parsimony phylogenetic tree reconstruction problem is NP-hard, presenting a computational bottleneck for classical computing and motivating the exploration of emerging paradigms like quantum computing. To this end, we design three optimization models compatible with both classical and quantum solvers. Our method directly searches the complete solution space of all possible tree topologies and ancestral states, thereby avoiding the potential biases associated with pre-constructing candidate internal nodes. Among these models, the branch-based model drastically reduces the number of variables and explicit constraints through a specific variable definition, providing a novel modeling approach effective…
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 axis (quantum Gibbs-state preparation, KMS detailed balance, end-to-end complexity).
- Why it matters: Proves that KMS-detailed-balance system-bath interactions converge to the Gibbs state regardless of the Lamb shift, with an end-to-end
O(ε⁻¹)Gibbs-preparation complexity — the thermal-state-preparation substrate that underlies Y5's quantum-Gibbs approach to SDP/GW relaxations.
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…
Tangential (score 1–4) — 5 papers
- 2604.15441 · score 3/10 · Quantum computation at the edge of chaos — VQA trainability / barren-plateau mitigation via a topological-entanglement-entropy regularizer; method-adjacent to the QAOA/VQA optimization trainability concerns in Y1/Y3.
- 2604.14319 · score 3/10 · Warring Contextualities — Provably Classical vs Provably Nonclassical — reconciles Kochen-Specker and Spekkens contextuality into a classicality/nonclassicality hierarchy; PBR-adjacent ontological-models foundations (Y6).
- 2604.15427 · score 2/10 · Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment — classical-simulation / non-dequantizability of a quantum-advantage experiment; conclusion-axis adjacency to Y5's quantum-vs-classical framing.
- 2604.15214 · score 2/10 · Optimal algorithmic complexity of inference in quantum kernel methods — encodes a weighted sum as one observable and applies amplitude estimation for a quadratic speedup; shares the amplitude-amplification primitive with Y4.
- 2604.16051 · score 2/10 · Comment on "A General Framework for Constructing Local Hidden-state Models to Determine the Steerability" — hidden-state / ontological-model construction methodology; foundations-adjacent to Y6's PBR ontic/epistemic test.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 7 | 2403.12691 | Quantum Gibbs samplers thermalization | Y5 (method; Y5 coauthor) | link |
| 6 | 2604.15435 | Quantum search without global diffusion | Y4 (method) | link |
| 6 | 2604.15886 | GRK partial-search optimality | Y4 (method) | link |
| 6 | 2508.00468 | Phylogenetic trees via quantum solvers | Y2/Y3/Y4 (scope+method) | link |
| 5 | 2604.15616 | KMS detailed-balance Gibbs prep | Y5 (method) | link |
| 3 | 2604.15441 | Quantum computation at edge of chaos | Y1/Y3 (method, VQA) | link |
| 3 | 2604.14319 | Warring contextualities | Y6 (foundations) | link |
| 2 | 2604.15427 | TNBP cannot simulate quantum echoes | Y5 (conclusion) | link |
| 2 | 2604.15214 | Quantum kernel inference complexity | Y4 (method, amp. est.) | link |
| 2 | 2604.16051 | Comment: local hidden-state models | Y6 (foundations) | link |