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

Information geometrical study of quantum channel estimation problems

寛 今井

Published Mar 25, 2008• 0 citations
OpenAlex

Related papers

Geometric distinguishability measures limit quantum channel estimation and discrimination

Vishal Katariya, Mark M. Wilde

arXiv:2004.10708•Quantum Information Processing•Feb 1, 2021•45 citations

Voronoi Diagrams for Quantum States and Its Application to a Numerical Estimation of a Quantum Channel Capacity

Kimikazu Kato

In quantum information theory, a geometric approach, known as "quantum information geometry," has been considered as a powerful method. In this thesis, we give a computational geometric interpretation to the geometric structure of a quantum system. Especially we introduce the concept of the Voronoi diagram and the smallest enclosing ball problem to the space of quantum states. With those tools in computational geometry, we analyze the adjacency structure of a point set in the quantum state space. Additionally, as an application, we show an effective method to compute the capacity of a quantum channel.

arXiv:0803.3109•Mar 21, 2008•3 citations

Quantum Information Geometry and Quantum Estimation

Springer eBooks•Sep 1, 2006•0 citations

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 geometry and the quantum estimation problem

Demetris P. K. Ghikas

Reports on Mathematical Physics•Aug 1, 2001•6 citations

Quantum Information Geometry and Quantum Estimation

Masahito Hayashi

Graduate texts in physics•Nov 3, 2016•5 citations
In quantum information theory, a geometric approach, known as "quantum information geometry," has been considered as a powerful method. In this thesis, we give a computational geometric interpretation to the geometric structure of a quantum system. Especially we introduce the concept of the Voronoi diagram and the smallest enclosing ball problem to the space of quantum states. With those tools in computational geometry, we analyze the adjacency structure of a point set in the quantum state space. Additionally, as an application, we show an effective method to compute the capacity of a quantum channel.
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.