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:2004.10708 · Quantum Information Processing

Geometric distinguishability measures limit quantum channel estimation and discrimination

Vishal Katariya, Mark M. Wilde

Published Feb 1, 2021• 45 citations
arXivHTMLPDF
DOI
10.1007/s11128-021-02992-7

Related papers

Geometric distinguishability measures limit quantum channel estimation and discrimination

Vishal Katariya, Mark M. Wilde

Quantum channel estimation and discrimination are fundamentally related information processing tasks of interest in quantum information science. In this paper, we analyze these tasks by employing the right logarithmic derivative Fisher information and the geometric Rényi relative entropy, respectively, and we also identify connections between these distinguishability measures. A key result of our paper is that a chain-rule property holds for the right logarithmic derivative Fisher information and the geometric Rényi relative entropy for the interval α∈ (0 , 1) of the Rényi parameter α. In channel estimation, these results imply a condition for the unattainability of Heisenberg scaling, while in channel discrimination, they lead to improved bounds on error rates in the Chernoff and Hoeffding error exponent settings. More generally, we introduce the amortized quantum Fisher information as a conceptual framework for analyzing general sequential protocols that estimate a parameter encoded in a quantum channel. We then use this framework, beyond the aforementioned application, to show that Heisenberg scaling is not possible when a parameter is encoded in a classical–quantum channel. We then identify a number of other conceptual and technical connections between the tasks of estimation and discrimination and the distinguishability measures involved in analyzing each. As part of this work, we present a detailed overview of the geometric Rényi relative entropy of quantum states and channels, as well as its properties, which may be of independent interest.

Civil War Book Review•Feb 1, 2021•42 citations

Information geometrical study of quantum channel estimation problems

寛 今井

•Mar 25, 2008•0 citations

Towards the ultimate limits of quantum channel discrimination and quantum communication

Kun Fang, Gilad Gour, Xin Wang

arXiv:2110.14842•Science China Information Sciences•Jul 10, 2025•6 citations

Fidelity and Fisher information on quantum channels

Haidong Yuan, Chi‐Hang Fred Fung

The fidelity function for quantum states has been widely used in quantum information science and frequently arises in the quantification of optimal performances for the estimation and distinguishing of quantum states. A fidelity function for quantum channels is expected to have the same wide applications in quantum information science. In this paper we propose a fidelity function for quantum channels and show that various distance measures on quantum channels can be obtained from this fidelity function; for example, the Bures angle and the Bures distance can be extended to quantum channels via this fidelity function. We then show that the distances between quantum channels lead naturally to a quantum channel Fisher information which quantifies the ultimate precision limit in quantum metrology; the ultimate precision limit can thus be seen as a manifestation of the distances between quantum channels. We also show that the fidelity of quantum channels provides a unified framework for perfect quantum channel discrimination and quantum metrology. In particular, we show that the minimum number of uses needed for perfect channel discrimination is exactly the counterpart of the precision limit in quantum metrology, and various useful lower bounds for the minimum number of uses needed for perfect channel discrimination can be obtained via this connection.

arXiv:1506.00819•New Journal of Physics•Nov 28, 2017•55 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•0 citations

Indistinguishability of quantum channels by using classically simulable measurements

Yiran Wang, Yongming Li

Abstract In this paper, we mainly study the indistinguishability of classically simulable measurements (measurements that can be effectively simulated on classical computers) in the tasks of quantum channel discrimination. First, we investigate the limitations of classically simulable measurements under unambiguous and perfect discrimination strategies. For unambiguous discrimination, we establish a conditional limitation result for channel-induced output-state discrimination scenarios, while for perfect discrimination we derive a sufficient condition under which classically simulable measurements fail to perfectly distinguish quantum channels. When considering the minimum-error discrimination strategy, we formulate the corresponding bilinear optimization problem and discuss its formal Lagrange dual formulation. Subsequently, we give the lower bound of the minimum-error probability obtained by using classically simulable measurements in the minimum-error discrimination task under the adaptive protocol. Furthermore, we give two measures of the nonstabilizerness (magic) of measurements. We prove that one measure we proposed can be used as an exact quantifier for the advantage in some tasks of quantum state discrimination. Finally, we investigate the relationship between classically simulable measurements and the data hiding ratio.

Journal of Physics A Mathematical and Theoretical•Jul 8, 2026•0 citations
Quantum channel estimation and discrimination are fundamentally related information processing tasks of interest in quantum information science. In this paper, we analyze these tasks by employing the right logarithmic derivative Fisher information and the geometric Rényi relative entropy, respectively, and we also identify connections between these distinguishability measures. A key result of our paper is that a chain-rule property holds for the right logarithmic derivative Fisher information and the geometric Rényi relative entropy for the interval α∈ (0 , 1) of the Rényi parameter α. In channel estimation, these results imply a condition for the unattainability of Heisenberg scaling, while in channel discrimination, they lead to improved bounds on error rates in the Chernoff and Hoeffding error exponent settings. More generally, we introduce the amortized quantum Fisher information as a conceptual framework for analyzing general sequential protocols that estimate a parameter encoded in a quantum channel. We then use this framework, beyond the aforementioned application, to show that Heisenberg scaling is not possible when a parameter is encoded in a classical–quantum channel. We then identify a number of other conceptual and technical connections between the tasks of estimation and discrimination and the distinguishability measures involved in analyzing each. As part of this work, we present a detailed overview of the geometric Rényi relative entropy of quantum states and channels, as well as its properties, which may be of independent interest.
The fidelity function for quantum states has been widely used in quantum information science and frequently arises in the quantification of optimal performances for the estimation and distinguishing of quantum states. A fidelity function for quantum channels is expected to have the same wide applications in quantum information science. In this paper we propose a fidelity function for quantum channels and show that various distance measures on quantum channels can be obtained from this fidelity function; for example, the Bures angle and the Bures distance can be extended to quantum channels via this fidelity function. We then show that the distances between quantum channels lead naturally to a quantum channel Fisher information which quantifies the ultimate precision limit in quantum metrology; the ultimate precision limit can thus be seen as a manifestation of the distances between quantum channels. We also show that the fidelity of quantum channels provides a unified framework for perfect quantum channel discrimination and quantum metrology. In particular, we show that the minimum number of uses needed for perfect channel discrimination is exactly the counterpart of the precision limit in quantum metrology, and various useful lower bounds for the minimum number of uses needed for perfect channel discrimination can be obtained via this connection.
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.
Abstract In this paper, we mainly study the indistinguishability of classically simulable measurements (measurements that can be effectively simulated on classical computers) in the tasks of quantum channel discrimination. First, we investigate the limitations of classically simulable measurements under unambiguous and perfect discrimination strategies. For unambiguous discrimination, we establish a conditional limitation result for channel-induced output-state discrimination scenarios, while for perfect discrimination we derive a sufficient condition under which classically simulable measurements fail to perfectly distinguish quantum channels. When considering the minimum-error discrimination strategy, we formulate the corresponding bilinear optimization problem and discuss its formal Lagrange dual formulation. Subsequently, we give the lower bound of the minimum-error probability obtained by using classically simulable measurements in the minimum-error discrimination task under the adaptive protocol. Furthermore, we give two measures of the nonstabilizerness (magic) of measurements. We prove that one measure we proposed can be used as an exact quantifier for the advantage in some tasks of quantum state discrimination. Finally, we investigate the relationship between classically simulable measurements and the data hiding ratio.