Lower bound for accessible information in quantum mechanics
- 1 February 1994
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 49 (2) , 668-677
- https://doi.org/10.1103/physreva.49.668
Abstract
It has long been known that the von Neumann entropy S is an upper bound on the information one can extract from a quantum system in an unknown pure state. In this paper we define the ‘‘subentropy’’ Q, which we prove to be a lower bound on this information. Moreover, just as the von Neumann entropy is the best upper bound that depends only on the density matrix, we show that Q is the best lower bound that depends only on the density matrix. Other parallels between S and Q are also demonstrated.Keywords
This publication has 22 references indexed in Scilit:
- Ultimate information carrying limit of quantum systemsPhysical Review Letters, 1993
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Practical quantum cryptography based on two-photon interferometryPhysical Review Letters, 1992
- Quantum cryptography using any two nonorthogonal statesPhysical Review Letters, 1992
- Quantum cryptography without Bell’s theoremPhysical Review Letters, 1992
- Quantum cryptography based on Bell’s theoremPhysical Review Letters, 1991
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985
- Conjugate codingACM SIGACT News, 1983
- Information and quantum measurementIEEE Transactions on Information Theory, 1978
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948