Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0404004 · Physical Review A

Resources required for exact remote state preparation

Dominic William Berry

Published Dec 6, 2004• 41 citations
arXivHTMLPDF

Abstract

It has been shown [M.-Y. Ye, Y.-S. Zhang, and G.-C. Guo, Phys. Rev. A. 69, 022310 (2004)] that it is possible to perform exactly faithful remote state preparation using finite classical communication and any entangled state with maximal Schmidt number. Here we give an explicit procedure for performing this remote state preparation. We show that the classical communication required for this scheme is close to optimal for remote state preparation schemes of this type. In addition we prove that it is necessary that the resource state have maximal Schmidt number.

DOI
10.1103/physreva.70.062306

Related papers

Remote entanglement preparation

Cornelia Spee, Julio I. de Vicente, Barbara Kraus

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.2471•Physical Review A•Jul 30, 2013•17 citations

Remote state preparation using non-maximally entangled states

Lin Chen, Yixin Chen

We present a scheme in which any pure qubit $|ϕ=\cosθ|0+\sinθe^{i\varp hi}|1$ could be remotely prepared by using minimum classical bits and the previously shared non-maximally entangled states, on condition that the receiver holds the knowledge of $θ$. Several methods are available to check the trade-off between the necessary entanglement resource and the achievable fidelity.

arXiv:quant-ph/0410190•Oct 25, 2004•0 citations

Preparable ensembles for remote state preparation

Z. Kurucz, Петер Адам

We determine all the ensembles that can be remotely prepared in a deterministic and oblivious way using a nonmaximally entangled resource with minimum classical communication cost when Bob’s unitary transformations form a cyclic group. We show that the classical communication has maximal informational entropy. We also give a constraint for the shared entangled resource that can be used for remote state preparation.

Journal of Optics B Quantum and Semiclassical Optics•Mar 10, 2005•18 citations

Faithful remote state preparation using finite classical bits and a nonmaximally entangled state

Ming-Yong Ye, Yong-Sheng Zhang, Guang‐Can Guo

We present many ensembles of states that can be remotely prepared by using minimum classical bits from Alice to Bob and their previously shared entangled state and prove that we have found all the ensembles in two-dimensional case. Furthermore we show that any pure quantum state can be remotely and faithfully prepared by using finite classical bits from Alice to Bob and their previously shared nonmaximally entangled state though no faithful quantum teleportation protocols can be achieved by using a nonmaximally entangled state.

arXiv:quant-ph/0307027•Physical Review A•Feb 20, 2004•249 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.

arXiv:1405.5309•May 21, 2014•0 citations

Remote Preparation of Quantum States

C.H. Bennett, Patrick M. Hayden, Debbie Leung +2 more

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 and entanglement but the corresponding limits for remote state preparation have remained unknown until now: previous work has shown, however, that it not only requires less classical communication but also gives rise to a tradeoff between these two resources in the appropriate setting. We discuss this problem from first principles, including the various choices one may follow in the definitions of the actual resources. Our main result is a general method of remote state preparation for arbitrary states of many qubits, at a cost of 1 bit of classical communication and 1 bit of entanglement per qubit sent. In this "universal" formulation, these ebit and cbit requirements are shown to be simultaneously optimal by exhibiting a dichotomy. Our protocol then yields the exact tradeoff curve for memoryless sources of pure states (including the case of incomplete knowledge of the ensemble probabilities), based on the recently established quantum-classical tradeoff for visible quantum data compression. A variation of that method allows us to solve the even more general problem of preparing entangled states between sender and receiver (i.e., purifications of mixed state ensembles). The paper includes an extensive discussion of our results, including the impact of the choice of model on the resources, the topic of obliviousness, and an application to private quantum channels and quantum data hiding.

arXiv:quant-ph/0307100•IEEE Transactions on Information Theory•Jan 1, 2005•198 citations
It has been shown [M.-Y. Ye, Y.-S. Zhang, and G.-C. Guo, Phys. Rev. A. 69, 022310 (2004)] that it is possible to perform exactly faithful remote state preparation using finite classical communication and any entangled state with maximal Schmidt number. Here we give an explicit procedure for performing this remote state preparation. We show that the classical communication required for this scheme is close to optimal for remote state preparation schemes of this type. In addition we prove that it is necessary that the resource state have maximal Schmidt number.
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 present a scheme in which any pure qubit $|ϕ=\cosθ|0+\sinθe^{i\varp hi}|1$ could be remotely prepared by using minimum classical bits and the previously shared non-maximally entangled states, on condition that the receiver holds the knowledge of θθθ. Several methods are available to check the trade-off between the necessary entanglement resource and the achievable fidelity.
We present many ensembles of states that can be remotely prepared by using minimum classical bits from Alice to Bob and their previously shared entangled state and prove that we have found all the ensembles in two-dimensional case. Furthermore we show that any pure quantum state can be remotely and faithfully prepared by using finite classical bits from Alice to Bob and their previously shared nonmaximally entangled state though no faithful quantum teleportation protocols can be achieved by using a nonmaximally entangled state.
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 NNN points on the Bloch sphere, which provides a geometric description.
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 and entanglement but the corresponding limits for remote state preparation have remained unknown until now: previous work has shown, however, that it not only requires less classical communication but also gives rise to a tradeoff between these two resources in the appropriate setting. We discuss this problem from first principles, including the various choices one may follow in the definitions of the actual resources. Our main result is a general method of remote state preparation for arbitrary states of many qubits, at a cost of 1 bit of classical communication and 1 bit of entanglement per qubit sent. In this "universal" formulation, these ebit and cbit requirements are shown to be simultaneously optimal by exhibiting a dichotomy. Our protocol then yields the exact tradeoff curve for memoryless sources of pure states (including the case of incomplete knowledge of the ensemble probabilities), based on the recently established quantum-classical tradeoff for visible quantum data compression. A variation of that method allows us to solve the even more general problem of preparing entangled states between sender and receiver (i.e., purifications of mixed state ensembles). The paper includes an extensive discussion of our results, including the impact of the choice of model on the resources, the topic of obliviousness, and an application to private quantum channels and quantum data hiding.