aiqbench analysis
This arXiv preprint is theoretical work on quantum sensing in an all-to-all dissipative feedback network. It argues that near criticality, a single local binary trajectory can carry a Fisher-information rate linear in N, and it gives bounds on how much information sparse readouts retain. Readers should note this is an analytic result about a model, not a demonstrated experiment, and it is quantum sensing rather than computing, so the category is the closest fit among the available quantum options.
Criticality Concentrates Extensive Sensing Information into a Local Readout
arXiv:2610.15364v1 Announce Type: new Abstract: We show that criticality concentrates extensive sensing information into a local trajectory. In the rapid-readout limit of an all-to-all dissipative feedback network, a single binary trajectory has a Fisher-information rate linear in $N$ for a common weak field, as does the full record. Critical slowing does not remove this gain because the local weight of the slow mode decreases with $N$. An analytic bound guarantees that the local record retains more than half of the full information across the entire channel-parameter range. We also identify how parameter drives and observation dynamics determine local access to collective information beyond permutation symmetry. Furthermore, our sparse-readout theorem establishes a $k^{-1}$ decay of fractional information loss: only $\Theta(\varepsilon^{-1})$ trajectories are needed to retain a fraction $1-\varepsilon$ of the full information rate. Any growing readout set, even of vanishing density, asymptotically recovers the full common-field Fisher-information rate.
Abstract:We show that criticality concentrates extensive sensing information into a local trajectory. In the rapid-readout limit of an all-to-all dissipative feedback network, a single binary trajectory has a Fisher-information rate linear in $N$ for a common weak field, as does the full record. Critical slowing does not remove this gain because the local weight of the slow mode decreases with $N$. An analytic bound guarantees that the local record retains more than half of the full information across the entire channel-parameter range. We also identify how parameter drives and observation dynamics determine local access to collective information beyond permutation symmetry. Furthermore, our sparse-readout theorem establishes a $k^{-1}$ decay of fractional information loss: only $\Theta(\varepsilon^{-1})$ trajectories are needed to retain a fraction $1-\varepsilon$ of the full information rate. Any growing readout set, even of vanishing density, asymptotically recovers the full common-field Fisher-information rate.
arXiv:2610.15364 [quant-ph]
(or arXiv:2610.15364v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.15364 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 233 words
Related coverage

News
Quantum Computing Report · Jul 25, 2026
Does preservation make sense before we know how to revive?
LessWrong · Jun 15, 2026
J++ Lens: Jacobian Filtering Enables More Faithful Workspace Lenses
LessWrong · Oct 8, 2026

A Candid Abacus AI Review: The All-in-One AI Platform for Professionals & Enterprises
KDnuggets · Sep 10, 2026