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

arXiv:2611.16578

Asymptotic Attainability of the Channel RLD Fisher-Information Bound

Masahito Hayashi

Published Nov 12, 2026• 0 citations
arXivHTMLPDF

Abstract

The channel right-logarithmic-derivative (RLD) Fisher information is a computable upper bound on the optimal asymptotic symmetric-logarithmic-derivative (SLD) Fisher information per channel use over causally ordered, parameter-independent strategies. The bound is not always attained, even if the Choi matrix is positive definite. We determine exactly when equality holds using a semidefinite feasibility condition involving only the Choi matrix and its first derivative. The condition allows a degenerate largest eigenvalue of the RLD matrix and rank-deficient Choi matrices with derivatives supported on their range. The original channel family may change rank nearby. For generalized dephasing channels with a positive-definite correlation matrix at the evaluation point, the condition becomes a system of linear equations for nonnegative certificate weights that sum to one. At a completely dephasing point we also calculate the optimal SLD information for every finite number of uses and show that a repeated, ancilla-free probe attains it, even against adaptive strategies. Explicit examples give an unbounded ratio of the channel RLD information to the optimal asymptotic SLD information per use, either as the dimension grows or at fixed qubit dimension as the smallest Choi eigenvalue tends to zero. We derive the equality criterion and its consequences from the asymptotic optimization of Zhou and Jiang.

DOI
10.48550/arxiv.2611.16578

Related papers

Exact Characterization of the Holevo Bound by a Quantum Fisher Information Family

Koji Yamaguchi, Hiroyasu Tajima

The quantum Cramér-Rao bound constrains the precision of parameter estimation through the symmetric logarithmic derivative quantum Fisher information (SLD QFI). It is asymptotically achievable for regular single-parameter estimation models, but generally not in the multiparameter setting, where optimal measurements for different parameters may be incompatible. For multiparameter estimation, allowing collective measurements, the corresponding asymptotically achievable precision limit is the Holevo bound, whose standard formulation is an optimization over auxiliary Hermitian operators. We bridge this apparent difference in formulation by giving an exact characterization of the Holevo bound in terms of a family of QFIs interpolating between the SLD and right logarithmic derivative (RLD) QFIs. Specifically, for any locally identifiable finite-dimensional estimation problem, we prove that the operator-feasible region in the standard variational definition of the Holevo bound coincides with the intersection of the regions defined by the corresponding Cramér-Rao-type matrix constraints for the entire QFI family. This characterization also applies to rank-deficient states and does not require any prior choice of weight matrix. Consequently, the conventional weight-dependent Holevo bound is recovered by minimizing the corresponding weighted cost over the resulting common feasible region.

quant-pharXiv:2609.31601•Sep 28, 2026•0 citations

Geometric Rényi divergence and RLD Fisher information under quantum processes without definite causal order

Zixin Huang, Mark M. Wilde

Quantum experiments without a definite causal order offer new ways to distinguish devices, estimate physical parameters, and communicate. We prove a common limit on these tasks: the geometric Rényi divergence at the output of a deterministic completely positive process cannot exceed the sum of the divergences of its individual channel uses. The inequality holds for every Rényi order in $(0,1)\cup(1,2]$ and any number of independently replaceable channels. Parallel experiments with separate reference-assisted inputs approach the bound, giving an exact equality after optimization over processes. We also prove an additive bound on the right logarithmic derivative Fisher information of parameter-dependent channels under every fixed process in this class. A resulting Cramér--Rao bound limits locally unbiased estimation precision without assuming a definite causal order, and an erasure-probability example attains the bound. The proofs for the geometric Rényi divergence and RLD Fisher information follow from the requirement that every independent choice of channels produce a normalized output. We show how this requirement controls positive local operations, and how small channel perturbations convert the divergence inequality into a Fisher-information bound, including for singular channels. Further applications give finite-use bounds on channel discrimination and exclusion, together with communication and private-state-generation converses when the processes preserve the relevant comparison conditions.

quant-pharXiv:2610.39217•Oct 30, 2026•1 citation

Analysis of a convenient information bound for general quantum channels

C J O'Loan

Open questions from Sarovar and Milburn (2006 J.Phys. A: Math. Gen. 39 8487) are answered. Sarovar and Milburn derived a convenient upper bound for the Fisher information of a one-parameter quantum channel. They showed that for quasi-classical models their bound is achievable and they gave a necessary and sufficient condition for positive operator-valued measures (POVMs) attaining this bound. They asked (i) whether their bound is attainable more generally, (ii) whether explicit expressions for optimal POVMs can be derived from the attainability condition. We show that the symmetric logarithmic derivative (SLD) quantum information is less than or equal to the SM bound, i.e.\ $H(θ) \leq C_Υ(θ)$ and we find conditions for equality. As the Fisher information is less than or equal to the SLD quantum information, i.e. $F_M(θ) \leq H(θ)$, we can deduce when equality holds in $F_M(θ) \leq C_Υ(θ)$. Equality does not hold for all channels. As a consequence, the attainability condition cannot be used to test for optimal POVMs for all channels. These results are extended to multi-parameter channels.

arXiv:0705.0931•Journal of Physics A Mathematical and Theoretical•Nov 14, 2007•3 citations

Greatest Quantum Channels with Prescribed Maximal Information

Harjas Sandhu

Two quantum channels can have identical information geometry while allowing different physical simulations. This paper asks whether a complete RLD information profile has a greatest realization: a channel from which every other realization of that profile can be produced by deterministic postprocessing. Equality of right logarithmic derivative (RLD) Fisher information for every faithful input, tangent and finite quantum reference determines a labelled von Neumann algebra, a normalized channel and a faithful normal state. The same equivalence relation is obtained from complete maximal f-divergences. Every finite-dimensional invariant has a greatest representative of minimum possible effective output dimension, without requiring the invariant state to be tracial. For separable trace-class outputs with a faithful normal tracial invariant state, an exact greatest member exists precisely when the algebra is a countable product of finite matrix algebras. Arbitrarily accurate greatest members within the same exact profile class exist precisely when the algebra is injective. Existence of a single sequence approximating every fixed target already implies existence of a sequence whose diamond-norm error is uniform over all targets. Spectral pinching and finite-dimensional Haar averaging connect these operational requirements to established operator-algebraic approximation theory. The paper gives diffuse binary examples, an explicit free-group class with a finite quantitative obstruction, polynomial-time exact profile comparison and polynomial-bit faithful witnesses for rational finite channels, and finite probe identification with conditioned stability. A fixed full-support family shows that capacity optimized over an exact profile class can be discontinuous even while every physical channel in the family is antidegradable and has zero quantum capacity. The infinite-output classification requires the stated tracial hypothesis. It supplies neither an effective general filtration nor an experimental convergence rate. The atomic/injective distinction, reverse-test and sufficiency theory, amenability machinery and finite identification methods are credited to their primary sources. RLD-profile equality is distinct from the SLD, Umegaki and Holevo comparison problems studied in Complete information orders of quantum channels: equivalence and undecidability.

•Nov 6, 2026•0 citations

An attainable Gill-Massar-type bound for spin-factor models

Koichi Yamagata

We determine the exact local precision limits for single-copy estimation of smooth multiparameter quantum statistical models contained in spin factors, a class of matrix Jordan algebras whose state spaces generalize the qubit Bloch ball. At any parameter point where the symmetric logarithmic derivative (SLD) Fisher information is positive definite, we characterize the entire attainable classical Fisher-information region over all finite-outcome positive-operator-valued measurements. After SLD normalization, this region consists exactly of the real symmetric positive semidefinite matrices with trace at most one, independently of the ambient Hilbert-space dimension. This yields a sharp weighted covariance bound for every positive definite weight, attained by an explicit locally unbiased estimator based on randomized spectral measurements of SLD directions. The proof combines a statistics-preserving positive projection onto the spin factor with the two-eigenvalue structure of its effects, revealing the Jordan-algebraic origin of the tradeoff. The result extends the qubit information tradeoff to models with more than three parameters. Since the optimal measurement depends on the unknown parameter, we simulate an adaptive scheme for a five-parameter model on a four-dimensional Hilbert space and observe performance close to the optimal local benchmark.

quant-pharXiv:2609.23020•Sep 22, 2026•0 citations

Explicit formula for the Holevo bound for two-parameter qubit-state estimation problem

Jun Suzuki

The main contribution of this paper is to derive an explicit expression for the fundamental precision bound, the Holevo bound, for estimating any two-parameter family of qubit mixed-states in terms of quantum versions of Fisher information. The obtained formula depends solely on the symmetric logarithmic derivative (SLD), the right logarithmic derivative (RLD) Fisher information, and a given weight matrix. This result immediately provides necessary and sufficient conditions for the following two important classes of quantum statistical models; the Holevo bound coincides with the SLD Cramér-Rao bound and it does with the RLD Cramér-Rao bound. One of the important results of this paper is that a general model other than these two special cases exhibits an unexpected property: the structure of the Holevo bound changes smoothly when the weight matrix varies. In particular, it always coincides with the RLD Cramér-Rao bound for a certain choice of the weight matrix. Several examples illustrate these findings.

arXiv:1505.06437•Journal of Mathematical Physics•Apr 1, 2016•82 citations
The channel right-logarithmic-derivative (RLD) Fisher information is a computable upper bound on the optimal asymptotic symmetric-logarithmic-derivative (SLD) Fisher information per channel use over causally ordered, parameter-independent strategies. The bound is not always attained, even if the Choi matrix is positive definite. We determine exactly when equality holds using a semidefinite feasibility condition involving only the Choi matrix and its first derivative. The condition allows a degenerate largest eigenvalue of the RLD matrix and rank-deficient Choi matrices with derivatives supported on their range. The original channel family may change rank nearby. For generalized dephasing channels with a positive-definite correlation matrix at the evaluation point, the condition becomes a system of linear equations for nonnegative certificate weights that sum to one. At a completely dephasing point we also calculate the optimal SLD information for every finite number of uses and show that a repeated, ancilla-free probe attains it, even against adaptive strategies. Explicit examples give an unbounded ratio of the channel RLD information to the optimal asymptotic SLD information per use, either as the dimension grows or at fixed qubit dimension as the smallest Choi eigenvalue tends to zero. We derive the equality criterion and its consequences from the asymptotic optimization of Zhou and Jiang.
The quantum Cramér-Rao bound constrains the precision of parameter estimation through the symmetric logarithmic derivative quantum Fisher information (SLD QFI). It is asymptotically achievable for regular single-parameter estimation models, but generally not in the multiparameter setting, where optimal measurements for different parameters may be incompatible. For multiparameter estimation, allowing collective measurements, the corresponding asymptotically achievable precision limit is the Holevo bound, whose standard formulation is an optimization over auxiliary Hermitian operators. We bridge this apparent difference in formulation by giving an exact characterization of the Holevo bound in terms of a family of QFIs interpolating between the SLD and right logarithmic derivative (RLD) QFIs. Specifically, for any locally identifiable finite-dimensional estimation problem, we prove that the operator-feasible region in the standard variational definition of the Holevo bound coincides with the intersection of the regions defined by the corresponding Cramér-Rao-type matrix constraints for the entire QFI family. This characterization also applies to rank-deficient states and does not require any prior choice of weight matrix. Consequently, the conventional weight-dependent Holevo bound is recovered by minimizing the corresponding weighted cost over the resulting common feasible region.
Quantum experiments without a definite causal order offer new ways to distinguish devices, estimate physical parameters, and communicate. We prove a common limit on these tasks: the geometric Rényi divergence at the output of a deterministic completely positive process cannot exceed the sum of the divergences of its individual channel uses. The inequality holds for every Rényi order in (0,1)∪(1,2](0,1)\cup(1,2](0,1)∪(1,2] and any number of independently replaceable channels. Parallel experiments with separate reference-assisted inputs approach the bound, giving an exact equality after optimization over processes. We also prove an additive bound on the right logarithmic derivative Fisher information of parameter-dependent channels under every fixed process in this class. A resulting Cramér--Rao bound limits locally unbiased estimation precision without assuming a definite causal order, and an erasure-probability example attains the bound. The proofs for the geometric Rényi divergence and RLD Fisher information follow from the requirement that every independent choice of channels produce a normalized output. We show how this requirement controls positive local operations, and how small channel perturbations convert the divergence inequality into a Fisher-information bound, including for singular channels. Further applications give finite-use bounds on channel discrimination and exclusion, together with communication and private-state-generation converses when the processes preserve the relevant comparison conditions.
Open questions from Sarovar and Milburn (2006 J.Phys. A: Math. Gen. 39 8487) are answered. Sarovar and Milburn derived a convenient upper bound for the Fisher information of a one-parameter quantum channel. They showed that for quasi-classical models their bound is achievable and they gave a necessary and sufficient condition for positive operator-valued measures (POVMs) attaining this bound. They asked (i) whether their bound is attainable more generally, (ii) whether explicit expressions for optimal POVMs can be derived from the attainability condition. We show that the symmetric logarithmic derivative (SLD) quantum information is less than or equal to the SM bound, i.e.\ H(θ)≤CΥ(θ)H(θ) \leq C_Υ(θ)H(θ)≤CΥ​(θ) and we find conditions for equality. As the Fisher information is less than or equal to the SLD quantum information, i.e. FM(θ)≤H(θ)F_M(θ) \leq H(θ)FM​(θ)≤H(θ), we can deduce when equality holds in FM(θ)≤CΥ(θ)F_M(θ) \leq C_Υ(θ)FM​(θ)≤CΥ​(θ). Equality does not hold for all channels. As a consequence, the attainability condition cannot be used to test for optimal POVMs for all channels. These results are extended to multi-parameter channels.
Two quantum channels can have identical information geometry while allowing different physical simulations. This paper asks whether a complete RLD information profile has a greatest realization: a channel from which every other realization of that profile can be produced by deterministic postprocessing. Equality of right logarithmic derivative (RLD) Fisher information for every faithful input, tangent and finite quantum reference determines a labelled von Neumann algebra, a normalized channel and a faithful normal state. The same equivalence relation is obtained from complete maximal f-divergences. Every finite-dimensional invariant has a greatest representative of minimum possible effective output dimension, without requiring the invariant state to be tracial. For separable trace-class outputs with a faithful normal tracial invariant state, an exact greatest member exists precisely when the algebra is a countable product of finite matrix algebras. Arbitrarily accurate greatest members within the same exact profile class exist precisely when the algebra is injective. Existence of a single sequence approximating every fixed target already implies existence of a sequence whose diamond-norm error is uniform over all targets. Spectral pinching and finite-dimensional Haar averaging connect these operational requirements to established operator-algebraic approximation theory. The paper gives diffuse binary examples, an explicit free-group class with a finite quantitative obstruction, polynomial-time exact profile comparison and polynomial-bit faithful witnesses for rational finite channels, and finite probe identification with conditioned stability. A fixed full-support family shows that capacity optimized over an exact profile class can be discontinuous even while every physical channel in the family is antidegradable and has zero quantum capacity. The infinite-output classification requires the stated tracial hypothesis. It supplies neither an effective general filtration nor an experimental convergence rate. The atomic/injective distinction, reverse-test and sufficiency theory, amenability machinery and finite identification methods are credited to their primary sources. RLD-profile equality is distinct from the SLD, Umegaki and Holevo comparison problems studied in Complete information orders of quantum channels: equivalence and undecidability.
We determine the exact local precision limits for single-copy estimation of smooth multiparameter quantum statistical models contained in spin factors, a class of matrix Jordan algebras whose state spaces generalize the qubit Bloch ball. At any parameter point where the symmetric logarithmic derivative (SLD) Fisher information is positive definite, we characterize the entire attainable classical Fisher-information region over all finite-outcome positive-operator-valued measurements. After SLD normalization, this region consists exactly of the real symmetric positive semidefinite matrices with trace at most one, independently of the ambient Hilbert-space dimension. This yields a sharp weighted covariance bound for every positive definite weight, attained by an explicit locally unbiased estimator based on randomized spectral measurements of SLD directions. The proof combines a statistics-preserving positive projection onto the spin factor with the two-eigenvalue structure of its effects, revealing the Jordan-algebraic origin of the tradeoff. The result extends the qubit information tradeoff to models with more than three parameters. Since the optimal measurement depends on the unknown parameter, we simulate an adaptive scheme for a five-parameter model on a four-dimensional Hilbert space and observe performance close to the optimal local benchmark.
The main contribution of this paper is to derive an explicit expression for the fundamental precision bound, the Holevo bound, for estimating any two-parameter family of qubit mixed-states in terms of quantum versions of Fisher information. The obtained formula depends solely on the symmetric logarithmic derivative (SLD), the right logarithmic derivative (RLD) Fisher information, and a given weight matrix. This result immediately provides necessary and sufficient conditions for the following two important classes of quantum statistical models; the Holevo bound coincides with the SLD Cramér-Rao bound and it does with the RLD Cramér-Rao bound. One of the important results of this paper is that a general model other than these two special cases exhibits an unexpected property: the structure of the Holevo bound changes smoothly when the weight matrix varies. In particular, it always coincides with the RLD Cramér-Rao bound for a certain choice of the weight matrix. Several examples illustrate these findings.