Fully Quantum Computational Entropies
Noam Avidan, Thomas A. Hahn, Joseph M. Renes, Rotem Arnon

TL;DR
This paper introduces quantum computational min- and max-entropies, establishing foundational properties and operational interpretations, to develop a quantum information theory that incorporates computational efficiency.
Contribution
It develops the first rigorous quantum computational entropies, bridging classical complexity concepts with quantum information measures.
Findings
Quantum computational min-entropy parallels classical unpredictability entropy.
Properties like data processing and chain rule are established for the new entropies.
Max-entropy relates to entanglement distillation efficiency under local quantum circuits.
Abstract
Quantum information theory, particularly its entropic formulations, has made remarkable strides in characterizing quantum systems and tasks. However, a critical dimension remains underexplored: computational efficiency. While classical computational entropies integrate complexity and feasibility into information measures, analogous concepts have yet to be rigorously developed in the quantum setting. In this work, we lay the basis for a new quantum computational information theory. Such a theory will allow studying efficient -- thus relevant in practice -- manipulation of quantum information. We introduce two innovative entropies: quantum computational min- and max-entropies (along with their smooth variants). Our quantum computational min-entropy is both the fully quantum counterpart of the classical unpredictability entropy, as well as the computational parallel to the quantum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
