quant-ph digest — 2026-05-09

Generated 2026-05-09 · 77 entries scored · 9 relevant

Scored against Yuan's research programme (Y1–Y6):

Source

arXiv listing: https://arxiv.org/list/quant-ph/new (59 new + 18 cross = 77 entries)

Coverage: all 77 entries scored. 9 relevant (score ≥ 1); 68 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 Search without Global Diffusion

📖 Open deep analysis →

Quantum search is among the most important algorithms in quantum computing. At its core is quantum amplitude amplification, a technique that achieves a quadratic speedup over classical search by combining two global reflections: the oracle, which marks the target, and the diffusion operator, which reflects about the initial state. We show that this speedup can be preserved when the oracle is the only global operator, with all other operations acting locally on non-overlapping partitions of the search register. We present a recursive construction that, when the initial and target states both decompose as tensor products over these chosen partitions, admits an exact closed-form solution for the algorithm's dynamics. …

Asymptotic optimality of Grover–Radhakrishnan–Korepin algorithm

📖 Open deep analysis →

Grover's algorithm is a cornerstone of quantum algorithms and is strictly optimal in oracle-query complexity. While the full search problem admits no further improvement, one may trade accuracy for speed in the partial search problem, where the task is to identify only the block containing the target item. The best known quantum algorithm for the partial search problem is the Grover-Radhakrishnan-Korepin (GRK) algorithm, whose optimality has long been conjectured but not proved. In this work, we prove the optimality of GRK in the large-block limit. …

Moderately relevant (score 5–7) — 5 papers

Observable-Guided Generator Selection for Improving Trainability in Quantum Machine Learning

To study generator design for parameterized unitaries in quantum machine learning (QML), we propose an observable-guided generator selection algorithm for n-qubit Pauli-string generator pools. The proposed method selects generators based on two criteria: maintaining large first-order sensitivity in the gradients and suppressing second-order interference in the Hessian matrix. Under a restricted setting with Pauli-string observables and candidate generators, the selection problem can be formulated as a binary optimization problem that favors mutually anti-commuting generators. …

Quantum computation at the edge of chaos

A key challenge in classical machine learning is to mitigate overparameterization by selecting sparse solutions. We translate this concept to the quantum domain, introducing quantum sparsity as a principle based on minimizing quantum information shared across multiple parties. This allows us to address fundamental issues in quantum data processing and convergence issues such as the barren plateau problem in Variational Quantum Algorithm (VQA). We propose a practical implementation of this principle using the topological Entanglement Entropy (TEE) as a cost function regularizer. A non-negative TEE is associated with states with a sparse structure in a suitable basis, while a negative TEE signals untrainable chaos. …

Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment

In the recent quantum echoes experiment, Google Quantum AI showed that out-of-time-order correlators (OTOCs) for random-circuit time evolution can be measured using a quantum processor more than 10,000x faster than they can be computed to similar accuracy via classical computation. This claim was substantiated by comparison with a variety of state-of-the-art classical simulation methods. One classical simulation method that was not explicitly tested was tensor networks with belief propagation (TNBP). TNBP should be poorly suited to simulating Google's echoes experiment: the states involved are highly entangled, a challenge for tensor network states; and the Willow chip has dense 2D connectivity, a challenge for belief propagation. …

Aziz and Howl's Gravity-Induced Entanglement Channel is Essentially Classical Mechanics

Aziz and Howl argued that a classical gravitational field can generate quantum entanglement through a quantum-field-theoretic channel mediated by virtual matter propagation. However, their claimed channel is more naturally and accurately understood as semiclassical wavepacket motion in an external gravitational field, rather than as a distinctively quantum-field-theoretic entangling effect. Moreover, the result of their perturbative computation is incorrectly magnified: they selected a discontinuous wavefunction with infinite kinetic energy as the initial state and simultaneously treated it as stationary. …

Boson correlations are spurious for classical states

We show that boson correlations from quantum states with a Glauber-Sudarshan representation of their density matrix which provides a well-behaved probability distribution -- including coherent states, thermal states, and all states that can be deemed classical -- are a manifestation of the Simpson paradox: they are spurious correlations from statistical (ensemble) averages over uncorrelated measurements made in varying geometries, due to a process of symmetry-breaking as a confounding factor. Bosonic correlations encoded by the wavefunction appear to be formed in the geometry assumed, which however is not that of the statistical ensemble but varies from realization to realization. …

Tangential (score 1–4) — 2 papers

Summary table

ScorearXiv IDShort titleOverlapsarXiv
82604.15435Quantum Search without Global DiffusionY4, Y3link
82604.15886Asymptotic optimality of GRK algorithmY4, Y3link
62604.15693Observable-Guided Generator Selection (QML)Y2, Y1link
52604.15441Quantum computation at the edge of chaosY1, Y3link
52604.15427TNBP cannot simulate Google quantum echoesY3, Y5link
52604.16276Aziz–Howl gravity-induced entanglement is classicalY6link
52604.16283Boson correlations are spurious for classical statesY6link
42604.16051Comment on local hidden-state modelsY6link
32604.15540Accessible Quantum Correlations Under ComplexityY5link

Source: arXiv quant-ph new submissions · scored against Y1–Y6