quant-ph digest — 2026-05-21
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 (64 new + 24 cross = 88 entries; announce cycle Wed 20 May 2026)
Coverage: all 88 entries scored. 9 relevant (score ≥ 1); 79 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) — 4 papers
Efficient Fourier-Based Linear Combination of Unitaries and Applications in Quantum Optimization
- Authors: Almudena Carrera Vazquez, Daniel J. Egger, Stefan Woerner (IBM Quantum Zurich)
- arXiv: 2605.18985
- Category: new submission — Quantum Physics (quant-ph)
- Score: 9/10 (HIGH)
- Overlaps with: Y2 (hard XY-mixer / cardinality constraints — method), Y4 (cardinality-constrained binary optimisation — scope), Y3 (106-qubit IBM hardware demonstration — scope), Y1 (warm-started initial state — method)
- Why it matters: Ancilla-free Fourier-LCU sampling replaces highly-connected cardinality-penalty layers and the fully-connected XY mixer with single-qubit-only basis circuits at polynomial shot overhead, with rigorous performance guarantees and a 106-qubit Heron-class hardware demonstration. This is a direct alternative compilation of the same primitives Yuan builds with quasi-binary encoding (Y2) and Grover-on-cardinality (Y4); the index-tracking-with-risk-constraints appendix even crosses into Y2/Y3's portfolio territory.
We investigate ancilla-free linear combination of unitaries (LCU) as a framework for approximating complex quantum circuits. This is particularly effective for quantum optimization algorithms, where candidate solutions can be evaluated classically and the task is to sample high-quality bitstrings rather than reproduce the full output distribution. We show that Fourier-based LCU constructions efficiently decompose broad classes of diagonal and non-diagonal unitaries, replacing highly connected qubit interactions with single-qubit gate layers or significantly simpler structures at the cost of a polynomial sampling overhead. Applied to algorithms such as QAOA, this yields efficient, hardware-friendly decompositions of, for instance, cardinality-constraint penalties and the fully connected XY-mixer, while maintaining rigorous performance guarantees compared to fully coherent implementations.
Detrimental Agnostic Entanglement: The Case Against Hardware-Efficient Ansätze for Combinatorial Optimization
- Authors: Tobias Rohe, Markus Baumann, Federico Harjes Ruiloba, Philipp Altmann, Gerhard Stenzel, Claudia Linnhoff-Popien (LMU Munich)
- arXiv: 2605.19827
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y1 (QAOA on MaxCut — method/scope), Y2/Y3 (problem-structured ansatz philosophy — conclusion), Y5 (Goemans–Williamson α_GW reference — scope)
- Why it matters: Controlled-experiment evidence that hardware-efficient ansätze underperform problem-structured QAOA on diagonal MaxCut Hamiltonians: smooth deletion / restriction knobs over the Meyer–Wallach entanglement Q show that less agnostic entanglement → strictly better solutions, while QAOA keeps Q saturated and still wins. Direct support for Yuan's QAOA-over-VQE stance in Y1/Y2/Y3.
Variational quantum algorithms (VQAs) for combinatorial optimization routinely employ entangling gates as a default design choice, yet the role of entanglement, in its amount and structure, remains poorly understood. This gap is particularly consequential for problems governed by diagonal Hamiltonians, whose ground states are classical product states and therefore require no entanglement in principle, raising the fundamental question of whether and how entangling gates help or hinder the variational search. We investigate this question for MaxCut by introducing two complementary control mechanisms that provide smooth, monotonic control over hardware-efficient ansatz (HEA) entanglement as quantified by the Meyer–Wallach measure Q, and by benchmarking against QAOA as a problem-structured reference.
Pauli Correlation Encoding for mRNA Secondary Structure Prediction: Problem-Aware Decoding for Dense-Constraint QUBOs
- Authors: Triet Friedhoff, Mihir Metkar, Wade Davis, Vaibhaw Kumar, Alexey Galda
- arXiv: 2605.20163
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y2 (variable-compression encoding for hard-constrained QUBO — method), Y3 (layerwise parameterisation — method), Y4 (dense binary constraints — scope), Y6 (IBM Heron hardware — scope)
- Why it matters: PCE compresses m bits onto O(m1/k) qubits via commuting Pauli correlators — same compression target Yuan tackles in Y2 with quasi-binary encoding, different mechanism. The PAGD decoder + QUBO-space loss enforces feasibility post hoc rather than via a hard mixer. Hardware-scale runs (745 binary variables on 23 qubits of IBM ibm_aachen, SWAP-free transpilation, depth 256) match simulator means and recover the CPLEX optimum on one mRNA sequence.
Pauli Correlation Encoding (PCE) compresses m binary variables onto n = O(m1/k) qubits for a tunable compression order k ≥ 2 by mapping them to commuting Pauli correlators, but the continuous expectation values it produces must be decoded into feasible binary solutions, a challenge that becomes acute for problems with dense constraints. We apply PCE to the mRNA secondary structure prediction problem, formulated as a densely-constrained QUBO. We train throughout with a QUBO-space sigmoid loss that preserves the QUBO penalty structure directly. For decoding, we introduce the Problem-Aware Guided Decoder (PAGD), which scores candidate variable commitments by the product of their marginal QUBO energy reduction and a trained expectation-value prior.
Quantum-Native Maximum Likelihood Detection in Random Access Channel with Overloaded MIMO
- Authors: Hyoga Iizumi, Naoki Ishikawa, Shunsuke Uehashi, Kota Nakamura, Shusaku Umeda, Toshiaki Koike-Akino
- arXiv: 2605.19389
- Category: cross submission — eess.SP / quant-ph
- Score: 8/10 (HIGH)
- Overlaps with: Y4 (Grover search with structured feasible space + lower-bound analysis on rotation count — method)
- Why it matters: A clean methodological neighbour of Y4 — Grover Adaptive Search (GAS) for MIMO ML detection, with a problem-aware search-space reduction (constellation symmetry), a derived tighter Lmin rotation-count lower bound, and an MVD-seeded initial threshold + restart strategy that together cut rotation count by ~65%. The Lmin tightening and the restart-on-bad-seed logic are both directly portable to Y4's cardinality setting.
In this paper, we propose a quantum-native formulation of maximum likelihood detection (MLD) for overloaded multiple-input multiple-output (MIMO) systems in a random access channel, where numerous user terminals share the same channel resource and asynchronously transmit signals. Classical linear detectors suffer from significant performance degradation in this scenario, whereas the exhaustive-search MLD achieves the optimal performance but incurs an exponential computational complexity. To overcome this trade-off, we formulate the MLD as a binary optimization problem and solve it via Grover adaptive search (GAS) — a quantum exhaustive search algorithm offering quadratic speedup in fault-tolerant quantum computing.
Moderately relevant (score 5–7) — 2 papers
Noise-induced Simulability Transition from Operator Scrambling
- Authors: (listing — see arXiv)
- arXiv: 2605.18943
- Category: new submission — Quantum Physics (quant-ph)
- Score: 6/10 (MED)
- Overlaps with: Y5 (Pauli sparsity / classical simulability of structured quantum dynamics — method/conclusion)
- Why it matters: Studies when the Pauli spectrum of an evolved operator concentrates on a sparse subset of strings — a structural simulability transition that mirrors Y5's "dequantise via Pauli sparsity" thesis but in a noisy-circuit-dynamics setting rather than for SDP relaxations. Useful theoretical context for when Pauli-sparse structure can be exploited classically.
The complexity of simulating quantum many-body dynamics, or quantum computations, in the Heisenberg picture is governed by the scrambling of initially simple operators into superpositions of exponentially many Pauli strings. The corresponding expansion coefficients define the Pauli spectrum, whose structure controls the performance of classical algorithms based on truncating Pauli expansions. Here we determine the finite-depth Pauli spectrum of random quantum circuits, both in the noiseless case and in the presence of local noise, through its moments, given by the operator stabilizer Rényi entropies. … Above a critical error per cycle γ_c N = O(1), the operator fails to reach the fully scrambled distribution and remains supported on an atypically sparse subset of Pauli strings.
Subsystem relaxation and a calibrated sampling diagnostic for programmable quantum annealers
- Authors: Luis Lozano
- arXiv: 2605.19381
- Category: new submission — quant-ph / cond-mat.dis-nn
- Score: 5/10 (MED)
- Overlaps with: Y3 (NISQ-era hardware noise affecting optimisation sampling — scope), Y2/Y4 (combinatorial optimisation testbed — scope)
- Why it matters: Subsystem-environment protocol on two D-Wave annealers studies when reverse annealing erases preparation memory, and proposes a calibrated-Boltzmann-distance diagnostic that flags wrong-basin trapping that memory-only metrics miss. The mixed-frustration benchmark finds the local-update model practitioners assume mis-predicts QPU relaxation by ~7× — useful methodological caution for any QUBO-on-quantum-annealer comparison Yuan considers.
Programmable quantum annealers are used as open-system samplers, but it is unclear when reverse annealing erases preparation memory and what the readout represents. Here we implement a subsystem-environment protocol on two D-Wave quantum annealers, varying environment size, coupling, disorder, preparation, geometry and QPU generation. … Pairing the memory order parameter with the distance to a calibrated conditional-Boltzmann reference yields a diagnostic that flags rare wrong-basin trapping memory loss alone misses; memory-retaining conditions stay far from the reference (median 0.35).
Tangential (score 1–4) — 3 papers
- 2605.19706 · score 4/10 · Finite-Precision Quantum Mechanics — proposes "Interval QM" with parcels of compatible density matrices and an epistemic interpretation of entanglement; foundations-adjacent to Y6's PBR work but takes the opposite (epistemic) interpretational stance.
- 2605.20078 · score 3/10 · On Performance and Limitations of NISQ Hardware for Simulations of Quantum Wave Packet Dynamics — IBM Quantum vs. IonQ benchmark for wave-packet QFT-based dynamics; shares NISQ-hardware scope with Y3 but the task (wave packet simulation) is far from optimisation.
- 2605.20133 · score 2/10 · Quantum algorithm for Discrete Gaussian Sampling — quadratic quantum-vs-classical speedup via quantum rejection sampling for lattice cryptography; shares only the generic "quadratic Grover-like speedup" theme with Y4.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 9 | 2605.18985 | Fourier-LCU for quantum optimisation (cardinality, XY-mixer, 106-qubit Heron) | Y2, Y4, Y3, Y1 | link |
| 8 | 2605.19827 | Detrimental agnostic entanglement: HEAs vs QAOA on MaxCut | Y1, Y2, Y3 | link |
| 8 | 2605.20163 | Pauli Correlation Encoding for dense-constraint QUBOs (745 var, 23q Heron) | Y2, Y3, Y4, Y6 | link |
| 8 | 2605.19389 | Grover Adaptive Search for overloaded-MIMO MLD (with tight L_min) | Y4 | link |
| 6 | 2605.18943 | Noise-induced simulability transition from operator scrambling (Pauli sparsity) | Y5 | link |
| 5 | 2605.19381 | Subsystem relaxation + calibrated sampling diagnostic for D-Wave annealers | Y3, Y2/Y4 | link |
| 4 | 2605.19706 | Finite-Precision Quantum Mechanics (interval QM, epistemic interpretation) | Y6 | link |
| 3 | 2605.20078 | NISQ hardware limits for wave-packet dynamics simulation | Y3 | link |
| 2 | 2605.20133 | Quantum algorithm for Discrete Gaussian Sampling (quadratic speedup) | Y4 | link |