Related papers: An upper bound on the second order asymptotic expa…
Here it is shown that the squashed entanglement has an operational meaning -- it is the fastest rate at which a quantum state can be sent between two parties who share arbitrary side-information. Likewise, the entanglement of formation and…
In this article, we present a benchmark for resource characterization in the process of controlled quantum state reconstruction and secret sharing for general three-qubit states. This is achieved by providing a closed expression for the…
The theory of the asymptotic manipulation of pure bipartite quantum systems can be considered completely understood: The rates at which bipartite entangled states can be asymptotically transformed into each other are fully determined by a…
Remote state preparation is the variant of quantum state teleportation in which the sender knows the quantum state to be communicated. The original paper introducing teleportation established minimal requirements for classical communication…
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 prove a powerful theorem for tripartite remote entanglement distribution protocols that establishes an upper bound on the amount of entanglement of formation that can be created between two single-qubit nodes of a quantum network. Our…
Establishing quantum entanglement between two distant parties is an essential step of many protocols in quantum information processing. One possibility for providing long-distance entanglement is to create an entangled composite state…
Bell's theorem implies that the outcomes of local measurements on two maximally entangled systems cannot be simulated without classical communication between the parties. The communication cost is finite for n Bell states, but it grows…
We investigate how quantum coherence scales and is redistributed in quantum communication protocols, using superdense coding and quantum teleportation as paradigmatic case studies. Employing the relative entropy of coherence as a…
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 develop a simple protocol for a one-shot version of quantum state redistribution, which is the most general two-terminal source coding problem. The protocol is simplified from a combination of protocols for the fully quantum reverse…
We study the quantum controlled and probabilistic teleportation protocol via a four-cluster state (Front. Phys. (2017) 12: 120306). The protocol cannot achieve the goal that if the teleportation fails, it can be repeated without copies of…
We consider an unknown quantum state shared between two parties, Alice and Bob, and ask how much quantum communication is needed to transfer the full state to Bob. This problem is known as state merging and was introduced in [Horodecki et…
Quantum teleportation of an unknown quantum state is one of the few communication tasks which has no classical counterpart. Usually the aim of teleportation is to send an unknown quantum state to a receiver. But is it possible in some way…
The ability to distribute entanglement over complex quantum networks is an important step towards a quantum internet. Recently, there has been significant theoretical effort, mainly focusing on the distribution of bipartite entanglement via…
Quantum teleportation is one of the most important techniques for quantum information secure transmission. Using preshared entanglement, quantum teleportation is designed as a basic key in many quantum information tasks and features…
Quantum state exchange is a quantum communication task for two users in which the users faithfully exchange their respective parts of an initial state under the asymptotic scenario. In this work, we generalize the quantum state exchange…
State redistribution is an algorithm that stabilizes cut cells for embedded boundary grid methods. This work extends the earlier algorithm in several important ways. First, state redistribution is extended to three spatial dimensions.…
We investigate the lower bound of the amount of entanglement for faithfully teleporting a quantum state belonging to a subset of the whole Hilbert space. Moreover, when the quantum state belongs to a set composed of two states, a…
This work considers a teleportation task for Alice and Bob in a scenario where Bob cannot perform corrections. In particular, we analyse the task of \textit{multicopy state teleportation}, where Alice has $k$ identical copies of an…