
The Holevo bound is the maximum amount of classical information that can be transmitted using a quantum channel.In 1973, Soviet mathematician Alexander Holevo from the Steklov Mathematical Institute proved his famous theorem. It states that the amount of classical information accessible to an observer about a quantum state does not exceed the von Neumann entropy of that state (a measure of its uncertainty) minus the average entropy of the states composing the ensemble. This work became a cornerstone of quantum information theory.
Formulated and proven by Alexander Holevo in 1973. The idea was independently discussed in Western literature later, but priority belongs to Holevo. The theorem became the starting point for the development of quantum channel capacity theory: Benjamin Schumacher and Richard Jozsa later introduced the term 'qubit' and studied quantum information compression. Also important are the works of Charles Bennett and Stephen Wiesner.
The Holevo bound is used in designing quantum communication protocols and evaluating their efficiency. It is also important in quantum cryptography — it determines the upper bound on information leakage to an eavesdropper. Limitations: it assumes that the sender and receiver do not use entanglement (they transmit prepared states). For quantum channels with entanglement, there are more general bounds — the Holevo-Schumacher-Westmoreland capacity, which go beyond this theorem.
Sets the limit for the throughput of the quantum internet and the security of quantum cryptography.
The Holevo bound explains why quantum computers cannot simply 'download' all answers from parallel universes: only a limited amount of ordinary data can be extracted from a quantum state.







