相关论文: A tight lower bound on the classical communication…
Recently, it was discovered that the `quantum partial information' needed to merge one party's state with another party's state is given by the conditional entropy, which can be negative [Horodecki, Oppenheim, and Winter, Nature 436, 673…
We consider the class of functions whose value depends only on the intersection of the input X_1,X_2, ..., X_t; that is, for each F in this class there is an f_F: 2^{[n]} \to {0,1}, such that F(X_1,X_2, ..., X_t) = f_F(X_1 \cap X_2 \cap ...…
The utilization of a $d$-level partially entangled state, shared by two parties wishing to communicate classical information without errors over a noiseless quantum channel, is discussed. We analytically construct deterministic dense coding…
Quantum entanglement of pure states is usually quantified via the entanglement entropy, the von Neumann entropy of the reduced state. Entanglement entropy is closely related to entanglement distillation, a process for converting quantum…
We analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement. We employ concepts and techniques developed in quantum Shannon theory to study an asymptotic…
Two particles, initially in a product state, become entangled when they come together and start to interact. Using semiclassical methods, we calculate the time evolution of the corresponding reduced density matrix $\rho_1$, obtained by…
One of the primary goals of information theory is to provide limits on the amount of information it is possible to send through various types of communication channels, and to understand the encoding methods that will allow one to achieve…
The design of error-correcting codes used in modern communications relies on information theory to quantify the capacity of a noisy channel to send information [1]. This capacity can be expressed using the mutual information between input…
Entanglement is the cornerstone of quantum communication, yet conventional detection relies solely on local measurements. In this work, we present a unified theoretical and experimental framework demonstrating that one-way local operations…
We consider a standard distributed optimisation setting where $N$ machines, each holding a $d$-dimensional function $f_i$, aim to jointly minimise the sum of the functions $\sum_{i = 1}^N f_i (x)$. This problem arises naturally in…
Quantum entanglement is a key physical resource in quantum information processing that allows for performing basic quantum tasks such as teleportation and quantum key distribution, which are impossible in the classical world. Ever since the…
Entanglement distillation has many applications in quantum information processing and is an important tool for improving the quality and efficiency of quantum communication, cryptography, computing, and simulation. We propose an…
We show lower bounds of $\Omega(\sqrt{n})$ and $\Omega(n^{1/4})$ on the randomized and quantum communication complexity, respectively, of all $n$-variable read-once Boolean formulas. Our results complement the recent lower bound of…
We prove lower bounds for the entanglement of formation and the squashed entanglement for any a bipartite density matrix in terms of the conditional entropy of the bipartite state with respect to either of its partial traces, and prove that…
Quantum network communication is challenging, as the No-cloning theorem in quantum regime makes many classical techniques inapplicable. For long-distance communication, the only viable communication approach is teleportation of quantum…
Recently Galv\~{a}o and Hardy have shown that quantum cloning can improve the performance of some quantum computation tasks. However such performance enhancement is possible only if quantum correlations survive the cloning process. We…
We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the…
This paper will address the question of the distillation of entanglement from a finite number of multi-partite mixed states. It is shown that if one can distill a pure entangled state from n copies of a mixed state $\sigma _{ABC...}$ there…
We analytically obtain the maximum probability of converting a finite number of copies of an arbitrary two-qubit pure state to a single copy of a maximally entangled two-qubit pure state via entanglement assisted local operations and…
I consider deterministic distinguishability of a set of orthogonal, bipartite states when only a single copy is available and the parties are restricted to local operations and classical communication, but with the additional requirement…