University of Cambridge > Talks.cam > CQIF Seminar > Entropy of a correlation matrix and (in)fidelity between several quantum states

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Entropy of a correlation matrix and (in)fidelity between several quantum states

Download to your calendar using vCal

If you have a question about this talk, please contact Ashley Montanaro .

Making use of the strong subadditivity of entropy we prove that the Holevo quantity for an ensemble of k quantum states is not larger than the entropy of a certain correlation matrix. In the case of k=2 states the minimum over the set of admissible correlation matrices is found to be given by a function of the fidelity between both states. This implies an upper bound for the coherent information and the quantum Jensen—Shannon divergence. Restricting our attention to classical information we bound the transmission distance between any two probability distributions by the entropic distance, which is a concave function of the Hellinger distance.

For larger number of k states in an ensemble we find explicit bounds for the exchange entropy, which could be used to characterize distinguishability between them.

This talk is part of the CQIF Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lecturers' Common Room, Floor 1, Raised Faculty Building (Sidgewick Site) MR4, Centre for Mathematical Sciences, Wiberforce Road, Cambridge. Museum of Archaeology & Anthropology

Other talks

Task performance predicts the substitution of feedforward by feedback drive in visual cortex Group Work Title and abstract tba Security Cooperation within Government and between Governments Cambridge RNA Club - IN PERSON Climate, uncertainty, and the slippery measurement of Antarctic ice
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity