Questions tagged [information-theory]
The tag is used for questions connected with information theory in classical and/or quantum sense.
171
questions
0
votes
0
answers
43
views
What role does Landauer's principle play in quantum reverisbility?
In section 3.2.5 of Nielsen and Chuang (starting page 153) they talk about Landauer’s principle, where they discuss the lower bound on the thermodynamic cost of erasing information.
In irreversible ...
2
votes
0
answers
19
views
contraction related Bit flip channel
Studying the bit flip channel using the Nielsen & Chuang's.
And ran into the picture with the caption stating y-z plane is uniformly contracted by a factor of 1-2p. I don't quite understand how ...
1
vote
2
answers
153
views
Is there a non-deterministic protocol for entanglement generation between distant parties?
I'm aware that one can imperfectly clone entanglement that's shared between two parties (i.e. Bell pairs) using deterministic quantum cloning machines to produce two, lower fidelity entangled states.
...
0
votes
1
answer
87
views
Is there a non one-way quantum computer?
Be it theoretical proposal or anything else, is there even a definition for non one-way (or non measurement-based) quantum computer/computation?
2
votes
2
answers
44
views
Derivation of the linear cross entropy
I'm looking at cross-entropy benchmarks and there's much that I'm reading at the moment but I'm stuck on one detail: how to derive the linear cross-entropy formula from the cross-entropy formula.
The ...
1
vote
1
answer
51
views
Can one define a Choi state for a a classical channel?
Suppose one has a classical channel $W(y|x)$ that is a conditional probability distribution. Can one define a Choi state for this channel?
My guess is that one should think of it as a special case of ...
3
votes
2
answers
103
views
Tapering off qubits
Suppose you have a Hamiltonian of the form
$$ H = ZXXX + YXXX + XXXX $$
where $Z,X,Y$ are the usual Pauli matrices with $ZXXX = Z \otimes X \otimes X \otimes X$ and similar for the other two terms. ...
3
votes
2
answers
85
views
Existence of a perturbed channel that achieves a perturbed output state
Consider a $d$-dimensional maximally entangled state $\vert\phi\rangle = \frac{1}{d}\sum_{i=1}^d\vert i\rangle_A\vert i\rangle_B$. Let $N_{A\rightarrow A'}$ be a quantum channel and consider $\rho_{A'...
5
votes
2
answers
123
views
maximization of trace between two operators with respect to different norm constraints
I want to maximize $\text{Tr}(XY)$ over $X$ for fixed $Y$, where $X$ and $Y$ are both hermitian (but doesn't necessarily positive) operators, and $X$ is constrained by its p-norm bounded by $1$, i.e. $...
6
votes
1
answer
131
views
Is it possible to extract $x_1$ and $x_2$ from $|\phi\rangle=\frac1{\sqrt2}(|x_1,0^n\rangle+|0^n,x_2\rangle)$ with non-negligible probability?
Let $\left\vert \phi\right\rangle=\frac 1{\sqrt2}\left\vert x_1,0^n\right\rangle+\frac1{\sqrt2}\left\vert 0^n,x_2\right\rangle$ be a $2n$-bit quantum state for some unknown $x_1,x_2\in\{0,1\}^n$. My ...
6
votes
1
answer
128
views
Schmidt decomposition for tripartite system $ABC$ with vanishing mutual information between $A$ and $C$
Suppose I have a tripartite system $ABC$ in a pure state $|\psi_{ABC}\rangle$ with mutual information $I(A:C)=0$. This implies that the reduced density matrix $\rho_{AC}$ factorizes as $\rho_{AC} = \...
12
votes
1
answer
2k
views
How can classical bits be copied if qubits cannot be copied?
The no-cloning theorem of quantum mechanics tells us there can be no general quantum circuit that can copy arbitrary qubit states, i.e. a quantum gate or circuit cannot send $|0\rangle |\psi\rangle\...
1
vote
2
answers
65
views
Is it possible to efficiently measure outer products of quantum states, of the form $|a\rangle\langle b|$?
I am looking at a matrix reconstruction algorithm that, given singular values $\sigma_i$ and quantum states $|u_i\rangle$ and $|v_i\rangle$ that are efficiently prepared on a quantum computer, ...
5
votes
1
answer
72
views
What is the quantum analogue of $P_{XY} = P_{Y|X}P_X$
A standard trick in probability manipulation is to take some joint distribution $P_{XY}$ and express it as $P_{Y|X}P_X$. This trick is useful because when one looks at things like the ratio of $\frac{...
4
votes
1
answer
61
views
Quantum channel between two states with inaccessible reference - when can it be done?
Suppose I have a pair of bipartite states $\rho_{AR}$ and $\sigma_{BR}$. $R$ is a reference system that we do not have access to.
It is clear that we cannot always have a channel $N_{A\rightarrow B}$ ...
0
votes
0
answers
36
views
The derivation of the quantum information no-hiding theorem, question 2
I am reading Samuel L. Braunstein, Arun K. Pati, Quantum information cannot be completely hidden in correlations: implications for the black-hole information paradox. The paper purportedly proves ...
2
votes
0
answers
85
views
The derivation of the quantum information no-hiding theorem, question 1
I am reading Samuel L. Braunstein, Arun K. Pati, Quantum information cannot be completely hidden in correlations: implications for the black-hole information paradox. I am puzzling over the derivation ...
1
vote
0
answers
60
views
How to understand Clifford+T from a quantum information theory perspective [closed]
I'd like to study the important operator set Clifford+T from a quantum information theory perspective.
The Clifford+T set is universal and it is important because allows for efficient error correction ...
4
votes
1
answer
126
views
Threshold for quantum Repetition Code
I'm learning about the Threshold theorem but I struggle with the computations of the threshold which are usually presented (even the one in the book by Nielsen & Chuang). To clear my head, I would ...
2
votes
1
answer
46
views
If information is increase in entropy, why does large entropy mean little information?
Excuse me since this is an elementary question in information theory.
I am asking this question here since the statement "large entropy means little information" is mentioned in the first ...
4
votes
1
answer
73
views
Data processing inequality for relative entropy in the presence of an amplitude damping channel
Consider the single qubit quantum depolarizing channel, given by
$$T(\rho) = (1- p)\rho + p \frac{\mathbb{I}}{2}. $$
For an $n$ qubit state $\rho$, according to Definition 6.1 of this paper, the ...
3
votes
0
answers
28
views
Proof of upper and lower bound (Gilbert-Varshamov bound) for linear code
I am trying to prove the following bounds for a $[n, k]$ code that can correct $t$ errors
\begin{align}
1-H\left(\frac{t}{n}\right)\geq \frac{k}{n}\geq 1-H\left(\frac{2t}{n}\right)
\end{align}
where
\...
3
votes
1
answer
116
views
Entanglement entropy and depth
I wanted to verify two intuitions about the entanglement entropy of quantum states.
Consider an $n$ qubit quantum state, prepared by a depth $d$ circuit acting on $|0\rangle^{\otimes n}$ and a ...
4
votes
1
answer
131
views
Is the composition of two extremal channels also extremal?
In this question, I follow the terminology and notation of the book of Watrous, most notably chapter two.
Extremal channels
An extremal channel $\Phi(X) \in C(\mathcal{X},\mathcal{Y})$ is a channel ...
3
votes
1
answer
98
views
How many minimum Quantum Rats are needed to figure out which bottle contains poison?
For the classical Poison and Rat puzzle, we need at least $\lceil\log_2({\rm bottles})\rceil$ rats to figure out the poisoned bottle.
If we have Schrödinger’s quantum rats, can we use fewer rats(...
2
votes
1
answer
29
views
Properties of the generalized fidelity for subnormalized states
The generalized fidelity for quantum states that may be sub-normalized is given by (Defn 3.12)
$$F_{*}(\rho, \tau):=\left(\operatorname{Tr}|\sqrt{\rho} \sqrt{\tau}|+\sqrt{(1-\operatorname{Tr} \rho)(1-\...
2
votes
0
answers
20
views
Max-relative entropy quasi-convexity inequality under partial trace
The max-relative entropy between two states is defined as
$$D_{\max }(\rho \| \sigma):=\log \min \{\lambda: \rho \leq \lambda \sigma\}.$$
It is known that the max-relative entropy is quasi-convex. ...
4
votes
1
answer
234
views
What is the root of the non-trace-preserving bit-flip map
I have a quantum channel defined by the Kraus operators:
$$
U_1 =
\begin{bmatrix}
p & 0 \\
0 & p
\end{bmatrix},\quad
U_2 =
\begin{bmatrix}
0 & p \\
p & 0
\end{bmatrix}
$$
i.e.
$$
U_1\...
3
votes
1
answer
34
views
Quasi concavity of max-relative entropy?
The max-relative entropy between two states is defined as
$$D_{\max }(\rho \| \sigma):=\log \min \{\lambda: \rho \leq \lambda \sigma\}.$$
It is known that the max-relative entropy is quasi-convex. ...
3
votes
1
answer
64
views
Special properties of a channel whose Kraus decomposition contains Identity
I would like to know if there are any special properties of channels that permit a Kraus representation that includes an identity? That is, if I am given a Kraus representation of a CPTP map $\Phi$ ...
5
votes
1
answer
254
views
No-cloning theorem and distinguishing between two non-orthogonal quantum states revisited
There are a couple of posts on this question, but I think they are not satisfactory. The question is Nielsen and Chuang's QCQI, Exercise 1.2, page 57, which asks "Explain how a device which, upon ...
2
votes
0
answers
190
views
What does a quantum mutual information larger than its classical upper bound represent?
Let $\rho$ be a bipartite state. Its quantum mutual information is defined as
$$\newcommand{\tr}{\operatorname{tr}}I(\rho) = S(\tr_B(\rho)) + S(\tr_A(\rho)) - S(\rho),$$
where $S(\sigma)$ is the von ...
2
votes
1
answer
52
views
Does ${\rm tr}(\Pi_z\rho\Pi_z)\le p$ imply $\cal E(\rho)$ and $\cal E(\Pi_{-z}\rho\Pi_{-z})$ are close in trace distance?
Suppose I have a quantum operation $\mathcal{E}$ and a state $\rho$ such that:
$$ \operatorname{tr}(\Pi_z \rho \Pi_z) \le p $$
for some probability $p$ and some projection $\Pi_z$ onto some subspace ...
1
vote
1
answer
52
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 ^{\...
4
votes
0
answers
74
views
What is the quantum capacity of the combined amplitude and phase damping channel?
Quantum capacity for the amplitude damping channel and the pure dephasing channel have closed-form formulas as it can be seen in section 24.7.2 of From Classical to Quantum Shannon Theory. However, I ...
4
votes
1
answer
82
views
What is a maximal entangled multipartite state?
We know the four Bell states are the maximal entangled states for two-qubit states, and we know if a state cannot be written as the tensor product by its subsets, then it is a entangled state, so is ...
1
vote
1
answer
33
views
How to take the limits of the sandwiched Renyi divergences?
The sandwiched Renyi divergence is defined as
$$\begin{equation}
\tilde{D}_{\alpha}(\rho \| \sigma):=\frac{1}{\alpha-1} \log \operatorname{tr}\left[\left(\sigma^{\frac{1-\alpha}{2 \alpha}} \rho \...
2
votes
1
answer
51
views
What is the difference between having a single-qubit state and knowing a result of a measurement you want to perform on it?
In the quantum teleportation protocol Alice can send Bob an unknown quantum state $|\psi\rangle$. If the only thing Bob does with $|\psi\rangle$ is to measure it in some basis, I guess it would be ...
3
votes
0
answers
41
views
Uhlmann's theorem analogue for channels
Let the stabilized channel fidelity between two channels $M_{A\rightarrow B}$ and $N_{A\rightarrow B}$ be defined as
$$F(M,N) = \min\limits_{\vert\psi\rangle_{AR}} F\left((M\otimes I_R)\vert\psi\...
2
votes
1
answer
50
views
What are the "higher moments" of the gate fidelity?
Reading the paper Gate fidelity fluctuations and quantum process invariants I came across the concept of higher moments of the gate fidelity, for example in the following excerpt from the introduction:...
4
votes
1
answer
198
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=|\...
1
vote
0
answers
75
views
Prove that autocompatible LCPT maps are antidegradable
A LCPT map $\Phi$ is antidegradable if and only if it is compatible with itself.
The proof that an antidegradable map (satisfying $\Phi=\Lambda_E\circ \tilde\Phi$ where $\tilde\Phi$ is the ...
2
votes
1
answer
217
views
How does the Kraus decomposition imply the Stinespring representation?
To show that the Kraus decomposition $\Phi(\rho)=\sum_{k=1}^D M_k\rho_S M_k^\dagger$ implies the Stinespring form $$\Phi(\rho)=\text{tr}_E[U_{SE}(\rho_S\otimes|0\rangle\langle 0|_E)U_{SE}^\dagger]$$ ...
0
votes
1
answer
43
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 ...
2
votes
1
answer
56
views
What can be said about the non-negativity of the relative entropy of $S(\rho_{AB}||\rho_{B})$?
Taking $\rho_{AB}=\rho_{A}\otimes \rho_{B}$, where $S(\rho_{A})$ and $S(\rho_{B})$ aren't 0, it's easy to see that
$$S(\rho_{AB}||I \otimes \rho_{B})=-S(\rho_{A})-S(\rho_{B})+S(\rho_{B})=-S(\rho_{A}).$...
4
votes
1
answer
99
views
Concavity of Conditional Quantum Entropy
Let's say I have a bipartite density operator $\gamma_{12} = (1 - \epsilon) \rho_{12} + \epsilon\sigma_{12}$, for $0 \le \epsilon \le 1$, i.e., a convex combination of $\rho_{12}$ and $\sigma_{12}$. I ...
1
vote
0
answers
16
views
Optimality of teleportation for entanglement-assisted quantum channel coding
Setting:
Consider a quantum channel $N_{A\rightarrow B}$ between Alice and Bob. Let Alice and Bob also share arbitrary amounts of entanglement assistance through the state $\phi_{A_EB_E}$ (these can ...
3
votes
0
answers
54
views
How to translate performance of two classical codes to a quantum CSS code?
I have a database of classical codes with simulation results in binary symmetric channel (BSC).
The codes are defined by their parity check matrices $H$. I can pick pairs of codes and call them $H_x$ ...
3
votes
1
answer
59
views
Tradeoff between error and rates of quantum communication
Suppose Alice and Bob share $n$ copies of a noiseless quantum channel $I_{A\rightarrow B}$ which can be used to send quantum states and $H_A\cong H_B$ i.e. the input and output Hilbert spaces are the ...
2
votes
2
answers
246
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 ...