Related papers: Distributed inner product estimation with limited …
We provide a necessary condition that a quantum measurement can be implemented by the class of protocols known as Local Operations and Classical Communication, or LOCC, including when an error is allowed but must vanish in the limit of an…
In this work we improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes. We focus in particular on parametrized families of quantum channels and aim to improve bounds on…
We consider the problem of bounded-error quantum state identification: given either state \alpha_0 or state \alpha_1, we are required to output `0', `1' or `?' ("don't know"), such that conditioned on outputting `0' or `1', our guess is…
We study the problem of distributed cooperative learning, where a group of agents seeks to agree on a set of hypotheses that best describes a sequence of private observations. In the scenario where the set of hypotheses is large, we propose…
Quantum entanglement distillation protocols are LOCC protocols between Alice and Bob that convert imperfect EPR pairs, or, in general, partially entangled bipartite states into perfect or near-perfect EPR pairs. The classical communication…
We define a new notion of information cost for quantum protocols, and a corresponding notion of quantum information complexity for bipartite quantum channels, and then investigate the properties of such quantities. These are the fully…
We propose and analyze quantum state estimation (tomography) using continuous quantum measurements with resource limitations, allowing the global state of many qubits to be constructed from only measuring a few. We give a proof-of-principle…
A scheme is proposed by which two parties, Alice and Bob, can securely exchange real numbers. The scheme requires Alice and Bob to share entanglement and both to perform Bell-state measurements. With a qubit system two real numbers can each…
A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired…
We investigate the maximum rates for transmitting quantum information, distilling entanglement, and distributing secret keys between a sender and a receiver in a multipoint communication scenario, with the assistance of unlimited two-way…
A problem of distributed state estimation at multiple agents that are physically connected and have competitive interests is mapped to a distributed source coding problem with additional privacy constraints. The agents interact to estimate…
Quantum entanglement and coherence are two fundamental resources for quantum information processing. Recent results clearly demonstrate their relevance in quantum technological tasks, including quantum communication and quantum algorithms.…
We suggest a method for teleporting an unknown quantum state. In this method the sender Alice first uses a Controlled-Not operation on the particle in the unknown quantum state and an ancillary particle which she wants to send to the…
We consider implementations of a bipartite unitary on many pairs of unknown input states by local operation and classical communication assisted by shared entanglement. We investigate to what extent the entanglement cost and the classical…
Fundamental limits on communication rates over quantum channels are given by mathematical expressions involving entropic formulas. Often, it is unclear if these expressions are computable. This thesis describes contributions to the study of…
The single qubit quantum teleportation (sender and receiver are Alice and Bob respectively) is analyzed from the aspect of the quantum information theories. The various quantum entropies are computed at each stage, which ensures the…
In many quantum information processing protocols, entangled states shared among parties are an important resource. In this article, we study how bipartite states may be distributed in the context of a quantum network limited by timing…
Quantum Key Distribution is a quantum communication technique in which random numbers are encoded on quantum systems, usually photons, and sent from one party, Alice, to another, Bob. Using the data sent via the quantum signals,…
Independent samples from an unknown probability distribution $\bf p$ on a domain of size $k$ are distributed across $n$ players, with each player holding one sample. Each player can communicate $\ell$ bits to a central referee in a…
We consider situations in which i) Alice wishes to send quantum information to Bob via a noisy quantum channel, ii) Alice has a classical description of the states she wishes to send and iii) Alice can make use of a finite amount of…