quant-ph digest — 2026-05-05
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 (41 new + 13 cross = 54 entries)
Coverage: all 54 entries scored. 8 relevant (score ≥ 1); 46 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
Quantum Decoding Algorithms: Quantum Speedups in Optimization
- Authors: Jan Ljubas, Tim Byrnes
- arXiv: 2605.00312
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y3, Y4 (conclusion — quantum-advantage claim for structured optimization); Y5 (method — HDQI extension touches Pauli-sparse Gibbs preparation)
- Why it matters: Self-contained 24-page tutorial of Decoded Quantum Interferometry (DQI), the Jordan et al. 2024 algorithm with strong evidence of superpolynomial quantum speedup over Prange's algorithm on the OPI subclass of max-LINSAT — the most important quantum-optimization development since Yuan's Y3 was drafted, and a direct competitor on the same axis. Surveys the semicircle-law performance bound, recent noise-degradation analysis (Bu et al. 2025) and the HDQI extension to general Pauli Hamiltonians.
Attaining a quantum speedup in solving practically useful optimization problems has been one of the holy grails in the field of quantum computing. While prior approaches have demonstrated speedups for certain structured problem classes, establishing a clear and scalable advantage on broadly useful practical optimization problems remains challenging. Recently, a new approach to solving the max-LINSAT class of optimization problems has emerged, called Decoded Quantum Interferometry (DQI). In DQI, a combination of techniques rooted in (classical) coding theory and interferometry are used to obtain the solution of max-LINSAT. In the special problem instance of the optimal polynomial intersection (OPI) problem, strong evidence exists to show that an superpolynomial speedup exists over the best classical methods in obtaining an approximate solution.
A Resource-Efficient Variational Quantum Framework for the Traveling Salesman Problem
- Authors: Yuefeng Lin, Chao Zheng, Cong Guo
- arXiv: 2605.00739
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y2 (method — compact binary-register encoding + hard-constraint feasibility-preserving mixer); Y1 (method — layered ansatz with depth-vs-quality sweep); Y3 (scope — end-to-end variational optimization with hardware noise-mitigation comparison); Y4 (method — quantum-classical hybrid via divide-and-conquer)
- Why it matters: Direct methodological echo of Y2's quasi-binary encoding, applied to TSP. Compact
O(n log n)-qubit binary register replaces one-hot'sO(n²); ancilla-controlled CSWAP register-swap layers stay inside the feasible permutation subspace by construction (so penalty terms drop entirely, exactly Y2's design philosophy); divide-and-conquer factorization runs the 5-city instance on 2-qubit NMR hardware with IBU mitigation. Authors do not cite Y2 — possible reciprocal-cite ask.
The Traveling Salesman Problem (TSP) is a prototypical combinatorial optimization problem, but its quantum implementation is limited by the O(n²)-qubit overhead of standard one-hot encodings. Here, we propose a resource-efficient variational quantum framework based on compact binary-register encoding, a permutation-preserving problem-inspired ansatz, and a complementary divide-and-conquer execution strategy. The compact encoding reduces the data-qubit requirement to O(n log n), while the divide-and-conquer formulation lowers the number of qubits required in each local hardware execution to the size of the largest subsystem.
Moderately relevant (score 5–7) — 3 papers
Toward Secure Multitenant Quantum Computing: Circuit Affinity, Crosstalk Patterns, and Grouping Strategies
- Authors: Andrew Woods, Chi-Ren Shyu
- arXiv: 2605.00118
- Category: new submission — Quantum Physics (quant-ph)
- Score: 7/10 (MED)
- Overlaps with: Y6 (scope — IBM Heron r1–r3 + Nighthawk r1 superconducting hardware characterization); Y1, Y4 (scope — empirical study of QAOA and Grover circuits among the five tested foundational primitives); Y3 (scope — NISQ-noise behavior on superconducting devices)
- Why it matters: Empirical inter-circuit crosstalk study spanning seven IBM superconducting processors — exactly the hardware substrate Y6 used. Notable Heron r1 vs Nighthawk r1 "topological decoupling" (similarity 0.01) and intra-revision similarity ≈ 0.7. QAOA classified as "cotenant-dependent"; Grover identified as "universally aggressive". Useful baseline data if Yuan revisits IBM Heron noise modelling.
Multitenancy increases throughput and reduces costs in cloud-based quantum computing, but concurrent job execution introduces security risks through inter-circuit crosstalk. We characterize the structural predictability of these interference patterns across seven IBM superconducting processors, spanning Heron (r1-r3) and Nighthawk (r1) architectures and five different circuit types. We evaluate pairwise interactions, by applying the Structural Similarity Index (SSIM) and a structural t-statistic to the concurrent execution of five foundational quantum circuits (QAOA, Grover's, QPE, QFT, and ZZFeatureMap), we quantify behavioral consistency across disparate hardware.
Measuring the largest coefficients of a quantum state
- Authors: Nicolás Ciancaglini, Santiago Cifuentes, Guido Bellomo, Santiago Figueira, Ariel Bendersky
- arXiv: 2605.00341
- Category: new submission — Quantum Physics (quant-ph)
- Score: 6/10 (MED)
- Overlaps with: Y5 (method — Pauli-sparse representation of states; targeted reconstruction of dominant Pauli components without full tomography)
- Why it matters: Hierarchical prefix-tree algorithm for identifying dominant Pauli coefficients of an unknown state via Bell sampling on two copies, with sample-complexity bounds depending on state purity. Method is in the Pauli-sparsity adjacent space Yuan exploits in Y5; the Bell-sampling primitive could be paired with Y5's Gibbs-state machinery.
We introduce a hierarchical algorithm for identifying the largest Pauli coefficients of an unknown n-qubit quantum state. The algorithm traverses a prefix-based tree whose nodes represent partial sums of squared Pauli coefficients, always expanding branches with the largest estimated weight and discarding the rest. Node weights are estimated using Bell sampling on two copies of the state, or alternatively via SWAP tests on subsystems. We analyze the sample complexity of each node estimation and derive bounds on the total number of nodes expanded as a function of the desired number of coefficients and the state's purity.
Learning Lindblad Dynamics of a Superconducting Quantum Processor
- Authors: Johann Bock Severin, Malthe A. Marciniak, Rune Thinggaard Birke, Emil Hogedal, Andreas Nylander, Irshad Ahmad, Amr Osman, Janka Biznárová, Marcus Rommel, Anita Fadavi Roudsari, Jonas Bylander, Giovanna Tancredi, Christopher W. Warren, Svend Krøjer, Jacob Hastrup, Morten Kjaergaard
- arXiv: 2605.00626
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y6 (scope — superconducting processor characterization); Y3 (scope — Lindblad / dissipation modelling underpins the thermal-noise regime that Y3 identified as advantage-precluding)
- Why it matters: Data-driven framework (LIMINAL) for selecting minimal-adequate Lindblad models on a 5-qubit superconducting processor via likelihood-ratio tests. Identifies three-local Hamiltonian terms with two-local dissipation; useful methodological reference if Yuan needs to justify simplifying noise assumptions in any future end-to-end QAOA-noise paper.
Accurate models of quantum processors are essential for understanding, calibrating, and improving their performance. […] Here we introduce LIMINAL, a data-driven framework for testing such assumptions and selecting minimal adequate Lindblad models. LIMINAL fits nested candidate models to time-resolved tomographic data and uses likelihood-ratio tests to decide when added physical mechanisms are warranted. We apply LIMINAL to a five-qubit superconducting processor, identifying an idling model with three-local Hamiltonian terms and two-local dissipation, while finding no support for three-local dissipation.
Tangential (score 1–4) — 3 papers
- 2605.00406 · score 3/10 · Bell Correlations and Selection Bias — Foundations argument that Bell-test correlations may be selection artefacts rather than genuine nonlocality; tangential to Y6's PBR/ontic-vs-epistemic territory.
- 2605.00807 · score 3/10 · Probability Distribution Analysis of the Cascaded Variational Quantum Eigensolver — Trapezoidal-state guiding-state selection for CVQE; adjacent to Y3's variational-method optimization choices.
- 2605.00106 · score 2/10 · From Tensor Networks to Tractable Circuits, and back — Equivalences between MPS/tree tensor networks and structured-decomposable circuits over pseudo-Boolean functions; tangential to combinatorial-optimization representations.
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 8 | 2605.00312 | Quantum Decoding Algorithms: speedups in optimization (DQI review) | Y3, Y4, Y5 | link |
| 8 | 2605.00739 | Resource-efficient variational TSP (compact binary + hard mixer) | Y2, Y1, Y3, Y4 | link |
| 7 | 2605.00118 | Multitenant crosstalk on IBM Heron + Nighthawk | Y6, Y1, Y3, Y4 | link |
| 6 | 2605.00341 | Hierarchical Pauli-coefficient measurement | Y5 | link |
| 5 | 2605.00626 | Learning Lindblad dynamics on superconducting processor | Y6, Y3 | link |
| 3 | 2605.00406 | Bell correlations as selection bias | Y6 | link |
| 3 | 2605.00807 | Probability-distribution analysis of cascaded VQE | Y3 | link |
| 2 | 2605.00106 | Tensor networks ↔ tractable circuits | Y4 | link |