quant-ph digest — 2026-06-04
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 (53 new + 22 cross = 75 entries)
Coverage: all 75 entries scored. 19 relevant (score ≥ 1); 56 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) — 1 paper
Energy-selective quantum search with Ising Hamiltonian phase oracles
- Authors: A. S. Plyashechnik, A. A. Zhukov, A. V. Lebedev, W. V. Pogosov
- arXiv: 2606.03380
- Category: new submission — quant-ph; cond-mat.dis-nn
- Score: 9/10 (HIGH)
- Overlaps with: Y4 (method+scope: Grover-type √(2n/M) scaling for structured Ising/QUBO oracle), Y1 (method: iterative single-parameter calibration with measurement feedback), Y3 (scope: Ising-encoded combinatorial cost landscape)
- Why it matters: Closest method+scope cousin to Y4 in today's listing. Uses the Ising Hamiltonian itself as a continuous spectral phase oracle, proves it still gives Grover √-scaling, and the self-generated "resonance band" plays the same role as Y4's cardinality-feasible subspace. Transportable generating-function susceptibility formalism (Eq. 19 of the paper) is worth importing for a Y4-style analysis with structured cost spectra.
Ising Hamiltonians are basic models of disordered magnets and a standard language for quantum and classical optimization. We study an energy-selective quantum search primitive in which the physical evolution exp(-iTH) is used directly as a Hamiltonian phase oracle. Unlike a Boolean oracle, this oracle marks configurations continuously by their phases and selects a finite resonance band rather than a preassigned marked set. We show that alternating it with the Grover diffusion operator nevertheless produces a Grover-type amplification peak. An exact spectral recurrence and a generating-function representation determine the peak position, width, and height. For an annealed Gaussian density of states, target energies in a high-density tail require Θ(√(2n/M)) oracle calls when the resonance contains M configurations. For random Ising spectra, overlap-induced correlations shift and distort the peak; spectral symmetrization and iterative calibration remove this detuning for prescribed-energy targeting.
Moderately relevant (score 5–7) — 5 papers
Towards a Hybrid Quantum Enhanced Solution for Densest k-Subgraph Problem
- Authors: Ravi Sangwan, Prabhat Anand, M Girish Chandra
- arXiv: 2606.03196
- Category: new submission — quant-ph
- Score: 7/10 (MED)
- Overlaps with: Y4 (scope: cardinality-constrained graph optimisation — DkSP fixes |S| = k), method-adjacent (GBS + classical post-processing rather than Grover or QAOA)
- Why it matters: Direct scope match for Y4 — picking exactly k vertices to maximise a quadratic edge objective is the same cardinality-constrained binary optimisation Y4 targets. Their finding that hard post-selection on the cardinality constraint is sample-inefficient and a soft classical refinement recovers near-feasible candidates parallels the trade-off Y4 makes between strict cardinality preservation and ADMM-style approximation. Worth comparing the 4× sampling-efficiency claim on community graphs against Y4's Grover scaling.
We study the application of Gaussian Boson Sampling (GBS) to the densest k-subgraph problem (DkSP). GBS with hard post-selection suffers from poor sampling efficiency due to strict cardinality constraints. To address this limitation, we introduce effective classical post-processing strategies that transform, otherwise discarded, near-k samples into feasible solutions. A comprehensive set of simulations is carried out, demonstrating that these approaches achieve near-optimal solution quality while improving sampling efficiency by approximately 4X compared to post-selection on community-structured graphs, and also post-selection often fails to reach the optimal solution on sparse random graphs even with large number of samples. Furthermore, the proposed methods perform on par with, and in some cases outperform, established classical approaches for graphs up to moderate size. Overall, the results indicate that while GBS with post-selection alone is insufficient, its combination with lightweight classical refinement can be highly effective.
Machine Learning-based Quantum Error Mitigation for Variational Algorithms
- Authors: Nikita Korolev, Kirill Lakhmanskiy, Daniil Rabinovich
- arXiv: 2606.02697
- Category: new submission — quant-ph
- Score: 6/10 (MED)
- Overlaps with: Y3 (scope: noise-regime impact on variational optimisation), Y1 (method: variational/QAOA-family). Benchmarks on Sherrington-Kirkpatrick — a canonical Ising spin glass.
- Why it matters: Y3 explicitly compares thermal-noise vs shot-noise regimes for QAOA portfolio optimisation. This paper provides a near-Clifford-trained ML-QEM that beats ZNE in the high-noise regime on SK Ising — directly relevant if Yuan wants to extend Y3's noise-crossover analysis with a stronger mitigation baseline.
Machine Learning-based quantum error mitigation (ML-QEM) has emerged as a promising approach for improving the performance of noisy quantum algorithms. However, existing ML-QEM methods often have restricted applicability to variational circuits and rely on inaccessible noiseless training data. In this work, we propose a practical ML-QEM protocol tailored to variational quantum algorithms, which generates training data by simulating (near-)Clifford circuits. This data is used for model selection and training, producing a mitigation model that can correct variational circuits with arbitrary parameters and transfer across different target Hamiltonians of similar structure. We benchmark the proposed method on the Variational Quantum Eigensolver (VQE) task for the Sherrington-Kirkpatrick Hamiltonian of up to n = 12 qubits under various noise models, analyzing its effect on trainability and comparing its performance against standard Zero-Noise Extrapolation (ZNE).
Quantum Optimization Algorithms for Strongly Correlated Many-Body Systems
- Authors: G. E. L. Pexe, L. A. M. Rattighieri, P. M. Prado, A. R. Fritsch, F. F. Fanchini
- arXiv: 2606.03147
- Category: new submission — quant-ph
- Score: 6/10 (MED)
- Overlaps with: Y1, Y2, Y3 (method: QAOA, VQE; barren-plateau / trainability discussion); Y4 adjacent on hybrid quantum-classical co-design.
- Why it matters: Perspective article that reviews QAOA/VQE/FALQON and argues that feedback-guided methods avoid barren plateaus by tracing geometrically robust landscape trajectories. The trainability framing is closely aligned with Y1's iterative warm-start motivation. Useful as a citable framing reference for the next QAOA-methods paper.
This perspective article analyzes the potential and critical challenges of employing quantum optimization algorithms to investigate phase transitions in quantum many-body systems during the Noisy Intermediate-Scale Quantum era. The simulation of strongly correlated systems is frequently intractable on classical computers due to the exponential growth of the Hilbert space and the fermionic sign problem. In this context, we review and compare the performance of traditional Variational Quantum Algorithms, such as the Variational Quantum Eigensolver and the Quantum Approximate Optimization Algorithm, against emerging heuristic approaches, specifically Feedback-based Quantum Algorithms, such as FALQON.
Scalable On-Hardware Training of Quantum Neural Networks and Application to Clinical Data Imputation
- Authors: Natansh Mathur, Panagiotis Kl. Barkoutsos, Masako Yamada, Martin Roetteler, Iordanis Kerenidis
- arXiv: 2606.03517
- Category: new submission — quant-ph; cs.AI; cs.LG
- Score: 5/10 (MED)
- Overlaps with: Y3 (method: layerwise optimisation — Y3 found layerwise + dual annealing most robust); Y1 (method: iterative subspace/parameter refinement).
- Why it matters: Layer-wise on-hardware training is one of Y3's three "most robust" optimisation strategies for QAOA portfolio. This paper provides a fresh measurement-cost argument for layer-wise: combining structured Butterfly circuits + parallelised parameter-shift gives O(log n) gradient cost per step. Directly transportable as a measurement-cost lens on Y3's layerwise findings, demonstrated on real IonQ Forte hardware at 16 qubits.
Training quantum neural networks (QNNs) on quantum hardware is currently bottlenecked by the cost of gradient estimation: standard parameter-shift methods require a number of circuit evaluations that grows quadratically with the number of trainable parameters, making hardware-based optimisation impractical beyond small system sizes. In this work, we introduce a training framework that reduces this cost to logarithmic in the number of qubits, combining a Butterfly circuit architecture with O(n log n) parameters and logarithmic depth, a layer-wise training strategy that confines on-hardware optimisation to one small layer at a time, and a parallelised parameter-shift rule.
The bulk spectral gap is semi-decidable: a convergent family of certified upper bounds
- Authors: (listed on arXiv abstract page)
- arXiv: 2606.03836
- Category: new submission — quant-ph; cond-mat.stat-mech; math-ph
- Score: 5/10 (MED)
- Overlaps with: Y5 (method: semidefinite programming hierarchies for certified bounds on quantum many-body quantities).
- Why it matters: Y5 develops SDP relaxations exploiting Pauli sparsity. This paper introduces a SDP hierarchy giving certified upper bounds on bulk spectral gaps of quantum many-body systems. The SDP-hierarchy framework is shared even though the target quantity differs — useful as a reference for "what other SDP-on-quantum problems are people solving" when framing Y5 follow-ups.
Determining spectral gaps in the thermodynamic limit is a central challenge in quantum many-body physics. Existing rigorous methods are largely limited to special settings, while variational numerical approaches typically provide estimates rather than certified bounds. Here we introduce a complete family of certified upper bounds on the bulk spectral gap of quantum many-body systems. These upper bounds are obtained by solving a series of semidefinite programs and they become arbitrarily tight.
Tangential (score 1–4) — 13 papers
- 2606.03891 · score 4/10 · Efficient Quantum Error Mitigation for Unitary k-Designs — "circuit balancing" + Pauli twirling QEM for random circuits on superconducting hardware; tangential NISQ-noise method.
- 2606.03699 · score 4/10 · Certifying coherence in quantum devices under classical control — SDP hierarchy for coherence certification; SDP-method link to Y5 but different application domain.
- 2606.03815 · score 4/10 · A Tutorial for Characterizing Transmon Qubits — practical superconducting transmon characterisation workflow; useful NISQ-hardware reference background for Y6 / Y3 hardware sections.
- 2606.03109 · score 4/10 · Parameterized Quantum Circuit for Correlated Equilibrium in Bayesian Games — PQC + gradient-based regret minimisation as variational solver on hard combinatorial-style problem; method-family adjacent.
- 2606.02761 · score 3/10 · Enhanced qubit performance by integrating altermagnets into superconducting qubit designs — superconducting transmon platform paper, hardware-adjacent to Y6's NISQ context.
- 2606.02721 · score 3/10 · Simulating Condensed Matter Physics on Quantum Hardware — review of NISQ digital simulation across platforms (superconducting/ion/atom); useful background reference.
- 2606.03515 · score 2/10 · A Voxel-Based Quantum Computing Method (VBQC) for Solid Mechanics Problem — QFT + multiplexer Hamiltonian construction; quantum-algorithm scope only.
- 2606.03407 · score 2/10 · Structure-Preserving Quantum Method of Lines for Evolutionary PDEs — LCHS / Hamiltonian-simulation for PDEs; tangential algorithmic toolkit.
- 2606.03688 · score 1/10 · The quantum-gravitational imitation game — tabletop tests of the quantum nature of gravity; foundations-adjacent to Y6's no-go test culture.
- 2606.02943 · score 1/10 · Testing the ER=EPR conjecture with entangled photons — quantum-gravity foundations test with photonic platform; Y6-adjacent culture only.
- 2606.03914 · score 1/10 · Quantum Erasure Imaging: Complementary Modalities from Delayed-Choice Erasure — foundations / delayed-choice protocol; tangential to Y6 foundations.
- 2606.03898 · score 1/10 · Squeezed-state semi-device-independent quantum randomness generation — semi-DI randomness; foundations-adjacent.
- 2606.03676 · score 1/10 · Macroscopic Spin GHZ States with a Levitated Ferromagnet — wavefunction-collapse model tests with levitated systems; Y6 foundations-adjacent.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 9 | 2606.03380 | Energy-selective quantum search with Ising Hamiltonian phase oracles | Y4 + Y1 + Y3 | link |
| 7 | 2606.03196 | Hybrid Quantum Enhanced Solution for Densest k-Subgraph | Y4 (scope) | link |
| 6 | 2606.02697 | ML-based QEM for Variational Algorithms (VQE on SK) | Y3 + Y1 | link |
| 6 | 2606.03147 | Quantum Optimization Algorithms for Many-Body Systems | Y1 + Y2 + Y3 (method) | link |
| 5 | 2606.03517 | Scalable On-Hardware Training of QNNs (layerwise + Butterfly) | Y3 (layerwise) | link |
| 5 | 2606.03836 | Bulk spectral gap is semi-decidable (SDP hierarchy) | Y5 (SDP method) | link |
| 4 | 2606.03891 | Efficient QEM for Unitary k-Designs | NISQ noise (Y3/Y6 adj.) | link |
| 4 | 2606.03699 | Certifying coherence under classical control (SDP) | Y5 (method adj.) | link |
| 4 | 2606.03815 | Tutorial for Characterizing Transmon Qubits | Y6 (hardware) | link |
| 4 | 2606.03109 | PQC for Correlated Equilibrium in Bayesian Games | Y1/Y2 (method adj.) | link |
| 3 | 2606.02761 | Altermagnets in superconducting qubit designs | Y6 (hardware) | link |
| 3 | 2606.02721 | Simulating Condensed Matter Physics on Quantum Hardware (review) | Y6 (NISQ context) | link |
| 2 | 2606.03515 | Voxel-Based Quantum Computing for Solid Mechanics | algorithm only | link |
| 2 | 2606.03407 | Structure-Preserving Quantum Method of Lines for PDEs | algorithm only | link |
| 1 | 2606.03688 | The quantum-gravitational imitation game | Y6 (foundations adj.) | link |
| 1 | 2606.02943 | Testing the ER=EPR conjecture with entangled photons | Y6 (foundations adj.) | link |
| 1 | 2606.03914 | Quantum Erasure Imaging (delayed-choice) | Y6 (foundations adj.) | link |
| 1 | 2606.03898 | Squeezed-state semi-DI randomness generation | Y6 (foundations adj.) | link |
| 1 | 2606.03676 | Macroscopic Spin GHZ States with Levitated Ferromagnet | Y6 (foundations adj.) | link |