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

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences

Distance measures for quantum states and channels: properties and applications

Vita Borovyk, Badri N. Vellambi

Published Oct 9, 2025• 2 citations
Publisher

Abstract

Discriminating between quantum states and channels is an important task in the field of quantum computation and quantum information theory. Metrics and statistical distances form the tools for various approaches proposed for this task. We analyse existing results to compare properties, main purpose, computability and advantages and disadvantages of each approach.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.

DOI
10.1098/rsta.2024.0425

Related papers

Information-theoretic aspects of quantum channels

Elton Yechao Zhu

Quantum information theory is an important element of quantum computing and quantum communication systems. Whenever a quantum computer needs to send an output state to another party, or two parties need to establish quantum entanglement or secure keys via quantum communication, a quantum channel is inevitably involved. Hence it is absolutely important to understand the properties of quantum channels for the purpose of communication. Here, quantum entanglement plays a huge role. Pre-shared entanglement could enhance the capacity, whereas entanglement across inputs could render the capacity formulae impossible to compute. The first part of this thesis seeks to address this issue, by studying the additivity properties in the communication of classical and quantum information, with or without entanglement assistance. I also study the reverse problem that, given a channel capacity, what can be said about the quantum channel itself. Quantum information theory also serves as an important tool in understanding other systems, for example, black holes. In this thesis, I model a closed random system by a unitary channel, and study how typical unitary channels process information. This provides huge insight into the strength of generalized entanglement measures, and the hierarchies in the complexity of information scrambling.

•Jan 1, 2019•0 citations

Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms

Anastasiia Minenkova, Gamal Mograby, Hanmeng Zhan

Recent progress in quantum computing shows the need to incorporate many branches of mathematics (graph theory, matrix theory, optimization, theory of orthogonal polynomials and more) into physics, computer science and chemistry. At the 2024 SIAM Quantum Intersections Convening, Bert de Jong (Lawrence Berkeley National Laboratory) gave a talk entitled 'Quantum Science Needs Mathematicians' (Report of the SIAM Quantum Intersections Convening. Integrating Mathematical Scientists into Quantum Research, 7-9 October 2024, Tysons, Virginia (doi:10.11337/25M1741017)), since despite the growing demand for research in these domains, the mathematical sciences community has remained largely disengaged from quantum research, with only a few isolated areas of active involvement. This issue brings together researchers from different areas of mathematics to show the relation between spectral graph theory, the theory of orthogonal polynomials and numerical analysis. This interconnectedness highlights the versatility and importance of these areas of mathematics in the context of quantum computing.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Oct 9, 2025•0 citations

Distances Measures for Probability Distributions

Many problems of statistical and quantum mechanics can be established in terms of a distance between probability distributions. The present work is devoted to review some of the most relevant applications of the notion of distance in the context of statistical mechanics, quantum mechanics and information theory. Although we make a general overview of the most frequently used distances between probability distributions, we will center our presentation in a distance known as the Jensen-Shannon divergence both in their classical and quantum versions. For the classical one we present its main properties and we discuss its relevance as a segmentation tool for symbolic sequences. In the quantum case we show that the quantum Jensen-Shannon divergence is an adequate measure of entanglement.

BENTHAM SCIENCE PUBLISHERS eBooks•Dec 11, 2013•1 citation

Orthogonal polynomials and perfect state transfer

Rachel Bailey

The aim of this review is to discuss some applications of orthogonal polynomials in quantum information processing. The hope is to keep the paper self-contained so that someone wanting a brief introduction to the theory of orthogonal polynomials and continuous time quantum walks on graphs may find it in one place. In particular, we focus on the associated Jacobi operators and discuss how these can be used to detect perfect state transfer (PST). We also discuss how orthogonal polynomials have been used to give results which are analogous to those given by Karlin and McGregor when studying classical birth and death processes. Finally, we show how these ideas have been extended to quantum walks with more than nearest-neighbour interactions using exceptional orthogonal polynomials (XOPs). We also provide a (non-exhaustive) list of related open questions.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.

arXiv:2412.16351•Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Oct 9, 2025•1 citation

Quantum correlations and distinguishability of quantum states

Dominique Spehner

A survey of various concepts in quantum information is given, with a main emphasis on the distinguishability of quantum states and quantum correlations. Covered topics include generalized and least square measurements, state discrimination, quantum relative entropies, the Bures distance on the set of quantum states, the quantum Fisher information, the quantum Chernoff bound, bipartite entanglement, the quantum discord, and geometrical measures of quantum correlations. The article is intended both for physicists interested not only by collections of results but also by the mathematical methods justifying them, and for mathematicians looking for an up-to-date introductory course on these subjects, which are mainly developed in the physics literature.

arXiv:1407.3739•Journal of Mathematical Physics•Jul 1, 2014•72 citations

A dynamical algebra of protocol-induced transformations on Dicke states

Pierre-Antoine Bernard, Luc Vinet

Quantum [Formula: see text]-qubit states that are totally symmetric under the permutation of qubits are essential ingredients of important algorithms and applications in quantum information. Consequently, there is significant interest in developing methods to prepare and manipulate Dicke states, which form a basis for the subspace of fully symmetric states. Two simple protocols for transforming Dicke states are considered. An algebraic characterization of the operations that these protocols induce is obtained in terms of the Weyl algebra [Formula: see text] and [Formula: see text]. Fixed points under the application of the combination of both protocols are explicitly determined. Connections with the binary Hamming scheme, the Hadamard transform and Krawtchouk polynomials are highlighted.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.

arXiv:2412.17917•Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Oct 9, 2025•2 citations
Discriminating between quantum states and channels is an important task in the field of quantum computation and quantum information theory. Metrics and statistical distances form the tools for various approaches proposed for this task. We analyse existing results to compare properties, main purpose, computability and advantages and disadvantages of each approach.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.
Quantum information theory is an important element of quantum computing and quantum communication systems. Whenever a quantum computer needs to send an output state to another party, or two parties need to establish quantum entanglement or secure keys via quantum communication, a quantum channel is inevitably involved. Hence it is absolutely important to understand the properties of quantum channels for the purpose of communication. Here, quantum entanglement plays a huge role. Pre-shared entanglement could enhance the capacity, whereas entanglement across inputs could render the capacity formulae impossible to compute. The first part of this thesis seeks to address this issue, by studying the additivity properties in the communication of classical and quantum information, with or without entanglement assistance. I also study the reverse problem that, given a channel capacity, what can be said about the quantum channel itself. Quantum information theory also serves as an important tool in understanding other systems, for example, black holes. In this thesis, I model a closed random system by a unitary channel, and study how typical unitary channels process information. This provides huge insight into the strength of generalized entanglement measures, and the hierarchies in the complexity of information scrambling.
Recent progress in quantum computing shows the need to incorporate many branches of mathematics (graph theory, matrix theory, optimization, theory of orthogonal polynomials and more) into physics, computer science and chemistry. At the 2024 SIAM Quantum Intersections Convening, Bert de Jong (Lawrence Berkeley National Laboratory) gave a talk entitled 'Quantum Science Needs Mathematicians' (Report of the SIAM Quantum Intersections Convening. Integrating Mathematical Scientists into Quantum Research, 7-9 October 2024, Tysons, Virginia (doi:10.11337/25M1741017)), since despite the growing demand for research in these domains, the mathematical sciences community has remained largely disengaged from quantum research, with only a few isolated areas of active involvement. This issue brings together researchers from different areas of mathematics to show the relation between spectral graph theory, the theory of orthogonal polynomials and numerical analysis. This interconnectedness highlights the versatility and importance of these areas of mathematics in the context of quantum computing.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.
Many problems of statistical and quantum mechanics can be established in terms of a distance between probability distributions. The present work is devoted to review some of the most relevant applications of the notion of distance in the context of statistical mechanics, quantum mechanics and information theory. Although we make a general overview of the most frequently used distances between probability distributions, we will center our presentation in a distance known as the Jensen-Shannon divergence both in their classical and quantum versions. For the classical one we present its main properties and we discuss its relevance as a segmentation tool for symbolic sequences. In the quantum case we show that the quantum Jensen-Shannon divergence is an adequate measure of entanglement.
The aim of this review is to discuss some applications of orthogonal polynomials in quantum information processing. The hope is to keep the paper self-contained so that someone wanting a brief introduction to the theory of orthogonal polynomials and continuous time quantum walks on graphs may find it in one place. In particular, we focus on the associated Jacobi operators and discuss how these can be used to detect perfect state transfer (PST). We also discuss how orthogonal polynomials have been used to give results which are analogous to those given by Karlin and McGregor when studying classical birth and death processes. Finally, we show how these ideas have been extended to quantum walks with more than nearest-neighbour interactions using exceptional orthogonal polynomials (XOPs). We also provide a (non-exhaustive) list of related open questions.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.
A survey of various concepts in quantum information is given, with a main emphasis on the distinguishability of quantum states and quantum correlations. Covered topics include generalized and least square measurements, state discrimination, quantum relative entropies, the Bures distance on the set of quantum states, the quantum Fisher information, the quantum Chernoff bound, bipartite entanglement, the quantum discord, and geometrical measures of quantum correlations. The article is intended both for physicists interested not only by collections of results but also by the mathematical methods justifying them, and for mathematicians looking for an up-to-date introductory course on these subjects, which are mainly developed in the physics literature.
Quantum [Formula: see text]-qubit states that are totally symmetric under the permutation of qubits are essential ingredients of important algorithms and applications in quantum information. Consequently, there is significant interest in developing methods to prepare and manipulate Dicke states, which form a basis for the subspace of fully symmetric states. Two simple protocols for transforming Dicke states are considered. An algebraic characterization of the operations that these protocols induce is obtained in terms of the Weyl algebra [Formula: see text] and [Formula: see text]. Fixed points under the application of the combination of both protocols are explicitly determined. Connections with the binary Hamming scheme, the Hadamard transform and Krawtchouk polynomials are highlighted.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.