Related papers: Strong bounds on required resources for quantum ch…
Recent advances have led towards first prototypes of quantum networks in which entanglement is distributed by sources producing bipartite entangled states. This raises the question of which states can be generated in quantum networks based…
The search for a simple description of fundamental physical processes is an important part of quantum theory. One example for such an abstraction can be found in the distance lab paradigm: if two separated parties are connected via a…
Quantum communication relies on the existence of high quality quantum channels to exchange information. In practice, however, all communication links are affected by noise from the environment. Here we investigate the ability of quantum…
We prove a one-shot "minimax" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans.…
Reliable distribution of quantum entanglement over long distances is a central challenge in quantum information science, fundamentally limited by decoherence in noisy communication channels. In this work, we investigate the asymptotic…
We study the power of measurements implementable with local quantum operations and classical communication (or LOCC measurements for short) in the setting of quantum channel discrimination. More precisely, we consider discrimination…
Instantaneous nonlocal quantum computation refers to a process in which spacelike separated parties simulate a nonlocal quantum operation on their joint systems through the consumption of pre-shared entanglement. To prevent a violation of…
We derive an upper bound on the action of a direct product of two quantum maps (channels) acting on multi-partite quantum states. We assume that the individual channels $\Lambda_j$ affect single-particle states so, that for an arbitrary…
We introduce a new framework for quantifying the complexity of quantum channels, grounded in a suitably chosen resource set. This class of convex functions is designed to analyze the complexity of both open and closed quantum systems. By…
We can only perform a finite rounds of measurements in protocols with local operations and classical communication (LOCC). In this paper, we propose a set of product states, which require infinite rounds of measurements in order to…
We investigate the classical communication over quantum channels when assisted by no-signaling (NS) and positive-partial-transpose-preserving (PPT) codes, for which both the optimal success probability of a given transmission rate and the…
We show an experimental procedure to certify the classical capacity for noisy qubit channels. The method makes use of a fixed bipartite entangled state, where the system qubit is sent to the channel input and the set of local measurements…
Multipartite quantum entanglement serves as a resource for spatially separated parties performing distributed quantum information processing. Any multipartite entangled state can be generated from appropriately distributed bipartite…
Quantum state can be teleported to a remote site by only local measurement and classical communication if the prior Einstein-Podolsky-Rosen quantum channel is available between the sender and the receiver. Those quantum channels shared by…
We studied pure state transformations using local operations assisted by finitely many rounds of classical communication ($LOCC_{\mathbb{N}}$) in C. Spee, J.I. de Vicente, D. Sauerwein, B. Kraus, arXiv:1606.04418 (2016). Here, we first of…
Local operations on subsystems and classical communication between parties (LOCC) constitute the most general protocols available on spatially separated quantum systems. Every LOCC protocol implements a separable generalized measurement --…
Quantum channels underlie the dynamics of quantum systems, but in many practical settings it is the channels themselves that require processing. We establish universal limitations on the processing of both quantum states and channels,…
We determine the minimal experimental resources that ensure a unique solution in the estimation of trace-preserving quantum channels with both direct and convex optimization methods. A convenient parametrization of the constrained set is…
We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical…
We explore the classical communication over quantum channels with one sender and two receivers, or with two senders and one receiver, First, for the quantum broadcast channel (QBC) and the quantum multi-access channel (QMAC), we study the…