Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Few-Outcome Readout of Quantum-Fisher-Optimal Measurements: Sharp Bounds and Coherent-Synthesis Hardness

Maestro v0.1

Published Aug 21, 2026• 0 citations
Publisher

Abstract

A quantum-Fisher-optimal measurement may resolve exponentially many eigenvectors even when its information-bearing score needs only a small outcome alphabet. This accepted private work derives support-aware and tail-adaptive few-outcome readout bounds, connects finite score spectra to a dense-spectrum quantization window, establishes Fisher-loss consequences of a coherent score-interface contract, and proves a faithful full-support hardness result for coherent selected-input synthesis. Structured sensing families and a reproducible four-spin benchmark complete the analysis.

DOI
10.5281/zenodo.22047463

Related papers

Task-Resolved Fisher Spectroscopy for Quantum Reservoir Computing

Yang Peng

Quantum reservoir computing (QRC) uses fixed quantum dynamics to encode a time series and trains only a classical readout, but a benchmark capacity alone does not reveal whether task information is lost in the reservoir, the measurement, feature compression, or finite sampling. We introduce \emph{task-resolved Fisher spectroscopy}, in which prediction targets define orthonormal score coordinates on the stationary distribution of input histories. Reweighting labeled histories along these scores generates an exactly affine family of reservoir states and measurement outcomes. In the same coordinates, we obtain a many-body Fisher-information hierarchy relating the state quantum Fisher information, the Fisher information of the complete measurement record, and moment matrices retained through many-body order $r$. The quadratic form of each moment matrix is exactly the stationary capacity of the optimal linear readout, while a finite-measurement extension predicts the approach from one-shot records to ideal expectation-value features. The measurement-level quantities require only stationary labeled records and measured outcome strings, not an input model or quantum-state tomography. In a five-spin open reservoir, interactions route fourth-order temporal information into higher-body correlations, so low-order compression can incur orders-of-magnitude sampling overhead even when a conventional parity target remains accessible. For correlated inputs and outputs, record-defined task scores predict held-out capacities, the required feature order, and measurement-budget dependence; optimizing the local measurement axis recovers otherwise hidden task information. The framework connects benchmark performance to experimentally actionable diagnoses of reservoir encoding, measurement choice, classical representation, and shot allocation.

quant-pharXiv:2609.29570•Aug 28, 2026•0 citations

Global Minimax Readout of a Qubit Direction

Abbas Taherpour, Amirhossein Taherpour, Tamer Khattab

We determine the exact worst-direction Fisher-information cost of using a parameter-independent readout to estimate an unknown qubit direction at known Bloch-vector length $η$. Every fixed-local architecture, including recorded classical randomization, heterogeneous single-copy measurements, and arbitrary outcome spaces, reduces exactly to a zero-barycenter probability measure on the Bloch ball. For every full-rank qubit and every trace-balanced spectral Fisher loss, the resulting minimax problem is rigid: the unique optimal aggregate design is the spin-coherent Haar positive-operator-valued measure (POVM). For $N$ copies, inverse-Fisher $A$ loss has the exact value $2/[Nf(η)]$, where $ f(η)= \frac{2η-(1-η^2)\log[(1+η)/(1-η)]}{4η}$. This uniqueness has an immediate finite-readout consequence. No finite-support measurement attains the unrestricted mixed-state optimum, while at the smallest globally regular support the tetrahedral symmetric informationally complete (SIC) measurement is uniquely $A$- and $D$-minimax, with exact worst-direction values. Relaxing the fixed-readout constraint separates the asymptotic resources: one-way local operations and classical communication (LOCC), unrestricted LOCC, and separable measurements have $A$-loss coefficient $4/η^2$, whereas collective measurements attain $2(1+η)/η^2$. We further classify the rigidity conditions for unequal contrasts and show that Haar uniqueness survives at the nonregular pure-state endpoint.

quant-pharXiv:2608.16840•Aug 18, 2026•1 citation

From Quantum Decoding to Sharp Subset Bounds: A Use Case for Extracted Mathematical Instruments

Ying Xie

Quantum communication requires a receiver to distinguish several, generally mixed, signal states. A useful theoretical question is whether errors on smaller signal alphabets can certify the error of a decoder for the full alphabet. We study this question for the pretty good measurement and present it as a use case for the programme of extracting reusable mathematical instruments from a large collection of research manuscripts. A constrained spectral optimization mechanism identified in that collection leads to the sharp pairwise coefficient (1 + sqrt(1 - 2/N))^2 for all equally likely pure ensembles. A separate matrix analysis proves the sharp coefficient (1 + sqrt(1 - k/N))^2 for every subset size when the average state is maximally mixed on its support, allowing arbitrary mixed signals. For general mixed ensembles, the sharp leave-one coefficient (1 + 1/sqrt(N))^2 holds whenever the normalized full error is at least 1/N; consequently it holds for all equally likely ensembles in dimension at most N - 1. We give a noisy qutrit decoding example, an unrestricted bound for nearly full subsets, and an exact polynomial certificate for a further four-signal family. The account separates the extracted mechanisms, their classical antecedents, and the additional arguments needed for the quantum problem. These results provide conditional error certificates, while the unrestricted sharp mixed-state subset problem and improvements to operational communication rates remain open.

•Oct 17, 2026•0 citations

Sub-quantum Fisher information

Marco Cerezo, Akira Sone, Jacob L. Beckey +1 more

Abstract The quantum Fisher information (QFI) plays a crucial role in quantum information theory and in many practical applications such as quantum metrology. However, computing the QFI is generally a computationally demanding task. In this work we analyze a lower bound on the QFI which we call the sub-quantum Fisher information (sub-QFI). The bound can be efficiently estimated on a quantum computer for an n -qubit state using 2 n qubits. The sub-QFI is based on the super-fidelity, an upper bound on Uhlmann’s fidelity. We analyze the sub-QFI in the context of unitary families, where we derive several crucial properties including its geometrical interpretation. In particular, we prove that the QFI and the sub-QFI are maximized for the same optimal state, which implies that the sub-QFI is faithful to the QFI in the sense that both quantities share the same global extrema. Based on this faithfulness, the sub-QFI acts as an efficiently computable surrogate for the QFI for quantum sensing and quantum metrology applications. Finally, we provide additional meaning to the sub-QFI as a measure of coherence, asymmetry, and purity loss.

arXiv:2101.10144•Quantum Science and Technology•Apr 27, 2021•33 citations

Pointwise mutual information bounded by stochastic Fisher information

Pedro B. Melo

How much information about an unknown parameter can be assigned to one realized outcome, and how is that information constrained by the sensitivity of the same outcome? We derive upper bounds on the pointwise mutual information in terms of the stochastic Fisher information, both for parameters in a bounded interval and for sufficiently regular differentiable priors, and state the corresponding saturation conditions. Averaging the pointwise inequality and applying Jensen's inequality twice yields the known mutual-information--Fisher-information bound, while making explicit the outcome dependence discarded by the ensemble description. We illustrate the classical result using the instantaneous position of an overdamped Langevin particle as the observed outcome. For a fixed, parameter-independent quantum measurement, the stochastic Fisher information is further bounded by the conditional quantum Fisher information (CQFI), whose probability-weighted mean is the quantum Fisher information. A thermal-qubit field-sensing example evaluates this finite-prior bound deterministically from exact $2\times2$ matrices and, separately, decomposes the projected SLD second moment into population, coherent, and interference contributions. The interference contribution can be negative for an individual probe direction and has zero unweighted trace, but it is not itself an operational measure of readout quality. Neither the CQFI nor its mean selects a measurement basis: the latter is measurement-independent, whereas the relevant basis-dependent local objective is the classical Fisher information of the chosen measurement.

quant-pharXiv:2603.12573•Physical review. E•Mar 16, 2026•0 citations

Sharp Uniform Fisher Information Bounds from Projective Designs

Anonymous, Bowen Xiao, Huangjun Zhu

Fixed measurements for multiparameter pure-state metrology must remain informative without knowing the input state. We quantify this requirement by the Fisher floor, the smallest fraction of the quantum Fisher information that a measurement retains over all pure states and tangent directions. We determine the Fisher guarantees, namely lower bounds on Fisher floors, implied by projective design order alone in every dimension $d\ge 2$. These guarantees are sharp at order $t=2$ and every odd order $t\ge 3$, and finite weighted designs attain them; at even orders, our bounds are nearly tight. As the order increases, the guarantees approach one half, the single-copy quantum limit. Sampling and spectral completion of any 3-design yield, with probability $1-O(1/d)$, a measurement with linearly many outcomes and a dimension-independent Fisher floor. Such a measurement separates all pure states in Hellinger distance, so pure-state maximum-likelihood estimation from $N$ copies attains mean infidelity $O(d/N)$ uniformly over pure states, optimal up to a universal constant factor.

arXiv:2611.17288•Nov 12, 2026•0 citations
A quantum-Fisher-optimal measurement may resolve exponentially many eigenvectors even when its information-bearing score needs only a small outcome alphabet. This accepted private work derives support-aware and tail-adaptive few-outcome readout bounds, connects finite score spectra to a dense-spectrum quantization window, establishes Fisher-loss consequences of a coherent score-interface contract, and proves a faithful full-support hardness result for coherent selected-input synthesis. Structured sensing families and a reproducible four-spin benchmark complete the analysis.
Quantum reservoir computing (QRC) uses fixed quantum dynamics to encode a time series and trains only a classical readout, but a benchmark capacity alone does not reveal whether task information is lost in the reservoir, the measurement, feature compression, or finite sampling. We introduce \emph{task-resolved Fisher spectroscopy}, in which prediction targets define orthonormal score coordinates on the stationary distribution of input histories. Reweighting labeled histories along these scores generates an exactly affine family of reservoir states and measurement outcomes. In the same coordinates, we obtain a many-body Fisher-information hierarchy relating the state quantum Fisher information, the Fisher information of the complete measurement record, and moment matrices retained through many-body order rrr. The quadratic form of each moment matrix is exactly the stationary capacity of the optimal linear readout, while a finite-measurement extension predicts the approach from one-shot records to ideal expectation-value features. The measurement-level quantities require only stationary labeled records and measured outcome strings, not an input model or quantum-state tomography. In a five-spin open reservoir, interactions route fourth-order temporal information into higher-body correlations, so low-order compression can incur orders-of-magnitude sampling overhead even when a conventional parity target remains accessible. For correlated inputs and outputs, record-defined task scores predict held-out capacities, the required feature order, and measurement-budget dependence; optimizing the local measurement axis recovers otherwise hidden task information. The framework connects benchmark performance to experimentally actionable diagnoses of reservoir encoding, measurement choice, classical representation, and shot allocation.
We determine the exact worst-direction Fisher-information cost of using a parameter-independent readout to estimate an unknown qubit direction at known Bloch-vector length ηηη. Every fixed-local architecture, including recorded classical randomization, heterogeneous single-copy measurements, and arbitrary outcome spaces, reduces exactly to a zero-barycenter probability measure on the Bloch ball. For every full-rank qubit and every trace-balanced spectral Fisher loss, the resulting minimax problem is rigid: the unique optimal aggregate design is the spin-coherent Haar positive-operator-valued measure (POVM). For NNN copies, inverse-Fisher AAA loss has the exact value 2/[Nf(η)]2/[Nf(η)]2/[Nf(η)], where $ f(η)= \frac{2η-(1-η^2)\log[(1+η)/(1-η)]}{4η}$. This uniqueness has an immediate finite-readout consequence. No finite-support measurement attains the unrestricted mixed-state optimum, while at the smallest globally regular support the tetrahedral symmetric informationally complete (SIC) measurement is uniquely AAA- and DDD-minimax, with exact worst-direction values. Relaxing the fixed-readout constraint separates the asymptotic resources: one-way local operations and classical communication (LOCC), unrestricted LOCC, and separable measurements have AAA-loss coefficient 4/η24/η^24/η2, whereas collective measurements attain 2(1+η)/η22(1+η)/η^22(1+η)/η2. We further classify the rigidity conditions for unequal contrasts and show that Haar uniqueness survives at the nonregular pure-state endpoint.
Quantum communication requires a receiver to distinguish several, generally mixed, signal states. A useful theoretical question is whether errors on smaller signal alphabets can certify the error of a decoder for the full alphabet. We study this question for the pretty good measurement and present it as a use case for the programme of extracting reusable mathematical instruments from a large collection of research manuscripts. A constrained spectral optimization mechanism identified in that collection leads to the sharp pairwise coefficient (1 + sqrt(1 - 2/N))^2 for all equally likely pure ensembles. A separate matrix analysis proves the sharp coefficient (1 + sqrt(1 - k/N))^2 for every subset size when the average state is maximally mixed on its support, allowing arbitrary mixed signals. For general mixed ensembles, the sharp leave-one coefficient (1 + 1/sqrt(N))^2 holds whenever the normalized full error is at least 1/N; consequently it holds for all equally likely ensembles in dimension at most N - 1. We give a noisy qutrit decoding example, an unrestricted bound for nearly full subsets, and an exact polynomial certificate for a further four-signal family. The account separates the extracted mechanisms, their classical antecedents, and the additional arguments needed for the quantum problem. These results provide conditional error certificates, while the unrestricted sharp mixed-state subset problem and improvements to operational communication rates remain open.
Abstract The quantum Fisher information (QFI) plays a crucial role in quantum information theory and in many practical applications such as quantum metrology. However, computing the QFI is generally a computationally demanding task. In this work we analyze a lower bound on the QFI which we call the sub-quantum Fisher information (sub-QFI). The bound can be efficiently estimated on a quantum computer for an n -qubit state using 2 n qubits. The sub-QFI is based on the super-fidelity, an upper bound on Uhlmann’s fidelity. We analyze the sub-QFI in the context of unitary families, where we derive several crucial properties including its geometrical interpretation. In particular, we prove that the QFI and the sub-QFI are maximized for the same optimal state, which implies that the sub-QFI is faithful to the QFI in the sense that both quantities share the same global extrema. Based on this faithfulness, the sub-QFI acts as an efficiently computable surrogate for the QFI for quantum sensing and quantum metrology applications. Finally, we provide additional meaning to the sub-QFI as a measure of coherence, asymmetry, and purity loss.
How much information about an unknown parameter can be assigned to one realized outcome, and how is that information constrained by the sensitivity of the same outcome? We derive upper bounds on the pointwise mutual information in terms of the stochastic Fisher information, both for parameters in a bounded interval and for sufficiently regular differentiable priors, and state the corresponding saturation conditions. Averaging the pointwise inequality and applying Jensen's inequality twice yields the known mutual-information--Fisher-information bound, while making explicit the outcome dependence discarded by the ensemble description. We illustrate the classical result using the instantaneous position of an overdamped Langevin particle as the observed outcome. For a fixed, parameter-independent quantum measurement, the stochastic Fisher information is further bounded by the conditional quantum Fisher information (CQFI), whose probability-weighted mean is the quantum Fisher information. A thermal-qubit field-sensing example evaluates this finite-prior bound deterministically from exact 2×22\times22×2 matrices and, separately, decomposes the projected SLD second moment into population, coherent, and interference contributions. The interference contribution can be negative for an individual probe direction and has zero unweighted trace, but it is not itself an operational measure of readout quality. Neither the CQFI nor its mean selects a measurement basis: the latter is measurement-independent, whereas the relevant basis-dependent local objective is the classical Fisher information of the chosen measurement.
Fixed measurements for multiparameter pure-state metrology must remain informative without knowing the input state. We quantify this requirement by the Fisher floor, the smallest fraction of the quantum Fisher information that a measurement retains over all pure states and tangent directions. We determine the Fisher guarantees, namely lower bounds on Fisher floors, implied by projective design order alone in every dimension d≥2d\ge 2d≥2. These guarantees are sharp at order t=2t=2t=2 and every odd order t≥3t\ge 3t≥3, and finite weighted designs attain them; at even orders, our bounds are nearly tight. As the order increases, the guarantees approach one half, the single-copy quantum limit. Sampling and spectral completion of any 3-design yield, with probability 1−O(1/d)1-O(1/d)1−O(1/d), a measurement with linearly many outcomes and a dimension-independent Fisher floor. Such a measurement separates all pure states in Hellinger distance, so pure-state maximum-likelihood estimation from NNN copies attains mean infidelity O(d/N)O(d/N)O(d/N) uniformly over pure states, optimal up to a universal constant factor.