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

Linear Algebra and its Applications

Operator entropy and fidelity associated with the geometric mean

Sejong Kim

Published Dec 10, 2012• 10 citations
Publisher
DOI
10.1016/j.laa.2012.10.042

Related papers

Quantum divergence and barycenter associated with the spectral geometric mean

Luyining Gan, Miran Jeong, Sejong Kim

Linear Algebra and its Applications•May 10, 2024•5 citations

Expanded Relative Operator Entropies and Operator Valued α-Divergence

Hiroshi Hiroshi, Masatoshi, Eizaburo +4 more

数学和系统科学:英文版•Jan 1, 2015•0 citations

A fidelity measure for quantum states based on the matrix geometric mean

Sam Cree, Jamie Sikora

Uhlmann's fidelity function is one of the most widely used similarity measures in quantum theory. One definition of this function is that it is the minimum classical fidelity associated with a quantum-to-classical measurement procedure of two quantum states. In 2010, Matsumoto introduced another fidelity function which is dual to Uhlmann's in the sense that it is the maximimum classical fidelity associated with a classical-to-quantum preparation procedure for two quantum states. Matsumoto's fidelity can also be defined using the well-established notion definition of the matrix geometric mean. In this work, we examine Matsumoto's fidelity through the lens of semidefinite programming to give simple proofs that it possesses many desirable properties for a similarity measure, including monotonicity under quantum channels, joint concavity, and unitary invariance. Finally, we provide a geometric interpretation of this fidelity in terms of the Riemannian space of positive definite matrices, and show how this picture can be useful in understanding some of its peculiar properties.

arXiv:2006.06918•Jun 12, 2020•15 citations

Quantum algorithms for matrix geometric means

Nana Liu, Qisheng Wang, Mark M. Wilde +1 more

Matrix geometric means between two positive definite matrices can be defined from distinct perspectives—as solutions to certain nonlinear systems of equations, as points along geodesics in Riemannian geometry, and as solutions to certain optimisation problems. We devise quantum subroutines for the matrix geometric means, and construct solutions to the algebraic Riccati equation—an important class of nonlinear systems of equations appearing in machine learning, optimal control, estimation, and filtering. Using these subroutines, we present a new class of quantum learning algorithms, for both classical and quantum data, called quantum geometric mean metric learning, for weakly supervised learning and anomaly detection. The subroutines are also useful for estimating geometric Rényi relative entropies and the Uhlmann fidelity, in particular achieving optimal dependence on precision for the Uhlmann and Matsumoto fidelities. Finally, we provide a BQP-complete problem based on matrix geometric means that can be solved by our subroutines.

arXiv:2405.00673•npj Quantum Information•Jun 13, 2025•20 citations

Expanded Relative Operator Entropies and Operator Valued α-Divergence

Masatoshi Ito Hiroshi Isa, Eizaburo Kamei, Masayuki Watanabe

Journal of Mathematics and System Science•Jun 28, 2015•0 citations

Some relations for relative operator entropies via inequalities

Najla A. Altwaijry, Shigeru Furuichi, Nicuşor Minculete

Journal of Mathematical Inequalities•Jan 1, 2026•0 citations
Uhlmann's fidelity function is one of the most widely used similarity measures in quantum theory. One definition of this function is that it is the minimum classical fidelity associated with a quantum-to-classical measurement procedure of two quantum states. In 2010, Matsumoto introduced another fidelity function which is dual to Uhlmann's in the sense that it is the maximimum classical fidelity associated with a classical-to-quantum preparation procedure for two quantum states. Matsumoto's fidelity can also be defined using the well-established notion definition of the matrix geometric mean. In this work, we examine Matsumoto's fidelity through the lens of semidefinite programming to give simple proofs that it possesses many desirable properties for a similarity measure, including monotonicity under quantum channels, joint concavity, and unitary invariance. Finally, we provide a geometric interpretation of this fidelity in terms of the Riemannian space of positive definite matrices, and show how this picture can be useful in understanding some of its peculiar properties.
Matrix geometric means between two positive definite matrices can be defined from distinct perspectives—as solutions to certain nonlinear systems of equations, as points along geodesics in Riemannian geometry, and as solutions to certain optimisation problems. We devise quantum subroutines for the matrix geometric means, and construct solutions to the algebraic Riccati equation—an important class of nonlinear systems of equations appearing in machine learning, optimal control, estimation, and filtering. Using these subroutines, we present a new class of quantum learning algorithms, for both classical and quantum data, called quantum geometric mean metric learning, for weakly supervised learning and anomaly detection. The subroutines are also useful for estimating geometric Rényi relative entropies and the Uhlmann fidelity, in particular achieving optimal dependence on precision for the Uhlmann and Matsumoto fidelities. Finally, we provide a BQP-complete problem based on matrix geometric means that can be solved by our subroutines.