Holevo's theorem

Known as: Holevo bound, Holevo information, Holevo's bound 
Holevo's theorem is an important limitative theorem in quantum computing, an interdisciplinary field of physics and computer science. It is sometimes… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1998-2016
0519982016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We prove a new version of the Holevo bound employing the Hilbert-Schmidt norm instead of the Kullback-Leibler divergence. Suppose… (More)
Is this relevant?
2013
2013
We prove that the ultimate channel capacity, the Holevo bound, for sending classical data on a quantum channel (the so-called… (More)
Is this relevant?
2012
2012
The entropy of the Gram matrix of a joint purification of an ensemble of K mixed states yields an upper bound for the Holevo… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
In this paper we approach some questions about quantum contextuality with tools from formal logic. In particular, we consider an… (More)
Is this relevant?
2011
2011
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the… (More)
  • figure 1
Is this relevant?
2002
2002
The relative entropy description of Holevo-Schumacher-Westmoreland (HSW) classical channel capacities is applied to single qubit… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We consider the possibility of encoding m classical bits into many fewer n quantum bits (qubits) so that an arbitrary bit from… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1999
1999
Landauer’s principle [1] states that the erasure of classical information leads to an increase in the entropy of the environment… (More)
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Consider the finite regular language Ln = {w0 | w ∈ {0, 1}, |w| ≤ n}. In [3] it was shown that while this language is accepted by… (More)
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the… (More)
Is this relevant?