quant-ph digest — 2026-04-16
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 (56 new + 16 cross = 72 scored; 34 replacements scanned for Yuan-adjacent updates)
Coverage: 72 new/cross entries scored. 19 relevant (score ≥ 1); 53 SKIP (score 0, omitted). Three replacements flagged separately on directly Yuan-adjacent work.
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
Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module
- Authors: Yun-Tak Oh, Dongsoo Lee, Jungyoul Park, Kyung Chul Jeong, Panjin Kim
- arXiv: 2604.13735
- Category: new submission — Quantum Physics (quant-ph); Computational Complexity (cs.CC); Emerging Technologies (cs.ET); Machine Learning (cs.LG)
- Score: 9/10 (HIGH)
- Overlaps with: Y1, Y2, Y3 (VQC/QAOA reachability), Y4 (classical simulability pressure on binary opt) — method + conclusion axes
- Why it matters: Identifies a necessary condition (module-weight matching) for VQAs to reach exact ground states and demonstrates O(n⁵) classical simulation for MAX-CUT via matchgate circuits. Cuts directly into the reachability/expressibility question behind warm-started QAOA (Y1) and constrained-ansatz designs (Y2/Y4), while adding a new dequantisation lever on MAX-CUT-class problems adjacent to Yuan's portfolio and cardinality work.
We study the reachability of variational quantum circuits to exact ground states via a polynomial group module structure. A necessary condition — matching of module weights between input and solution states — is identified. Specific problem classes, including Maximum Cut, are shown to admit O(n⁵) classical simulation using matchgate circuits.
Distributed quantum-classical hybrid algorithm for solving K-SAT problem
- Authors: Huaijing Huang, Daowen Qiu, Le Luo, Paulo Mateus
- arXiv: 2604.14057
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y1 (iterative hybrid), Y2 (encoding efficiency), Y4 (binary opt speedup) — method + scope axes
- Why it matters: Distributed hybrid quantum-classical algorithm for K-SAT with exponential speedup and fewer qubits than the Dunjko et al. baseline, under resource-constrained conditions. K-SAT is the canonical binary-optimisation test-bed that Yuan's ADMM+Grover (Y4) and warm-started QAOA (Y1) both aim at — a distributed variant with reduced qubit cost is directly benchmarkable.
We design a distributed quantum-classical hybrid algorithm for K-satisfiability problems achieving exponential time complexity acceleration over classical baselines. The approach generalizes Dunjko et al. and requires fewer qubits without relying on quantum communication under resource-constrained conditions.
Replacements worth flagging (Yuan-adjacent updates)
Elevating Variational Quantum Semidefinite Programs for Polynomial Objectives (replacement)
- Authors: Iria W. Wang, Robin Brown, Taylor L. Patti, Anima Anandkumar, Marco Pavone, Susanne F. Yelin
- arXiv: 2408.07774
- Category: replacement — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y5 (quantum SDP), Y1/Y2/Y4 (Max-kSAT binary opt) — method + scope axes
- Why it matters: Product-State Lifting upgrades vQSDP to k-degree polynomial optimisation (incl. Max-kSAT) with linear resource scaling. Direct method overlap with Y5's GW-relaxation programme and with the polynomial binary-opt scopes of Y1/Y2/Y4.
Product-State Lifting upgrades variational quantum semidefinite programs with basis-state encoding for k-degree polynomial optimization using only linear resource increases with constraints constant in k. Paired with vQSDP featuring Hadamard tests and approximate amplitude constraints, an application to Max-kSAT is outlined.
Counting with the quantum alternating operator ansatz (replacement)
- Authors: Julien Drapeau, Shreya Banerjee, Stefanos Kourtis
- arXiv: 2503.07720
- Category: replacement — Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech); Data Structures and Algorithms (cs.DS)
- Score: 8/10 (HIGH)
- Overlaps with: Y2 (Grover-mixer QAOA), Y4 (Grover-based binary opt) — method axis
- Why it matters: VQCount applies QAOA and Grover-mixer QAOA to approximate #P-hard counting on #NAE3SAT / #1-in-3SAT, with tensor-network simulations exposing trade-offs between success probability and sampling uniformity. Direct line to Yuan's Grover-mixer constraint-preserving approach (Y2) and Grover-based binary-opt work (Y4).
VQCount, a variational algorithm based on QAOA for approximate #P-hard counting problems, exploits equivalence between random sampling and approximate counting. Tensor-network simulations on #NAE3SAT and #1-in-3SAT with original and Grover-mixer QAOA reveal trade-offs between success probability and sampling uniformity.
Moderately relevant (score 5–7) — 3 new/cross + 1 replacement
Taming Trotter Errors with Quantum Resources
- Authors: Xiangran Zhang, Jue Xu, Qi Zhao, You Zhou
- arXiv: 2604.13486
- Category: new submission — Quantum Physics (quant-ph)
- Score: 6/10 (MEDIUM)
- Overlaps with: Y1, Y2, Y3 — method (Trotterised QAOA error budget)
- Why it matters: Shows Trotter-Suzuki error variance decreases with entanglement entropy and kurtosis decreases with magic — quantum resources intrinsically temper Trotter error. QAOA p-layer construction is a Trotterised evolution, so these results refine error budgets for warm-started (Y1) and layerwise (Y3) QAOA runs.
We connect quantum resources — entanglement entropy and magic — to statistical behavior of Trotter-Suzuki errors. Error variance decreases with entanglement; kurtosis has negative dependence on magic. Quantum resources intrinsically enhance Trotter robustness.
Quantum computing for effective nuclear lattice model
- Authors: Zhushuo Liu, Jia-ai Shi, Bing-Nan Lu, Xiaosi Xu
- arXiv: 2604.13430
- Category: new submission — Quantum Physics (quant-ph); Nuclear Theory (nucl-th)
- Score: 5/10 (MEDIUM)
- Overlaps with: Y2 — method (encoding-efficiency tradeoff)
- Why it matters: Compares Jordan-Wigner vs Gray-code encodings for VQE on nuclear lattice models and finds Gray-code with symmetry reduction is more qubit-compact. Direct parallel to Yuan's quasi-binary encoding comparison in Y2 — same encoding-vs-circuit-depth tradeoff on a different problem class.
We develop a quantum-computing framework for three-dimensional nuclear lattice models using VQE, comparing Jordan-Wigner and Gray code encodings. Gray code with symmetry reduction yields more compact qubit representations.
Tsallis relative α entropy of coherence dynamics in Grover's search algorithm
- Authors: Linlin Ye, Zhaoqi Wu, Shao-Ming Fei
- arXiv: 2604.13910
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MEDIUM)
- Overlaps with: Y4 — method (Grover subroutine)
- Why it matters: Derives complementarity relations between Tsallis coherence and Grover success probability, illustrating how coherence is consumed through iterations. Yuan's Y4 couples Grover to ADMM for cardinality-constrained binary opt — this gives a resource-theoretic handle on Grover iteration budgets.
We study Tsallis relative α entropy of coherence dynamics in Grover's search algorithm, proving entropy decreases with success probability and deriving complementarity relations.
Analog-Digital Quantum Computing with Quantum Annealing Processors (replacement)
- Authors: Rahul Deshpande, Majid Kheirkhah, Chris Rich, Richard Harris, Jack Raymond, Emile Hoskinson, et al.
- arXiv: 2603.15534
- Category: replacement — Quantum Physics (quant-ph); Disordered Systems and Neural Networks (cond-mat.dis-nn); Statistical Mechanics (cond-mat.stat-mech)
- Score: 5/10 (MEDIUM)
- Overlaps with: Y1, Y2, Y3 — method (QA ↔ QAOA)
- Why it matters: Extends D-Wave QA processors with XY-model weak-coupling evolution and arbitrary-basis init/measurement via auxiliary qubits. Coherent single/two-qubit oscillations, multi-qubit quantum walks, and Anderson localisation on commercially-available hardware — direct QA-side lens on QAOA.
Analog-digital quantum computing expands quantum annealing processors beyond traditional unison-control limitations by enabling fixed many-body Hamiltonian evolution approximated by weak-coupling XY models, paired with arbitrary-basis initialization and measurement via auxiliary qubits.
Tangential / tooling-adjacent (score 1–4) — 14 papers
- 2604.13144 · score 4/10 · Quantum-inspired classical simulation through randomized time evolution — MPS TE-PAI for exact (on average) time evolution with reduced variance. Classical-simulation pressure on Trotterised QAOA circuits.
- 2604.13219 · score 4/10 · Fault-Tolerant Error Detection Above Break-Even for Multi-Qubit Gates — Iceberg [[2m, 2m-2, 2]] code for Toffoli and Bell on trapped ions above break-even.
- 2604.13457 · score 4/10 · Excited-State Quantum Chemistry on Qumode-Based Processors via VQD — QumVQD achieves chemical accuracy with 1–2 orders magnitude fewer entangling gates.
- 2604.13812 · score 4/10 · AlphaCNOT: Learning CNOT Minimization with Model-Based Planning — MCTS-based CNOT minimisation with up to 32% reduction. Tooling for deep QAOA compilation.
- 2604.13877 · score 4/10 · Scalable Quantum Molecular Generation via GPU-Accelerated Tensor-Network Simulation — Linear-scaling qubit architecture; extends exact simulation to N=40 heavy atoms.
- 2604.13172 · score 3/10 · Simple slow operators and quantum thermalization — SSO absence implies typical-state thermalisation; loose tie to Y5 Gibbs-state preparation.
- 2604.13176 · score 3/10 · Measuring quasiparticle dynamics for particle impact reconstruction in a superconducting qubit chip — QP dynamics on transmons; hardware-noise context for Y6.
- 2604.13363 · score 3/10 · Scalable Fluxonium Quantum Processors via Tunable-Coupler Architecture — 22-qubit fluxonium with 10-qubit GHZ; near-term hardware alternative to IBM platform used in Y6.
- 2604.13560 · score 3/10 · Parameter-efficient Quantum Multi-task Learning — VQC prediction heads with linear scaling vs quadratic classical heads.
- 2604.13943 · score 3/10 · A Modular and T-Gate Efficient Architecture for Quantum Leading-Zero/One Counter — T-depth O(log m) counter reusable in cardinality-counting oracles (Y4).
- 2604.14143 · score 3/10 · Quantum matter is weakly entangled at low energies — Area-law bounds for frustration-free ground states; loose tie to Y5.
- 2604.13135 · score 2/10 · Comment on arXiv:2604.09826 (EPR) — Foundational critique of an EPR resolution; interpretational tangent to Y6 PBR context.
- 2604.13160 · score 2/10 · Programmable Fermionic Quantum Processors with Globally Controlled Lattices — Universal fermionic processing with global parameters.
- 2604.13524 · score 2/10 · Quantum thermodynamics with uncertain equilibrium — No-go theorem on athermality purification; thin Y5 link.
- 2604.13909 · score 2/10 · dqc_simulator: distributed quantum computing simulator — Distributed simulator toolkit; tooling only.
- 2604.14079 · score 2/10 · Hybrid q-c algorithms for nonlinear PDEs with Ginzburg-Landau — Hybrid approach to complex-valued nonlinear PDEs.
- 2604.13951 · score 2/10 · Quantum ML for Colorectal Cancer Data — QNN with ZZFeatureMap; thin VQC-method link.
- 2604.14055 · score 1/10 · Two-Indexed Schatten Quasi-Norms with Applications to QIT — Operator-valued Schatten theory and Rényi entropies; abstract.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 9 | 2604.13735 | Reachability Constraints in Variational Quantum Circuits | Y1, Y2, Y3, Y4 | link |
| 8 | 2604.14057 | Distributed quantum-classical hybrid K-SAT | Y1, Y2, Y4 | link |
| 8 | 2408.07774 | Elevating vQSDP for Polynomial Objectives (repl.) | Y1, Y2, Y4, Y5 | link |
| 8 | 2503.07720 | Counting with QAOA (repl.) | Y2, Y4 | link |
| 6 | 2604.13486 | Taming Trotter Errors with Quantum Resources | Y1, Y2, Y3 | link |
| 5 | 2604.13430 | QC for effective nuclear lattice model | Y2 | link |
| 5 | 2604.13910 | Tsallis entropy of coherence in Grover | Y4 | link |
| 5 | 2603.15534 | Analog-Digital QC with QA Processors (repl.) | Y1, Y2, Y3 | link |
| 4 | 2604.13144 | Quantum-inspired classical simulation via randomised TE | Y1, Y2, Y3 | link |
| 4 | 2604.13219 | FT Error Detection Above Break-Even (Iceberg) | Y4 | link |
| 4 | 2604.13457 | Excited-State Chem on Qumode (QumVQD) | — | link |
| 4 | 2604.13812 | AlphaCNOT CNOT Minimisation | Y1, Y2, Y3 | link |
| 4 | 2604.13877 | Scalable Quantum Molecular Gen via TN | Y1, Y2, Y3 | link |
| 3 | 2604.13172 | Simple slow operators and thermalisation | Y5 | link |
| 3 | 2604.13176 | QP dynamics in superconducting chip | Y6 | link |
| 3 | 2604.13363 | Scalable Fluxonium Processors | Y6 | link |
| 3 | 2604.13560 | Parameter-efficient Quantum Multi-task Learning | — | link |
| 3 | 2604.13943 | Modular T-Gate Efficient Counter | Y4 | link |
| 3 | 2604.14143 | Quantum matter weakly entangled at low energies | Y5 | link |
| 2 | 2604.13135 | Comment on arXiv:2604.09826 (EPR) | Y6 | link |
| 2 | 2604.13160 | Programmable Fermionic Quantum Processors | — | link |
| 2 | 2604.13524 | Quantum thermodynamics with uncertain equilibrium | Y5 | link |
| 2 | 2604.13909 | dqc_simulator | — | link |
| 2 | 2604.14079 | Hybrid q-c for nonlinear PDEs (Ginzburg-Landau) | — | link |
| 2 | 2604.13951 | QML for Colorectal Cancer Data | — | link |
| 1 | 2604.14055 | Two-Indexed Schatten Quasi-Norms | Y5 | link |