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.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.

arXiv:1302.2471Physical Review AJul 30, 201317 citations

Optimizing classical communication in remote preparation of a general pure qubit

Congyi Hua, Yixin Chen

How to uses shared entanglement and forward classical communication to remotely prepare an arbitrary (mixed or pure) state has been fascinating quantum information scientists. A constructive scheme has been given by Berry for remotely preparing a general pure state with a pure entangled state and finite classical communication. Based on this scheme, for high-dimensional systems it is possible to use a coding of the target state to optimize the classical communication cost. Unfortunately, for low-dimensional systems such as a pure qubit the coding method is inapplicable. Because qubit plays a central role in quantum information theory, we propose an optimization procedure which can be used to minimize the classical communication cost in the remote preparation of a general pure qubit. Interestingly, our optimization procedure is linked to the uniform arrangement of $N$ points on the Bloch sphere, which provides a geometric description.How to uses shared entanglement and forward classical communication to remotely prepare an arbitrary (mixed or pure) state has been fascinating quantum information scientists. A constructive scheme has been given by Berry for remotely preparing a general pure state with a pure entangled state and finite classical communication. Based on this scheme, for high-dimensional systems it is possible to use a coding of the target state to optimize the classical communication cost. Unfortunately, for low-dimensional systems such as a pure qubit the coding method is inapplicable. Because qubit plays a central role in quantum information theory, we propose an optimization procedure which can be used to minimize the classical communication cost in the remote preparation of a general pure qubit. Interestingly, our optimization procedure is linked to the uniform arrangement of $N$ points on the Bloch sphere, which provides a geometric description.

arXiv:1405.5309May 21, 20140 citations

Near-optimal entanglement-communication tradeoffs for remote state preparation

Srijita Kundu, Olivier Lalonde

We study the following task: Alice is given a classical description of a rank- $k$ projector $P$ on $\mathbb{C}^d$ , 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 $\log d$ ebits of entanglement, and conversely, any state that can distill $\log d$ 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 $\frac{1}{2}\log n + O(1)$ many ebits, and $O(1)$ communication.We study the following task: Alice is given a classical description of a rank-$k$ projector $P$ on $\mathbb{C}^d$, 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 $\log d$ ebits of entanglement, and conversely, any state that can distill $\log d$ 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 $\frac{1}{2}\log n + O(1)$ many ebits, and $O(1)$ communication.

quant-pharXiv:2602.09428Feb 11, 20260 citations

Remote state preparation with classically correlated state

Wei Wu, Wei-Tao Liu, Bao-Quan Ou +2 more

Optics CommunicationsJan 11, 200816 citations

N

points on the Bloch sphere, which provides a geometric description.

We study the following task: Alice is given a classical description of a rank-

k

projector

P

\mathbb{C}^d

, 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

\log d

ebits of entanglement, and conversely, any state that can distill

\log d

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

\frac{1}{2}\log n + O(1)

many ebits, and

O(1)

communication.