Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 99 tok/s
Gemini 2.5 Pro 55 tok/s Pro
GPT-5 Medium 23 tok/s
GPT-5 High 19 tok/s Pro
GPT-4o 108 tok/s
GPT OSS 120B 465 tok/s Pro
Kimi K2 179 tok/s Pro
2000 character limit reached

Entropy reduction of quantum measurements (1011.3127v3)

Published 13 Nov 2010 in quant-ph, math-ph, and math.MP

Abstract: It is observed that the entropy reduction (the information gain in the initial terminology) of an efficient (ideal or pure) quantum measurement coincides with the generalized quantum mutual information of a q-c channel mapping an a priori state to the corresponding posteriori probability distribution of the outcomes of the measurement. This observation makes it possible to define the entropy reduction for arbitrary a priori states (not only for states with finite von Neumann entropy) and to study its analytical properties by using general properties of the quantum mutual information. By using this approach one can show that the entropy reduction of an efficient quantum measurement is a nonnegative lower semicontinuous concave function on the set of all a priori states having continuous restrictions to subsets on which the von Neumann entropy is continuous. Monotonicity and subadditivity of the entropy reduction are also easily proved by this method. A simple continuity condition for the entropy reduction and for the mean posteriori entropy considered as functions of a pair (a priori state, measurement) is obtained. A characterization of an irreducible measurement (in the Ozawa sense) which is not efficient is considered in the Appendix.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)