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:1909.11131

Metrics and pseudometrics on unitary groups with applications in quantum information processing

Manas K. Patra

Published Sep 24, 2019• 0 citations
arXivHTMLPDF

Abstract

Metrics and pseudometrics are defined on the group of unitary operators in a Hilbert space. Several explicit formulas are derived. A special feature of the work is investigation of pseudometrics in unitary groups. The rich classes of pseudometrics have many interesting applications. Three such applications, distinguishibility of unitary operators, quantum coding and quantum search problems are discussed.

DOI
10.48550/arxiv.1909.11131

Related papers

APPLICATIONS OF FINSLER GEOMETRY TO SPEED LIMITS TO QUANTUM INFORMATION PROCESSING

Benjamin Russell, Susan Stepney

We are interested in fundamental limits to computation imposed by physical constraints. In particular, the physical laws of motion constrain the speed at which a computer can transition between well-defined states. Here, we discuss speed limits in the context of quantum computing. We review some relevant parts of the theory of Finsler metrics on Lie groups and homogeneous spaces such as the special unitary groups and complex projective spaces. We show how these constructions can be applied to analysing the limit to the speed of quantum information processing operations in constrained quantum systems with finite dimensional Hilbert spaces of states. We demonstrate the approach applied to a spin chain system.

International Journal of Foundations of Computer Science•Jun 1, 2014•15 citations

Volumes of orthogonal groups and unitary groups

Lin Zhang

The matrix integral has many applications in diverse fields. This review article begins by presenting detailed key background knowledge about matrix integral. Then the volumes of orthogonal groups and unitary groups are computed, respectively. As a unification, we present Mcdonald's volume formula for a compact Lie group. With this volume formula, one can easily derives the volumes of orthogonal groups and unitary groups. Applications are also presented as well. Specifically, The volume of the set of mixed quantum states is computed by using the volume of unitary group. The volume of a metric ball in unitary group is also computed as well. There are no new results in this article, but only detailed and elementary proofs of existing results. The purpose of the article is pedagogical, and to collect in one place many, if not all, of the quantum information applications of the volumes of orthogonal and unitary groups.

arXiv:1509.00537•Sep 2, 2015•13 citations

Induced metric and matrix inequalities on unitary matrices

H. F. Chau, Chi-Kwong Li, Yiu‐Tung Poon +1 more

Recently, Chau [Quant. Inform. & Comp. 11, 721 (2011)] showed that one can define certain metrics and pseudo-metrics on U(n), the group of all $n\times n$ unitary matrices, based on the arguments of the eigenvalues of the unitary matrices. More importantly, these metrics and pseudo-metrics have quantum information theoretical meanings. So it is instructive to study this kind of metrics and pseudo-metrics on U(n). Here we show that any symmetric norm on ${\mathbb R}^n$ induces a metric on U(n). Furthermore, using the same technique, we prove an inequality concerning the eigenvalues of a product of two unitary matrices which generalizes a few inequalities obtained earlier by Chau [arXiv:1006.3614v1].

arXiv:1107.1047•Journal of Physics A Mathematical and Theoretical•Feb 16, 2012•2 citations

Relation between quantum speed limits and metrics onU(n)

Kai-Yan Lee, H. F. Chau

Recently, Chau [Quant. Inform. & Comp. 11, 721 (2011)] found a family of metrics and pseudo-metrics on $n$-dimensional unitary operators that can be interpreted as the minimum resources (given by certain tight quantum speed limit bounds) needed to transform one unitary operator to another. This result is closely related to the weighted $\ell^1$-norm on ${\mathbb R}^n$. Here we generalize this finding by showing that every weighted $\ell^p$-norm on ${\mathbb R}^n$ with $1\le p \le \limitingp$ induces a metric and a pseudo-metric on $n$-dimensional unitary operators with quantum information-theoretic meanings related to certain tight quantum speed limit bounds. Besides, we investigate how far the correspondence between the existence of metrics and pseudo-metrics of this type and the quantum speed limits can go.

arXiv:1202.1899•Journal of Physics A Mathematical and Theoretical•Dec 5, 2012•12 citations

Axiomatic Foundation of Quantum-Inspired Distance Metrics

Maryam Bagherian

We develop a comprehensive axiomatic framework for quantum-inspired distance metrics on projective Hilbert spaces, providing a unified foundation that organizes and generalizes existing measures in quantum information theory. Starting from five fundamental axioms, projective invariance, unitary covariance, superposition sensitivity, entanglement awareness, and measurement contextuality, we show that any admissible distance depends solely on state overlap and establish the uniqueness of the Fubini-Study metric as the canonical geodesic distance. Our framework further yields a hierarchy of comparison results relating the Fubini-Study metric, Bures distance, Euclidean distance, measurement-based pseudometrics, and entanglement-sensitive distances. Key contributions include an entanglement-geometry complementarity principle, high-dimensional concentration bounds, and operational interpretations connecting distances to state discrimination and quantum metrology. This work places the geometry of quantum state spaces on a rigorous axiomatic footing, bridging abstract metric theory, information geometry, and operational quantum principles.

quant-pharXiv:2603.00406•Mar 3, 2026•0 citations

Symmetric Functionals over Tensor Product Spaces in the Context of Quantum Information Theory

Moritz Ernst

This thesis consists of three parts. We begin our investigation with a brief introduction into open quantum systems. Then we explain different measures of distinguishability of density operators, especially the Uhlmann Fidelity, which will be the basis for the model function we investigate in this work. \nWe continue by explaining the time evolution of open quantum systems in more detail, and introducing the important notion of quantum channels as a concept in quantum information theory. This allows us to state a central problem of quantum information theory: the characterization of the quantum information capacity of a given quantum channel. The major challenge is the maximization of the coherent information, a function defined on a n-fold tensor product of a Hilbert space, which is non-additive and thus has to be considered in the limit as n→∞. \n \nTo gain an insight into this unsolved problem, we study the channel fidelity of a quantum channel, which is a simpler function, also defined on n-fold tensor product spaces. It shares an essential feature with the coherent information in being non-additive. However, in contrast to the coherent information it is mathematically accessible. We establish the channel fidelity as a model for the coherent information and study its properties. \n \nIn the second part, a short introduction to the representation theory of symmetric and unitary groups is followed by concrete instructions for Collins' and \\'{S}niady's formula for the integration of functions of matrix elements of unitary groups with respect to the Haar measure. This exposition culminates in a simplification of the general formula that is optimal for investigating the channel fidelity. \n \nIn the third part, we calculate channel fidelity moments for arbitrary n. In order to obtain more concrete results, we restrict ourselves to the study of Pauli channels. For these we discuss the transition of the average and variance from small n to the limit n→∞ and give an explicit formula for both in this limit. In particular, we find that for a large number n of Pauli channels, the channel fidelity distribution is peaked very strongly. Additionally, under certain restrictions, the simplified formula from part two also allows us to give concrete expressions for higher moments in the limit n→∞. \n \nWe conclude by comparing our new results with results from a former work, where, in the search for maximizing states of the channel fidelity, we found states that maximize the channel fidelity of Pauli channels, at least locally. Because these local maxima have a much higher fidelity than the average of the very strongly peaked distribution, we infer that these states would not be found by a standard numerical maximization procedure. If the channel fidelity models the coherent information accurately in this regard, its maximization thus poses a very hard problem.

•Dec 5, 2014•0 citations
Metrics and pseudometrics are defined on the group of unitary operators in a Hilbert space. Several explicit formulas are derived. A special feature of the work is investigation of pseudometrics in unitary groups. The rich classes of pseudometrics have many interesting applications. Three such applications, distinguishibility of unitary operators, quantum coding and quantum search problems are discussed.
We are interested in fundamental limits to computation imposed by physical constraints. In particular, the physical laws of motion constrain the speed at which a computer can transition between well-defined states. Here, we discuss speed limits in the context of quantum computing. We review some relevant parts of the theory of Finsler metrics on Lie groups and homogeneous spaces such as the special unitary groups and complex projective spaces. We show how these constructions can be applied to analysing the limit to the speed of quantum information processing operations in constrained quantum systems with finite dimensional Hilbert spaces of states. We demonstrate the approach applied to a spin chain system.
The matrix integral has many applications in diverse fields. This review article begins by presenting detailed key background knowledge about matrix integral. Then the volumes of orthogonal groups and unitary groups are computed, respectively. As a unification, we present Mcdonald's volume formula for a compact Lie group. With this volume formula, one can easily derives the volumes of orthogonal groups and unitary groups. Applications are also presented as well. Specifically, The volume of the set of mixed quantum states is computed by using the volume of unitary group. The volume of a metric ball in unitary group is also computed as well. There are no new results in this article, but only detailed and elementary proofs of existing results. The purpose of the article is pedagogical, and to collect in one place many, if not all, of the quantum information applications of the volumes of orthogonal and unitary groups.
Recently, Chau [Quant. Inform. & Comp. 11, 721 (2011)] showed that one can define certain metrics and pseudo-metrics on U(n), the group of all n×nn\times nn×n unitary matrices, based on the arguments of the eigenvalues of the unitary matrices. More importantly, these metrics and pseudo-metrics have quantum information theoretical meanings. So it is instructive to study this kind of metrics and pseudo-metrics on U(n). Here we show that any symmetric norm on Rn{\mathbb R}^nRn induces a metric on U(n). Furthermore, using the same technique, we prove an inequality concerning the eigenvalues of a product of two unitary matrices which generalizes a few inequalities obtained earlier by Chau [arXiv:1006.3614v1].
Recently, Chau [Quant. Inform. & Comp. 11, 721 (2011)] found a family of metrics and pseudo-metrics on nnn-dimensional unitary operators that can be interpreted as the minimum resources (given by certain tight quantum speed limit bounds) needed to transform one unitary operator to another. This result is closely related to the weighted ℓ1\ell^1ℓ1-norm on Rn{\mathbb R}^nRn. Here we generalize this finding by showing that every weighted ℓp\ell^pℓp-norm on Rn{\mathbb R}^nRn with $1\le p \le \limitingp$ induces a metric and a pseudo-metric on nnn-dimensional unitary operators with quantum information-theoretic meanings related to certain tight quantum speed limit bounds. Besides, we investigate how far the correspondence between the existence of metrics and pseudo-metrics of this type and the quantum speed limits can go.
We develop a comprehensive axiomatic framework for quantum-inspired distance metrics on projective Hilbert spaces, providing a unified foundation that organizes and generalizes existing measures in quantum information theory. Starting from five fundamental axioms, projective invariance, unitary covariance, superposition sensitivity, entanglement awareness, and measurement contextuality, we show that any admissible distance depends solely on state overlap and establish the uniqueness of the Fubini-Study metric as the canonical geodesic distance. Our framework further yields a hierarchy of comparison results relating the Fubini-Study metric, Bures distance, Euclidean distance, measurement-based pseudometrics, and entanglement-sensitive distances. Key contributions include an entanglement-geometry complementarity principle, high-dimensional concentration bounds, and operational interpretations connecting distances to state discrimination and quantum metrology. This work places the geometry of quantum state spaces on a rigorous axiomatic footing, bridging abstract metric theory, information geometry, and operational quantum principles.
This thesis consists of three parts. We begin our investigation with a brief introduction into open quantum systems. Then we explain different measures of distinguishability of density operators, especially the Uhlmann Fidelity, which will be the basis for the model function we investigate in this work. \nWe continue by explaining the time evolution of open quantum systems in more detail, and introducing the important notion of quantum channels as a concept in quantum information theory. This allows us to state a central problem of quantum information theory: the characterization of the quantum information capacity of a given quantum channel. The major challenge is the maximization of the coherent information, a function defined on a n-fold tensor product of a Hilbert space, which is non-additive and thus has to be considered in the limit as n→∞. \n \nTo gain an insight into this unsolved problem, we study the channel fidelity of a quantum channel, which is a simpler function, also defined on n-fold tensor product spaces. It shares an essential feature with the coherent information in being non-additive. However, in contrast to the coherent information it is mathematically accessible. We establish the channel fidelity as a model for the coherent information and study its properties. \n \nIn the second part, a short introduction to the representation theory of symmetric and unitary groups is followed by concrete instructions for Collins' and \\'{S}niady's formula for the integration of functions of matrix elements of unitary groups with respect to the Haar measure. This exposition culminates in a simplification of the general formula that is optimal for investigating the channel fidelity. \n \nIn the third part, we calculate channel fidelity moments for arbitrary n. In order to obtain more concrete results, we restrict ourselves to the study of Pauli channels. For these we discuss the transition of the average and variance from small n to the limit n→∞ and give an explicit formula for both in this limit. In particular, we find that for a large number n of Pauli channels, the channel fidelity distribution is peaked very strongly. Additionally, under certain restrictions, the simplified formula from part two also allows us to give concrete expressions for higher moments in the limit n→∞. \n \nWe conclude by comparing our new results with results from a former work, where, in the search for maximizing states of the channel fidelity, we found states that maximize the channel fidelity of Pauli channels, at least locally. Because these local maxima have a much higher fidelity than the average of the very strongly peaked distribution, we infer that these states would not be found by a standard numerical maximization procedure. If the channel fidelity models the coherent information accurately in this regard, its maximization thus poses a very hard problem.