We introduce a multipartite communication scheme, with the aim to enable the senders to remotely and obliviously provide the receivers with an arbitrary amount of multipartite entanglement. The scheme is similar to remote state preparation (RSP). However, we show that even though the receivers are restricted to local unitary operations, the required resources for remote entanglement preparation are less than for RSP. In order to do so we introduce a canonical form of arbitrary multipartite pure states describing an arbitrary number of qubits. Moreover, we show that if the receivers are enabled to perform arbitrary local operations and classical communication, the required resources can drastically be reduced. We employ this protocol to derive robust entanglement purification protocols for arbitrary pure states and show that it can also be used for sending classical information.
Quantum secure communications could securely transmit quantum information by using quantum resource. Recently, novel applications such as bidirectional and asymmetric quantum protocols have been developed. \n \nIn this paper, we propose a new method for generating entanglement which is highly useful for multiparty quantum communications such as teleportation and Remote State Preparation (RSP). As one of its applications, we propose a new type of quantum secure communications, i.e. cyclic RSP protocols. Starting from a four-party controlled cyclic RSP protocol of one-qubit states, we show that this cyclic protocol can be generalized to a multiparty controlled cyclic RSP protocol for preparation of arbitrary qubit states. We point out that previous bidirectional and asymmetric protocols can be regarded as a simpler form of our cyclic RSP protocols.
Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be transmitted. We show that the asymptotic classical communication cost of RSP is one bit per qubit--half that of teleportation--and even less when transmitting part of a known entangled state. We explore the tradeoff between entanglement and classical communication required for RSP, and discuss RSP capacities of general quantum channels.
We characterize the class of remote state preparation (RSP) protocols that use only forward classical communication and entanglement, deterministically prepare an exact copy of a general state, and do so obliviously-without leaking further information about the state to the receiver. We prove that any such protocol can be modified to require from the sender only a single specimen of the state, without increasing the classical communication cost. This implies Lo's conjectured lower bound on the cost for these protocols. We relate our RSP protocols to the private quantum channels and establish a one-to-one correspondence between them.
We study the following task: Alice is given a classical description of a rank-
k projector
P on
Cd, and Alice and Bob want to prepare the quantum state
P/k on Bob's side using shared entanglement and classical communication. The general form of this task is known as remote state preparation (RSP). We give nearly-matching lower and upper bounds for the entanglement cost and communication cost for RSP of the states
P/k. Ours are the first nearly matching upper and lower bounds for RSP of mixed states, and in the special case of pure states, our lower bound outperforms the best previously known lower bound. Our results show that any pure entangled state that can be used to do RSP of these states with
o(d) bits of communication, can distill
logd ebits of entanglement, and conversely, any state that can distill
logd ebits of entanglement can be used to do RSP of these states efficiently. As applications of our results, we rederive a previously-known incompressibility result for states of the form
P/k, and give a new entanglement-assisted communication protocol for the equality function that uses
21logn+O(1) many ebits, and
O(1) communication.
In this paper, two efficient proposals are presented by using maximal slice states and orthogonal measurement basis to realize the joint remote state preparation (RSP) of two-qubit and three-qubit states, respectively. Furthermore, this kind of joint RSP schemes could be generalized to the case of arbitrary multi-qubit states, which can be transmitted from two senders to one receiver with the supervision of one manager. The successful probability of this joint RSP scheme is always equal to 100% in spite of that quantum channel is composed of non-maximally entangled states.