# Questions tagged [entropy]

For questions about the various kinds of entropies --- as defined in the context of quantum information theory and quantum statistical mechanics.

91 questions
Filter by
Sorted by
Tagged with
73 views

55 views

99 views

### Connection between smooth max-relative entropy and smooth max-information

The max-relative entropy between two states is defined as $$D_{\max }(\rho \| \sigma):=\log \min \{\lambda: \rho \leq \lambda \sigma\},$$ where $\rho\leq \sigma$ should be read as $\sigma - \rho$ is ...
75 views

### How can one estimate the von Neumann entropy of an unknown quantum state?

Given many copies of some unknown quantum state $\rho$, I would like to compute its von Neumann entropy $S(\rho)$. What algorithm could be used for this that minimizes the number of copies required? ...
75 views

### How is $S(\rho)=H(p_{i})+\sum_{i}p_{i}S(\rho_{i})\le \log(d)$ possible if $\rho_{i}$ are not pure states?

I know how this can be proved using the quantum relative entropy. However, even with this proof, and am still confused about how this emerges. Say I have a source that produces two states $\rho_1$ and ...
66 views

### Proof of quantum data processing inequality in N&C on pg 566

On page 566, it states that using $S(\rho^{'})-S(\rho,\varepsilon) \ge S(\rho)$ and combining this with $S(\rho) \ge S(\rho^{'})-S(\rho,\varepsilon))$, we get $S(\rho^{'})=S(\rho)-S(\rho,\varepsilon)$....
235 views

### How can the Holevo bound be used to show that $n$ qubits cannot transmit more than $n$ classical bits?

The inequality $\chi \le H(X)$ gives the upper bound on accessible information. This much is clear to me. However, what isn't clear is how this tells me I cannot transmit more than $n$ bits of ...
### How well defined is $\log(P)$ for $P$ projection?
Whenever we calculate entropy we make use, for example, $\log(P)$ for $P$ a projection defined for some arbitrary finite dimensional Hilbert space. But for projection operators this is not well-...
### Is the quantum min-relative entropy $D_{\min}(\rho\|\sigma)=-\log(F(\rho, \sigma)^2)$ or $D_{\min}(\rho\|\sigma)=-\log(tr(\Pi_\rho\sigma))$?
In John Watrous' lectures, he defines the quantum min-relative entropy as $$D_{\min}(\rho\|\sigma) = -\log(F(\rho, \sigma)^2),$$ where $F(\rho,\sigma) = tr(\sqrt{\rho\sigma})$. Here, I use this ...