Asymptotic Attainability of the Channel RLD Fisher-Information Bound

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16578
Primary Topic
Quantum Information and Cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Asymptotic Attainability of the Channel RLD Fisher-Information Bound

Masahito Hayashi
arXiv (Cornell University)
Quantum Information and Cryptography
preprint

Asymptotic Attainability of the Channel RLD Fisher-Information Bound

Masahito Hayashi
preprint en

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.

arXiv (Cornell University)
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon