quant-ph digest — 2026-04-25
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 (58 new + 11 cross = 69 entries, announce cycle Friday 2026-04-24)
Coverage: all 69 entries scored. 11 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) — 2 papers
Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization
- Authors: Tristan Zaborniak, Prashanti Priya Angara, Vikram Khipple Mulligan, Hausi Müller, Ulrike Stege
- arXiv: 2604.21123
- Category: new submission — Quantum Physics (quant-ph)
- Score: 9/10 (HIGH)
- Overlaps with: Y2 (method — qubit-efficient ⌈log₂ k⌉ encoding for constrained optimization, QAOA-compatible); Y4 (scope — structured-feasibility optimization with cardinality/label-count objective)
- Why it matters: Direct methodological neighbour to Y2's quasi-binary encoding, but using a novel lexicographic penalty instead of a hard mixer — a clean alternative worth a head-to-head comparison. The gate-count theorems (Θ(C_num²|V|+C_num|E|) one-hot → Θ(C_num·log C_num·|E|) log) are exactly the sort of analysis Yuan should be citing in future QAOA-encoding work.
We introduce a qubit- and gate-efficient higher-order unconstrained binary optimization (HUBO) encoding for graph partitioning problems requiring label-count minimization. This widely applicable class of problems includes minimum graph coloring, minimum k-cut, and community detection. To the best of our knowledge, this is the first work to address the optimization versions of these problems in a quantum setting, rather than only their decision counterparts. Our construction encodes each k-valued vertex variable using ⌈log₂ k⌉ bits and employs a novel lexicographic penalty system that implicitly minimizes partition count without requiring dedicated indicator variables. [truncated]
Partial oracles quantum algorithm framework — Part I: Analysis of in-place operations
- Authors: Fintan M. Bolton
- arXiv: 2604.21788
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y4 (method — Grover-family quantum search algorithm; targets exponential speedup)
- Why it matters: Extends Grover search by replacing single-bit with multi-bit oracles (f:{0,1}ⁿ→{0,1}ⁿ) and introducing a new "reciprocal transform" that replaces the second Grover reflection. Theoretical speedup bound is exponential; this Part I establishes the circuit construction for in-place (classically-reversible) oracles, with SHA-256 primitives as worked examples. Same regime as Y4 — Grover-based search over structured feasible spaces aiming beyond quadratic.
The partial oracles framework is a quantum search algorithm that has the potential to exceed the quadratic speedup of Grover's algorithm, up to a theoretical maximum of an exponential speedup. Until now, however, the framework has lacked an explicit method for constructing the operator that represents the search iteration. In this paper, we provide the missing construction, for the special case of an oracle function definable using only in-place operations (that is, where the calculated result of the oracle function can be read just from the qubits in the search index). The restriction to in-place operations means that the current work does not yet exhibit quantum advantage. [truncated]
Moderately relevant (score 5–7) — 3 papers
A rigorous quasipolynomial-time classical algorithm for SYK thermal expectations
- Authors: Alexander Zlokapa
- arXiv: 2604.21089
- Category: new submission — quant-ph; cond-mat.dis-nn; cs.DS; math-ph
- Score: 7/10 (MED)
- Overlaps with: Y5 (method — classical algorithms for quantum Gibbs-state observables; conclusion — dequantization of a candidate for quantum advantage)
- Why it matters: Directly parallels Y5's theme: rigorous classical/quantum-inspired algorithms for Gibbs-state observables. Zlokapa proves a quasipolynomial classical algorithm for SYK local thermal expectations at constant temperature, ruling out (at those temperatures) one of the best-known candidates for quantum advantage in simulation. The new "Wick-pair cluster expansion" is a tool Yuan may want to know about for SDP-via-Gibbs-state follow-ups.
Estimating local observables in Gibbs states is a central problem in quantum simulation. While this task is BQP-complete at asymptotically low temperatures, the possibility of quantum advantage at constant temperature remains open. The Sachdev-Ye-Kitaev (SYK) model is a natural candidate: at any constant temperature, its Gibbs states have polynomial quantum circuit complexity and are not described by Gaussian states. […] Despite this, we give a rigorous proof of a quasipolynomial-time classical algorithm that estimates SYK local thermal expectations at sufficiently high constant temperature. Our result introduces a new Wick-pair cluster expansion that we expect to be broadly useful for disordered quantum many-body systems.
Efficient Classical Simulation of Heuristic Peaked Quantum Circuits
- Authors: David Kremer, Nicolas Dupuis
- arXiv: 2604.21908
- Category: new submission — Quantum Physics (quant-ph)
- Score: 6/10 (MED)
- Overlaps with: Y5 (conclusion — dequantization of a proposed verifiable-advantage demonstration)
- Why it matters: Dequantizes the recent Gharibyan et al. peaked-circuit advantage claim (56-qubit Quantinuum H2). A tensor-network MPO method "unswaps" the obfuscated permutation and extracts the peak bitstring on a single GPU in ≈1 hour — half the hardware runtime. Fits Y5's conclusion-space: repeated demonstrations that structured "quantum-advantage" circuits admit polynomial classical attacks.
Peaked quantum circuits, whose output distribution is sharply concentrated on a single bitstring, have emerged as a promising candidate for verifiable quantum advantage. Recent work by Gharibyan et al. arXiv:2510.25838 claimed heuristic quantum advantage using peaked circuits executed on Quantinuum's 56-qubit H2 processor. […] We show that these circuits can be efficiently simulated classically. We describe a method that efficiently performs a full tensor network contraction, allowing near-exact sampling and extraction of the peaked bitstring. The method exploits the mirrored structure of the circuit and iteratively cancels both halves into a Matrix Product Operator (MPO), and avoids the obfuscated permutation by greedily reducing the MPO bond dimension.
On the importance of hyperparameters in initializing parameterized quantum circuits
- Authors: Ankit Kulshrestha, Sarvagya Upadhyay
- arXiv: 2604.21266
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y1 (method — initialization of parameterized quantum circuits; adjacent to warm-starting); Y3 (method — layerwise/variational parameter handling)
- Why it matters: Focus is on hyperparameters of the initial-parameter distribution rather than on the distribution itself. Evolutionary search selects hyperparameters that accelerate convergence without worsening barren-plateau variance scaling. Not warm-starting in Y1's sense (no measurement-based feedback), but a complementary "pre-training" technique that could compose with Y1's iterative warm-start.
There has been intensive research on increasing the utility and performance of Parameterized Quantum Circuits (PQCs) in the past couple of years. […] In this paper, we focus on the problem of finding performant initial parameters for a given PQC. Different from previous research that focuses on finding the right distribution, we focus on finding the hyperparameters for any given distribution. To that end we introduce an evolutionary-search based algorithm that finds optimal hyperparameter given a PQC and quantum task. Our empirical results indicate that our algorithm consistently leads to selection of performant initial parameters tuned specifically to the ansatz and the quantum task leading to faster convergence and performance. More importantly, our algorithm does not negatively affect the barren plateau phenomenon.
Tangential (score 1–4) — 6 papers
- 2604.21863 · score 4/10 · Replay-buffer engineering for noise-robust quantum circuit optimization — RL for circuit optimization under hardware noise; warm-started replay from noiseless trajectories is a loose parallel to Y1's warm-start idea, noise-aware optimization adjacent to Y3.
- 2604.20961 · score 3/10 · Ansatz expressivity and optimization in VQE simulations of the transverse-field Ising model — variational-quantum ansatz design methodology; adjacent to QAOA-ansatz choices in Y1/Y3.
- 2604.21458 · score 3/10 · HEOM-in-Calibration-Loop: non-Markovian bath signatures in SC-qubit tune-up — non-Markovian noise channel in SC-qubit calibration; loosely relevant to Y3's NISQ thermal-relaxation regime discussion.
- 2604.21705 · score 3/10 · Testing Spontaneous Collapse Models with Coulomb-Mediated Squeezing — CSL-parameter bounds via steady-state squeezing; foundations-testing in the same spirit as Y6's PBR test, though orthogonal technique.
- 2604.21919 · score 3/10 · Algorithmic locality via provable convergence in quantum tensor networks — provable classical algorithms (BP + cluster expansion) for PEPS observables; same "quantum-inspired classical with provable guarantees" family as Y5.
- 2604.21630 · score 2/10 · The KMS and GNS spectral gap of quantum Markov semigroups — mathematical physics of quantum Markov dynamics; tangential to Y5's use of Gibbs states.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 9 | 2604.21123 | Qubit/gate-efficient HUBO encoding for graph partitioning | Y2, Y4 | link |
| 8 | 2604.21788 | Partial oracles framework (Part I, in-place) | Y4 | link |
| 7 | 2604.21089 | Quasipolynomial classical alg for SYK Gibbs expectations | Y5 | link |
| 6 | 2604.21908 | Classical simulation of peaked quantum circuits | Y5 | link |
| 5 | 2604.21266 | Hyperparameters for PQC initialization | Y1, Y3 | link |
| 4 | 2604.21863 | Replay-buffer RL for noise-robust circuit optimization | Y1, Y3 | link |
| 3 | 2604.20961 | VQE ansatz expressivity for TFIM | Y1, Y3 | link |
| 3 | 2604.21458 | HEOM calibration loop for SC qubits | Y3 | link |
| 3 | 2604.21705 | Testing spontaneous collapse models | Y6 | link |
| 3 | 2604.21919 | Tensor-network belief propagation with provable bounds | Y5 | link |
| 2 | 2604.21630 | KMS/GNS spectral gap of quantum Markov semigroups | Y5 | link |