All Questions
Tagged with information-theory textbook-and-exercises
16 questions
5
votes
1
answer
559
views
Can all mixed states be written as a convex combination $\rho=\sum_j p_j |\psi_j\rangle\langle \psi_j|$?
States belonging to some space $\mathcal H$ can be described by density operators $\rho\in L(\mathcal H)$ that are positive and have trace one. Pure states are the ones that can be written as $\rho=|\...
- 63
5
votes
2
answers
757
views
Nielsen and Chuang ex 2.73
I've been trying to solve exercise 2.73 (p.g 105), and I'm not sure if i'v been overthinking it and the answer is as simple as i've described below or if I am missing something, or i'm just wrong!
Ex ...
- 979
5
votes
0
answers
106
views
Pure state ensembles achieving the Holevo $\chi$-quantity with at most $d^2$ states
Theorem 8.10 in Chapter 8 of Theory of Quantum Information asserts that the Holevo capacity of a quantum channel (between density operators on $\mathbb{C}^d$) can be achieved by an ensemble consisting ...
- 2,156
4
votes
2
answers
314
views
In the proof of the joint entropy theorem, why are $p_i\lambda_i^j$ the eigenvalues?
From section 11.3.2 of Nielsen & Chuang:
(4) let $\lambda_i^j$ and $\left|e_i^j\right>$ be the eigenvalues and corresponding eigenvectors of $\rho_i$. Observe that $p_i\lambda_i^j$ and $\left|...
- 555
4
votes
0
answers
429
views
Prove the equality conditions in the triangle inequality $S(A,B)\ge |S(A)-S(B)|$ for the von Neumann entropy
The triangle inequality or Araki-Lieb inequality of the von Neumann entropy is
$$
S(A,B)\ge|S(A)-S(B)|
$$
this is proven by introducing a system $R$ which purifies systems $A$ and $B$. Applying ...
- 851
4
votes
0
answers
80
views
A question in classical and quantum information
Let $\rho, \sigma \in \mathfrak{D}(A)$ with $\operatorname{supp}(\rho) \subseteq \operatorname{supp}(\sigma),$ and spectral decomposition
$$
\rho=\sum_{x} p_{x}\left|\psi_{x}\right\rangle\left\langle\...
- 133
2
votes
2
answers
434
views
How to understand intuitively the concavity of the binary entropy?
In Nielsen and Chuang's Quantum Computation and Quantum Information book, introducing the binary entropy, they gave an intuitive example about why binary entropy is concave:
Alice has in her ...
- 715
2
votes
1
answer
156
views
Understanding the definition of entropy in the joint entropy theorem derivation
From section 11.3.2 of Nielsen & Chuang:
(4) let $\lambda_i^j$ and $\left|e_i^j\right>$ be the eigenvalues and corresponding eigenvectors of $\rho_i$. Observe that $p_i\lambda_i^j$ and $\left|...
- 21
2
votes
2
answers
269
views
How to show $T(\rho,\sigma)≥\sum_i|r_i − s_i|$ with $r_i,s_i$ eigenvalues of $\rho,\sigma$?
The proof of the Fannes' inequality replies on the formula $T(ρ, σ)≥\sum_i|r_i − s_i|$, where $r_i,s_i$ are the eigenvalues of $\rho,\sigma$, in the descending order.
In the proof given in Box 11.2, ...
- 851
2
votes
1
answer
206
views
von Neumann entropy in a limiting case
I am stuck with a question from the book Quantum theory by Asher Peres.
Excercise (9.11):
Three different preparation procedures of a spin 1/2 particle are represented by the vectors $\begin{pmatrix}
...
2
votes
1
answer
142
views
In classical state discrimination, why does the trace distance quantify the probability of success?
Consider the following task: we are given a probability distribution $p_y:x\mapsto p_y(x)$ with $y\in\{0,1\}$ (e.g. we are given some black box that we can use to draw samples from either $p_0$ or $...
glS♦
- 26.9k
2
votes
1
answer
560
views
How to prove that the mutual information is subadditive?
Let $\mathbf x=(x_1,...,x_n)$ and $\mathbf y=(y_1,...,y_n)$ be two vectors of random variables. To make things concrete, assume that Alice sends each component $x_j$ through a noisy channel to Bob, ...
- 173
1
vote
1
answer
4k
views
How do I calculate the von Neumann entropy of a pure one-qubit density matrix?
Let's say I have a pure state of the form:
$$\psi = \sqrt{\frac{3}{9}} \lvert 0 \rangle + \sqrt{\frac{6}{9}} \lvert 1 \rangle$$
Then the density matrix representation would be:
$$\rho = \psi \otimes \...
- 1,785
1
vote
1
answer
160
views
In Schumacher’s noiseless channel coding theorem, how do we get the exponents in $|0\rangle ^{\otimes n(1−p)/2}|1\rangle ^{\otimes n(1−p)/2}$?
On pg. 55 in Nielsen and Chuang, it's said that:
the $|0\rangle + |1\rangle$ product can be well approximated by a superposition of states of the form $|0\rangle ^{\otimes n(1−p)/2}|1\rangle ^{\...
- 679
1
vote
0
answers
67
views
Distinguish two states with their priors probability
EDIT: This is a computer programming / coding exercise
The states $\left|\psi\right>$ and $\left|\phi\right>$ are defined as
$∣ϕ⟩=\cos(θ_ϕ)\left|0\right>+\sin(θ_ϕ) \left|1\right>$ with ...
- 123
0
votes
1
answer
52
views
Why do we want the no error limit to be 1?
In a textbook by Nielsen and Chuang, there's the following paragraph:
The idea of quantum data compression is that the compressed data should be recovered with very good fidelity. Think of the ...
- 679