KrMM Recurrences: HPC-Enhanced Estimators for Nonlinear Classical Shadows

While quantum technologies are rapidly evolving, near-term applications heavily rely on hybrid quantum-classical paradigms.

By Gruber, Herbst, Brandic +1Oct 19, 2026

Score████░░░░░░4.4

Caveats

Preprint; not yet peer reviewed.

VerdictWorth a reader's time today.

Read the original PDF

Abstract

While quantum technologies are rapidly evolving, near-term applications heavily rely on hybrid quantum-classical paradigms. Among these, the classical shadows framework has gained a lot of traction, not only for quantum information science, but also for the development and verification of quantum hardware. It allows to efficiently classically estimate many properties of quantum states from randomized measurements alone, a task that is otherwise intractable due to the destructive nature of measurements in quantum systems. There are, however, many properties of interest that are, due to their very problem formulation, not efficiently estimable. In this work, we identify a computational kernel occurring in estimators of polynomial functions, a class of problems that are in general computationally difficult to solve. We show that this structure allows a row-wise partition that, together with a custom SIMD vectorization, enables massive parallelization and can reduce the computational cost significantly. We show applicability and scalability of the approach on different tasks, and our results showcase that the approach allows high sequential throughput and close-to-ideal parallel scaling. The work thus provides a new way of identifying and exploiting structure in classical shadow estimators, resulting in practical advantages on inherently difficult problems.

Matthias Gruber, Sabrina Herbst, Ivona Brandic, Vincenzo De Maio

The editor's rubric

Heuristic review

Leverage3 / 5: A method or resource many groups across the field will adopt within a year.; 18% of this desk’s rubric
Magnitude2 / 5: Solid incremental gain on a meaningful problem.; 20% of this desk’s rubric
Evidence3 / 5: Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.; 22% of this desk’s rubric
Novelty3 / 5: A genuinely new approach to an open problem.; 22% of this desk’s rubric
Trajectory3 / 5: A clear path to scale.; 10% of this desk’s rubric
Stakes2 / 5: Benefits a professional community (practitioners, clinicians, engineers).; 8% of this desk’s rubric

Dimension	Level	Weight	What that level means
Leverage	███░░ 3	18%	A method or resource many groups across the field will adopt within a year.
Magnitude	██░░░ 2	20%	Solid incremental gain on a meaningful problem.
Evidence	███░░ 3	22%	Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
Novelty	███░░ 3	22%	A genuinely new approach to an open problem.
Trajectory	███░░ 3	10%	A clear path to scale.
Stakes	██░░░ 2	8%	Benefits a professional community (practitioners, clinicians, engineers).

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we report); novelty (new kind, discovery); design (randomized); scale (scalable, efficient).

How the score was computed

rank-2026-10-18

Score████░░░░░░4.4

Score = 10 × (75% × adjusted merit / 10 + 15% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit: 5.4 / 10; Weighted rubric, evidence-gated.
Adjusted merit: 4.6 / 10; Shrunk toward the desk prior by editor confidence (42%).
Attention: 0%; Citations, upvotes, points, mentions.
Freshness: 93%; Half-life decay since publication.

No attention signals recorded yet.

The record

Reviewed by heuristic-v7 on Oct 20, 2026, 07:29 UTC. Paper type: method.
Categories: cs.DC, cs.ET, quant-ph
TOP, No.5 in the Front page edition of October 20, 2026.
TOP, No.1 in the Physics edition of October 20, 2026.