Related papers: Entanglement cost of implementing controlled-unita…
It is known that any bipartite unitary operator of Schmidt rank three is equivalent to a controlled unitary under local unitaries. We propose a standard form of such operators. Using the form we improve the upper bound for the entanglement…
We prove that there is a trade-off relation between the entanglement cost and the number of rounds of communication, for two distant parties to accomplish a bidirectional quantum information task by local operations and classical…
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…
We prove a trade-off relation between the entanglement cost and classical communication complexity of causal order structure of a protocol in distributed quantum information processing. We consider an implementation of a class of two-qubit…
We prove, using a new method based on map-state duality, lower bounds on entanglement resources needed to deterministically implement a bipartite unitary using separable (SEP) operations, which include LOCC (local operations and classical…
We compare three different characterizations of the globalness of bipartite unitary operations, namely, delocalization power, entanglement cost, and entangling power, to investigate global properties of unitary operations. We show that the…
In certain cases the communication time required to deterministically implement a nonlocal bipartite unitary using prior entanglement and LOCC (local operations and classical communication) can be reduced by a factor of two. We introduce…
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…
In this thesis, we investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC). In the first part, we analyze implementable computation over a given quantum network resource by…
In this paper, we study the number of rounds of communication needed to implement certain tasks by local quantum operations and classical communication (LOCC). We find that the class of LOCC operations becomes strictly more powerful as more…
We show that the ability to create entanglement is necessary for execution of bipartite quantum gates even when they are applied to unentangled states and create no entanglement. Starting with a simple example we demonstrate that to execute…
A powerful operational paradigm for distributed quantum information processing involves manipulating pre-shared entanglement by local operations and classical communication (LOCC). The LOCC round complexity of a given task describes how…
Recently, the problem of discriminating multipartite unitary operations by local operations and classical communication (LOCC) has attracted significant attention. The latest work in the literature on this problem showed that two…
The entangling power of a bipartite unitary operation shows the maximum created entanglement with the product input states. For an arbitrary two-qubit unitary operation, it is sufficient to consider its normalized operation $U$ with…
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…
Stochastic local operations and classical communication (SLOCC), also called local filtering operations, are a convenient, useful set of quantum operations in grasping essential properties of entanglement. We give a quick overview about the…
Distinguishability is a fundamental and operational task generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and…
We quantify the one-shot entanglement cost of an arbitrary bipartite state, that is the minimum number of singlets needed by two distant parties to create a single copy of the state up to a finite accuracy, using local operations and…
We present the generalized version of Wang's protocol[A.M.Wang, Phys.Rev.A 74,032317 (2006)] for the remote implementation(sometimes referred to as quantum remote control) of partially unknown quantum operations. The protocol only requires…
Entanglement is the resource to overcome the natural limitations of spatially separated parties restricted to Local Operations assisted by Classical Communications (LOCC). Recently two new classes of operational entanglement measures, the…