Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mary Beth Ruskai

dblp:16/2626 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Quantum computing and quantum information · 70% Information theory · 30%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum channel capacity
holevo capacity
0.012001
Minimal entropy of states emerging from noisy quantum channels · IEEE Trans. Inf. Theory 2001
Information theory › information measures › entropy › generalized entropy
minimum entropy
0.012001
Minimal entropy of states emerging from noisy quantum channels · IEEE Trans. Inf. Theory 2001
Quantum computing and quantum information
quantum channel capacity
0.012001
Minimal entropy of states emerging from noisy quantum channels · IEEE Trans. Inf. Theory 2001

Methods — techniques the papers use, named apart from their topics

stochastic map · 0.0density matrix geometry · 0.0
YearPublicationVenuePosition
2001 Minimal entropy of states emerging from noisy quantum channels
abstract
We consider the minimal entropy of qubit states transmitted through two uses of a noisy quantum channel, which is modeled by the action of a completely positive trace-preserving (or stochastic) map. We provide strong support for the conjecture that this minimal entropy is additive, namely, that the minimum entropy can be achieved when product states are transmitted. Explicitly, we prove that for a tensor product of two unital stochastic maps on qubit states, using an entanglement that involves only states which emerge with minimal entropy cannot decrease the entropy below the minimum achievable using product states. We give a separate argument, based on the geometry of the image of the set of density matrices under stochastic maps, which suggests that the minimal entropy conjecture holds for nonunital as well as for unital maps. We also show that the maximal norm of the output states is multiplicative for most product maps on n-qubit states, including all those for which at least one map is unital. For the class of unital channels on C/sup 2/, we show that additivity of minimal entropy implies that the Holevo (see IEEE Trans. Inform. Theory, vol.44, p.269-73, 1998 and Russian Math. Surv., p.1295-1331, 1999) capacity of the channel is additive over two inputs, achievable with orthogonal states, and equal to the Shannon capacity. This implies that superadditivity of the capacity is possible only for nonunital channels.
Christopher King, Mary Beth Ruskai
IEEE Trans. Inf. Theory2