On entanglement-assisted classical capacity

This paper is essentially a lecture from the author's course on quantum information theory, which is devoted to the result of C. H. Bennett, P. W. Shor, J. A. Smolin and A. V. Thapliyal (quant-ph/0106052) concerning entanglement-assisted classical capacity of a quantum channel. A modified proof of this result is given and relation between entanglement-assisted and unassisted classical capacities is discussed.Comment: 10 pages, LATE

Quantifying nonorthogonality

An exploratory approach to the possibility of analyzing nonorthogonality as a quantifiable property is presented. Three different measures for the nonorthogonality of pure states are introduced, and one of these measures is extended to single-particle density matrices using methods that are similar to recently introduced techniques for quantifying entanglement. Several interesting special cases are considered. It is pointed out that a measure of nonorthogonality can meaningfully be associated with a single mixed quantum state. It is then shown how nonorthogonality can be unlocked with classical information; this analysis reveals interesting inequalities and points to a number of connections between nonorthogonality and entanglement.Comment: Accepted for publication in Phys. Rev.

Mixedness and teleportation

We show that on exceeding a certain degree of mixedness (as quantified by the von Neumann entropy), entangled states become useless for teleporatation. By increasing the dimension of the entangled systems, this entropy threshold can be made arbitrarily close to maximal. This entropy is found to exceed the entropy threshold sufficient to ensure the failure of dense coding.Comment: 6 pages, no figure

Entanglement Swapping Chains for General Pure States

We consider entanglement swapping schemes with general (rather than maximally) entangled bipartite states of arbitary dimension shared pairwise between three or more parties in a chain. The intermediate parties perform generalised Bell measurements with the result that the two end parties end up sharing a entangled state which can be converted into maximally entangled states. We obtain an expression for the average amount of maximal entanglement concentrated in such a scheme and show that in a certain reasonably broad class of cases this scheme is provably optimal and that, in these cases, the amount of entanglement concentrated between the two ends is equal to that which could be concentrated from the weakest link in the chain.Comment: 18 pages, 5 figure

Thermodynamics and the Measure of Entanglement

We point out formal correspondences between thermodynamics and entanglement. By applying them to previous work, we show that entropy of entanglement is the unique measure of entanglement for pure states.Comment: 8 pages, RevTeX; edited for clarity, additional references, to appear as a Rapid Communication in Phys. Rev.

The Parity Bit in Quantum Cryptography

An $n$-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that $n$-bit string is described by one of two density matrices, $\rho_0^{(n)}$ and $\rho_1^{(n)}$, both in a Hilbert space of dimension $2^n$. In order to derive the parity bit the receiver must distinguish between the two density matrices, e.g., in terms of optimal mutual information. In this paper we find the measurement which provides the optimal mutual information about the parity bit and calculate that information. We prove that this information decreases exponentially with the length of the string in the case where the single bit states are almost fully overlapping. We believe this result will be useful in proving the ultimate security of quantum crytography in the presence of noise.Comment: 19 pages, RevTe

Difficulty of distinguishing product states locally

Non-locality without entanglement is a rather counter-intuitive phenomenon in which information may be encoded entirely in product (unentangled) states of composite quantum systems in such a way that local measurement of the subsystems is not enough for optimal decoding. For simple examples of pure product states, the gap in performance is known to be rather small when arbitrary local strategies are allowed. Here we restrict to local strategies readily achievable with current technology; those requiring neither a quantum memory nor joint operations. We show that, even for measurements on pure product states there can be a large gap between such strategies and theoretically optimal performance. Thus even in the absence of entanglement physically realizable local strategies can be far from optimal for extracting quantum information.Comment: 5 pages, 1 figur

A classical analogue of entanglement

We show that quantum entanglement has a very close classical analogue, namely secret classical correlations. The fundamental analogy stems from the behavior of quantum entanglement under local operations and classical communication and the behavior of secret correlations under local operations and public communication. A large number of derived analogies follow. In particular teleportation is analogous to the one-time-pad, the concept of ``pure state'' exists in the classical domain, entanglement concentration and dilution are essentially classical secrecy protocols, and single copy entanglement manipulations have such a close classical analog that the majorization results are reproduced in the classical setting. This analogy allows one to import questions from the quantum domain into the classical one, and vice-versa, helping to get a better understanding of both. Also, by identifying classical aspects of quantum entanglement it allows one to identify those aspects of entanglement which are uniquely quantum mechanical.Comment: 13 pages, references update

Entanglement entropy of multipartite pure states

Consider a system consisting of $n$ $d$-dimensional quantum particles and arbitrary pure state $\Psi$ of the whole system. Suppose we simultaneously perform complete von Neumann measurements on each particle. One can ask: what is the minimal possible value $S[\Psi]$ of the entropy of outcomes joint probability distribution? We show that $S[\Psi]$ coincides with entanglement entropy for bipartite states. We compute $S[\Psi]$ for two sample multipartite states: the hexacode state ($n=6, d=2$) and determinant states ($n=d$). The generalization of determinant states to the case $d<n$ is considered.Comment: 7 pages, REVTeX, corrected some typo

Shadow Tomography of Quantum States

We introduce the problem of *shadow tomography*: given an unknown $D$-dimensional quantum mixed state $\rho$, as well as known two-outcome measurements $E_{1},\ldots,E_{M}$, estimate the probability that $E_{i}$ accepts $\rho$, to within additive error $\varepsilon$, for each of the $M$ measurements. How many copies of $\rho$ are needed to achieve this, with high probability? Surprisingly, we give a procedure that solves the problem by measuring only $\widetilde{O}\left( \varepsilon^{-4}\cdot\log^{4} M\cdot\log D\right)$ copies. This means, for example, that we can learn the behavior of an arbitrary $n$-qubit state, on all accepting/rejecting circuits of some fixed polynomial size, by measuring only $n^{O\left( 1\right)}$ copies of the state. This resolves an open problem of the author, which arose from his work on private-key quantum money schemes, but which also has applications to quantum copy-protected software, quantum advice, and quantum one-way communication. Recently, building on this work, Brand\~ao et al. have given a different approach to shadow tomography using semidefinite programming, which achieves a savings in computation time.Comment: 29 pages, extended abstract appeared in Proceedings of STOC'2018, revised to give slightly better upper bound (1/eps^4 rather than 1/eps^5) and lower bounds with explicit dependence on the dimension