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

Resonance

From shannon To quantum information science: Mixed states

Rajiah Simon

Published May 1, 2002• 0 citations
Publisher
DOI
10.1007/bf02836734

Related papers

From shannon to quantum information science: 1. Ideas and techniques

Rajiah Simon

Resonance•Feb 1, 2002•2 citations

Jensen-Shannon divergence as a measure of distinguishability between mixed quantum states

A. P. Majtey, Pedro W. Lamberti, Domingo P. Prato

We discuss an alternative to relative entropy as a measure of distance between mixed quantum states. The proposed quantity is an extension to the realm of quantum theory of the Jensen-Shannon divergence (JSD) between probability distributions. The JSD has several interesting properties. It arises in information theory and, unlike the Kullback-Leibler divergence, it is symmetric, always well-defined, and bounded. We show that the quantum JSD shares with the relative entropy most of the physically relevant properties, in particular those required for a ``good'' quantum distinguishability measure. We relate it to other known quantum distances and we suggest possible applications in the field of the quantum information theory.

arXiv:quant-ph/0508138•Physical Review A•Nov 11, 2005•230 citations

Sublinear quantum algorithms for estimating von Neumann entropy

Tom Gur, Min-Hsiu Hsieh, Sathyawageeswar Subramanian

Entropy is a fundamental property of both classical and quantum systems, spanning myriad theoretical and practical applications in physics and computer science. We study the problem of obtaining estimates to within a multiplicative factor $γ>1$ of the Shannon entropy of probability distributions and the von Neumann entropy of mixed quantum states. Our main results are: $\quad\bullet$ an $\widetilde{\mathcal{O}}\left( n^{\frac{1+η}{2γ^2}}\right)$-query quantum algorithm that outputs a $γ$-multiplicative approximation of the Shannon entropy $H(\mathbf{p})$ of a classical probability distribution $\mathbf{p} = (p_1,\ldots,p_n)$; $\quad\bullet$ an $\widetilde{\mathcal{O}}\left( n^{\frac12+\frac{1+η}{2γ^2}}\right)$-query quantum algorithm that outputs a $γ$-multiplicative approximation of the von Neumann entropy $S(ρ)$ of a density matrix $ρ\in\mathbb{C}^{n\times n}$. In both cases, the input is assumed to have entropy bounded away from zero by a quantity determined by the parameter $η>0$, since, as we prove, no polynomial query algorithm can multiplicatively approximate the entropy of distributions with arbitrarily low entropy. In addition, we provide $Ω\left(n^{\frac{1}{3γ^2}}\right)$ lower bounds on the query complexity of $γ$-multiplicative estimation of Shannon and von Neumann entropies. We work with the quantum purified query access model, which can handle both classical probability distributions and mixed quantum states, and is the most general input model considered in the literature.

arXiv:2111.11139•Nov 22, 2021•44 citations

Quantum Information Science

Chopin Soo, Weimin Zhang

•Oct 1, 2005•0 citations

Quantum information science

David Peter Divincenzo

Quantum Electronics and Laser Science Conference•May 6, 2001•6 citations

An Introduction to Quantum Bayesian Networks for Mixed States

Robert R. Tucci

This paper is intended to be a pedagogical introduction to quantum Bayesian networks (QB nets), as I personally use them to represent mixed states (i.e., density matrices, and open quantum systems). A special effort is made to make contact with notions used in textbooks on quantum Shannon Information Theory (quantum SIT), such as the one by Mark Wilde (arXiv:1106.1445)

arXiv:1204.1550•Apr 6, 2012•10 citations
We discuss an alternative to relative entropy as a measure of distance between mixed quantum states. The proposed quantity is an extension to the realm of quantum theory of the Jensen-Shannon divergence (JSD) between probability distributions. The JSD has several interesting properties. It arises in information theory and, unlike the Kullback-Leibler divergence, it is symmetric, always well-defined, and bounded. We show that the quantum JSD shares with the relative entropy most of the physically relevant properties, in particular those required for a ``good'' quantum distinguishability measure. We relate it to other known quantum distances and we suggest possible applications in the field of the quantum information theory.
Entropy is a fundamental property of both classical and quantum systems, spanning myriad theoretical and practical applications in physics and computer science. We study the problem of obtaining estimates to within a multiplicative factor γ>1γ>1γ>1 of the Shannon entropy of probability distributions and the von Neumann entropy of mixed quantum states. Our main results are: ∙\quad\bullet∙ an O~(n1+η2γ2)\widetilde{\mathcal{O}}\left( n^{\frac{1+η}{2γ^2}}\right)O(n2γ21+η​)-query quantum algorithm that outputs a γγγ-multiplicative approximation of the Shannon entropy H(p)H(\mathbf{p})H(p) of a classical probability distribution p=(p1,…,pn)\mathbf{p} = (p_1,\ldots,p_n)p=(p1​,…,pn​); ∙\quad\bullet∙ an O~(n12+1+η2γ2)\widetilde{\mathcal{O}}\left( n^{\frac12+\frac{1+η}{2γ^2}}\right)O(n21​+2γ21+η​)-query quantum algorithm that outputs a γγγ-multiplicative approximation of the von Neumann entropy S(ρ)S(ρ)S(ρ) of a density matrix ρ∈Cn×nρ\in\mathbb{C}^{n\times n}ρ∈Cn×n. In both cases, the input is assumed to have entropy bounded away from zero by a quantity determined by the parameter η>0η>0η>0, since, as we prove, no polynomial query algorithm can multiplicatively approximate the entropy of distributions with arbitrarily low entropy. In addition, we provide Ω(n13γ2)Ω\left(n^{\frac{1}{3γ^2}}\right)Ω(n3γ21​) lower bounds on the query complexity of γγγ-multiplicative estimation of Shannon and von Neumann entropies. We work with the quantum purified query access model, which can handle both classical probability distributions and mixed quantum states, and is the most general input model considered in the literature.