quant-ph digest — 2026-05-07
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 (83 new + 13 cross = 96 entries)
Coverage: all 96 entries scored. 26 relevant (score ≥ 1); 70 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 papers
Quantum Resource Estimation for Minimising Energy Grid Losses
- Authors: Camille de Valk, Milou van Nederveen, Koen Reerink, Werner van Westering
- arXiv: 2605.03467
- Category: new submission — Quantum Physics (quant-ph)
- Score: 8/10 (HIGH)
- Overlaps with: Y2, Y3, Y4 — method/scope
Distribution network reconfiguration (DNR) can minimise power losses by identifying the optimal topology of the electricity grid. Determining the minimum loss configuration is NP-hard, and classical optimisation methods struggle to scale to real-world distribution grids. This paper explores the use of gate-based quantum computing to solve DNR for power loss reduction. We formulate DNR as a higher-order unconstrained binary optimisation (HUBO) problem, avoiding the need for auxiliary variables, thereby reducing the required number of qubits. This is applied to a real medium voltage (MV) network operated by Alliander, a Dutch distribution system operator (DSO). For each biconnected component i
Moderately relevant (score 5–7) — 5 papers
Rigorous error bounds for dissipative thermal state preparation from weak system-bath coupling
- Authors: Christopher Ong, S. A. Parameswaran, Benedikt Placke, Dominik Hahn
- arXiv: 2605.03011
- Category: new submission — Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech)
- Score: 6/10 (MED)
- Overlaps with: Y5 — method
Thermal state preparation is a central challenge in the simulation of quantum many-body systems. Yet, provably efficient algorithms for this task were only introduced recently [Chen et al. Nature 646, 561 (2025)]. These algorithms are based on dissipative Lindbladian evolution which exactly fixes the thermal state. Controlled and efficient digital simulation of this evolution, although possible in principle, remains out of reach for present-day quantum hardware. Subsequent work has therefore focused on analog approximations of the proposed Lindbladians via `collision models' with relatively modest requirements -- a resettable bath of ancilla qubits whose couplings to the system can be tu
BBQ-mIS: a parallel quantum algorithm for graph coloring problems
- Authors: Chiara Vercellino, Giacomo Vitali, Paolo Viviani, Edoardo Giusto, Alberto Scionti, Andrea Scarabosio, Olivier Terzo, Bartolomeo Montrucchio
- arXiv: 2605.03524
- Category: new submission — Quantum Physics (quant-ph)
- Score: 6/10 (MED)
- Overlaps with: Y2, Y4 — method/scope
Among the limitations of current quantum machines, the qubits count represents one of the most critical challenges for porting reasonably large computational problems, such as those coming from real-world applications, to the scale of the quantum hardware. In this regard, one possibility is to decompose the problems at hand and exploit parallelism over multiple size-limited quantum resources. To this purpose, we designed a hybrid quantum-classical algorithm, i.e., BBQ-mIS, to solve graph coloring problems on Rydberg atoms quantum machines. The BBQ-mIS algorithm combines the natural representation of Maximum Independent Set (MIS) problems onto the machine Hamiltonian with a Branch&Bound (
Preparing High-Fidelity Thermofield Double States
- Authors: Brian J. J. Khor, Nadie LiTenn, Martin Sasieta, Brian Swingle
- arXiv: 2605.03017
- Category: new submission — Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech); High Energy Physics - Theory (hep-th)
- Score: 5/10 (MED)
- Overlaps with: Y5 — method
A major promise of quantum computers is the controlled preparation of many-body quantum states beyond the reach of efficient classical computation. Among the most important targets are thermal mixed states and their thermofield double (TFD) purifications, which play central roles in quantum many-body physics and quantum gravity. For target systems with a bounded energy spectrum that obey the eigenstate thermalization hypothesis (ETH), we present a parent Hamiltonian built from two copies of the target Hamiltonian and ultra-local couplings between the copies, which we argue is gapped with a ground state that approximates a TFD state of the target Hamiltonian. By adiabatically evolving down fr
Shortest Path in Pauli Forest -- An Algorithm for Decomposing Pauli Exponentials to Quantum Circuits
- Authors: Lauri Vuorenkoski, Arianne Meijer-van de Griend
- arXiv: 2605.03545
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y5 — method
Decomposing Pauli exponentials efficiently to quantum circuits has been the subject of intense research in recent years. Pauli exponentials are an essential component of many different quantum algorithms. Due to the error-prone nature of current and near term quantum devices, it is crucial that quantum circuits are as compact as possible. Several different types of algorithms have been developed to decompose Pauli exponentials into as short circuits as possible. We propose a novel algorithm for architecture-aware synthesis of Pauli exponentials that also determines the initial qubit placement on the device. We call this the Shortest Path in Pauli Forest algorithm. The results show an improve
Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor
- Authors: Gavin S. Hartnett, Khadijeh Sona Najafi, Aleksei Khindanov, Haoran Liao, Michael Schutzman, Michael R. Hush, Michael J. Biercuk, Yuval Baum
- arXiv: 2605.04025
- Category: new submission — Quantum Physics (quant-ph)
- Score: 5/10 (MED)
- Overlaps with: Y3, Y6 — scope
We report experimental digital quantum simulation of the one-dimensional Fermi-Hubbard model on a superconducting quantum processor at a scale beyond the reach of exact statevector simulation and challenging for state-of-the-art tensor-network methods. We encode this problem using up to 120 qubits through an efficient mapping that reduces circuit complexity, and we improve accuracy through error suppression to simulate dynamical evolution using up to 90 Trotter steps. From a vacancy defect introduced in the middle of an $L=31$-site (62-qubit) Néel initial state, we directly observe spin-charge separation to $t=9$ in natural units using up to 90 Trotter steps, and quantitatively extract veloc
Tangential (score 1–4) — 20 papers
- 2605.02966 · score 3/10 · QBalance: A Reproducible Multi-Objective Workflow for Quantum Compilation, Noise Suppression, and Error-Mitigation Strategy Selection — NISQ noise/error-mitigation workflow (Qiskit) — tangential to Y3 NISQ noise regime
- 2605.03022 · score 3/10 · General method for obtaining the energy minimum of spin Hamiltonians for separable states — Analytic energy minima for spin Ising/Heisenberg Hamiltonians — QAOA target structure (Y1/Y3) but only marginally relevant
- 2605.03434 · score 3/10 · Quantum Hierarchical Reinforcement Learning via Variational Quantum Circuits — Quantum hierarchical RL via VQCs — VQA family, off-scope from Y1–Y6
- 2605.03503 · score 3/10 · Harnessing DEN models for quantum computing tasks on neutral atom QPUs — Distance Encoder Networks for graph embedding on Rydberg — combinatorial-on-hardware, distant from Y1–Y5
- 2605.03565 · score 3/10 · Neural optimization for quantum architectures: graph embedding problems with Distance Encoder Networks — Distance Encoder Networks — graph-embedding methodology, same family as #2605.03503
- 2605.03612 · score 3/10 · A Critical Comment on 'Entropy Computing: A Paradigm for Optimization in Open Photonic Systems' — Critique of Entropy Quantum Computing — quantum optimisation claims critique, tangential to Y3
- 2605.03629 · score 3/10 · Adversarial Effects on Expressibility and Trainability in Distributed Variational Quantum Algorithms — Adversarial perturbations on distributed VQAs — VQA family includes QAOA but adversarial scope is off-axis
- 2605.03685 · score 3/10 · Quantum Multi-Level Estimation of Functionals of Discrete Distributions — Quantum multi-level estimation algorithm — algorithmic primitive, distant scope
- 2605.03729 · score 3/10 · Ensemble Engineering to Overcome Destructive Cancellation in Quantum Measurements — Ensemble engineering on NISQ measurements — adjacent to Y3 shot-noise regime
- 2605.03773 · score 3/10 · Computation of entanglement for quantum states by a Consensus-Based Optimization method — Consensus-based classical optimisation for entanglement computation — classical optimiser tangential to Y3 layerwise/dual-annealing
- 2605.03854 · score 3/10 · Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures — Pauli-based computation in distributed qLDPC — Pauli framework adjacent to Y5
- 2605.03906 · score 3/10 · Variational Joint Magnetometry and Gradiometry on Dipolar Spin Chains — Variational two-parameter magnetometry — variational ansatz family, sensing scope
- 2605.03932 · score 3/10 · Magic-Informed Quantum Architecture Search — Magic-informed quantum architecture search — circuit design tangential to QAOA design
- 2605.03951 · score 3/10 · Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor — Distributed Shor on half-million-qubit atomic processor — algorithmic resource estimation, different algorithm
- 2605.03972 · score 3/10 · Regev's reduction as a candidate quantum algorithm for the discrete logarithm problem in finite abelian groups — Regev quantum reduction for DLOG — quantum-algorithm methodology, off-scope
- 2605.04049 · score 3/10 · FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models — FTPrimitiveBench biased noise benchmarks — NISQ-noise modelling adjacent to Y3
- 2605.02986 · score 2/10 · Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions — LCU primitive — adjacent to amplitude amplification (Y4 Grover family)
- 2605.03104 · score 2/10 · Strong Locality as a Tetrahedron: A Symmetry-Reduced Geometric Representation of the (3,3,2,2) Bell Scenario — Bell-scenario foundations geometry — adjacent to Y6 PBR foundations
- 2605.03120 · score 2/10 · Coordination Requires a Common Cause in Quantum Theory — Coordination causal principle — quantum foundations adjacent to Y6
- 2605.03132 · score 2/10 · A missing causal principle: Coordination — Coordination causal principle (companion paper) — adjacent to Y6
Summary table
| Score | arXiv ID | Short title | Overlaps | arXiv |
|---|---|---|---|---|
| 8 | 2605.03467 | Quantum Resource Estimation for Minimising Energy Grid Losses | Y2, Y3, Y4 | link |
| 6 | 2605.03011 | Rigorous error bounds for dissipative thermal state preparation from … | Y5 | link |
| 6 | 2605.03524 | BBQ-mIS: a parallel quantum algorithm for graph coloring problems | Y2, Y4 | link |
| 5 | 2605.03017 | Preparing High-Fidelity Thermofield Double States | Y5 | link |
| 5 | 2605.03545 | Shortest Path in Pauli Forest -- An Algorithm for Decomposing Pauli E… | Y5 | link |
| 5 | 2605.04025 | Fast, accurate, high-resolution simulation of large-scale Fermi-Hubba… | Y3, Y6 | link |
| 3 | 2605.02966 | QBalance: A Reproducible Multi-Objective Workflow for Quantum Compila… | — | link |
| 3 | 2605.03022 | General method for obtaining the energy minimum of spin Hamiltonians … | — | link |
| 3 | 2605.03434 | Quantum Hierarchical Reinforcement Learning via Variational Quantum C… | — | link |
| 3 | 2605.03503 | Harnessing DEN models for quantum computing tasks on neutral atom QPUs | — | link |
| 3 | 2605.03565 | Neural optimization for quantum architectures: graph embedding proble… | — | link |
| 3 | 2605.03612 | A Critical Comment on 'Entropy Computing: A Paradigm for Optimiza… | — | link |
| 3 | 2605.03629 | Adversarial Effects on Expressibility and Trainability in Distributed… | — | link |
| 3 | 2605.03685 | Quantum Multi-Level Estimation of Functionals of Discrete Distributio… | — | link |
| 3 | 2605.03729 | Ensemble Engineering to Overcome Destructive Cancellation in Quantum … | — | link |
| 3 | 2605.03773 | Computation of entanglement for quantum states by a Consensus-Based O… | — | link |
| 3 | 2605.03854 | Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC … | — | link |
| 3 | 2605.03906 | Variational Joint Magnetometry and Gradiometry on Dipolar Spin Chains | — | link |
| 3 | 2605.03932 | Magic-Informed Quantum Architecture Search | — | link |
| 3 | 2605.03951 | Factoring $2048$ bit RSA integers with a half-million-qubit modular a… | — | link |
| 3 | 2605.03972 | Regev's reduction as a candidate quantum algorithm for the discre… | — | link |
| 3 | 2605.04049 | FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Har… | — | link |
| 2 | 2605.02986 | Exploiting all ancilla outcomes in linear combinations of unitaries: … | — | link |
| 2 | 2605.03104 | Strong Locality as a Tetrahedron: A Symmetry-Reduced Geometric Repres… | — | link |
| 2 | 2605.03120 | Coordination Requires a Common Cause in Quantum Theory | — | link |
| 2 | 2605.03132 | A missing causal principle: Coordination | — | link |