quant-ph digest — 2026-06-18

Generated 2026-06-18 · 62 entries scored · 4 relevant

Scored against Yuan's research programme (Y1–Y6):

Source

arXiv listing: https://arxiv.org/list/quant-ph/new — announce cycle Wednesday, 17 June 2026 (47 new + 15 cross = 62 entries; 45 replacements ignored).

Coverage: all 62 entries scored. 4 relevant (score ≥ 1); 58 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 this announce cycle. No portfolio/QAOA-core, Grover-cardinality, SDP/Goemans-Williamson, or PBR-foundations submissions today. Deep-analysis pass skipped.

Moderately relevant (score 5–7) — 1 paper

Asymptotically Optimal Circuit Depth for Diagonal Unitary Synthesis and Compilation on Two-Dimensional Grids

Diagonal unitaries are a fundamental but resource-intensive class of quantum operations, arising as the phase separators of QAOA and the time-evolution blocks of Hamiltonian simulation. Under all-to-all connectivity their optimal depth is established, but on nearest-neighbor hardware general-purpose compilers fall back on heuristic search, which yields no analyzable cost bound and becomes intractable at the very sizes where depth is the bottleneck. We address synthesis and compilation jointly. On the synthesis side, we develop a Gray-Path Framework (GPF) that realizes any $n$-qubit diagonal unitary in asymptotically optimal $R_z$ and CNOT depth $O(2^n/n)$ without ancillas.

Tangential (score 1–4) — 3 papers

Summary table

ScorearXiv IDShort titleOverlapsarXiv
62606.17589Diagonal unitary synthesis (QAOA phase separators)Y1/Y2/Y3 · methodlink
42606.17357Pulse-optimised VQE (Barnes group)Y3 · method/grouplink
32606.18161Hamiltonian interpolation symmetry analysisY1/Y3 · method (adiabatic)link
32606.17095VQE quantum bootstrap embeddingY3 · method (variational)link