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:2204.10272 · Physical Review A

Broadcast of a restricted set of qubit and qutrit states

Mark S. Hillery, János A. Bergou, Tzu-Chieh Wei, Siddhartha Santra, Vladimir S. Malinovsky

Published Apr 21, 2022• 8 citations
arXivHTMLPDF

Abstract

The no-cloning theorem forbids the distribution of an unknown state to more than one receiver. However, if the sender knows the state, and the state is chosen from a restricted set of possibilities, a procedure known as remote state preparation can be used to broadcast a state. Here we examine a remote state preparation protocol that can be used to send the state of a qubit, confined to the equator of the Bloch sphere, to an arbitrary number of receivers. The entanglement cost is less than that of using teleportation to accomplish the same task. We present a number of variations on this task, probabilistically sending an unknown qubit state to two receivers, sending different qubit states to two receivers, and sending qutrit states to two receivers. Finally, we discuss some applications of these protocols.

DOI
10.1103/physreva.105.042611

Related papers

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•143 citations

A.: Remote preparation of quantum states

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

Abstract—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. Index Terms—Cryptography, entanglement, large deviations, teleportation, tradeoff. I.

•Jul 15, 2003•120 citations

Remote State Preparation via a Non-Maximally Entangled Channel

Yi-Zhuang Zheng, Gu Yong-Jian, Guo Guang-Can

We investigate remote state preparation (RSP) via a non-maximally entangled channel for three cases: a general qubit; a special ensemble of qubits (qubit states on the equator of the Bloch sphere); and an asymptotic limit of N copies of a general state. The results show that the classical communication cost of RSP for the two latter cases can be less than that of teleportation, but for the first case, in a restricted setting, the classical communication cost is equal to that of teleportation. Whether or not this is the case for a more general setting is still an open question.

Chinese Physics Letters•Dec 19, 2001•8 citations

Remote State Preparation via a Non—Maximally Entangled Channel

郑亦庄, 顾永建

We investigate remote state preparation (RSP) via a non-maximally entangled channel for three cases:a general qubit;a special ensemble of qubits (qubit states on the equator of the Bloch sphere);and an asymptotic limit of N copies of a general state.The results show that the classical communication cost of RSP for the two latter cases can be less than that of teleportation,but for the first case,in a restricted setting,the classical communication cost is equal to that of teleportation.Whether or not this is the case for a more general setting is still an open question.

Chinese Physics Letters•Jan 1, 2002•0 citations

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

Charles H. Bennett, David Peter Divincenzo, Peter W. Shor +3 more

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.

arXiv:quant-ph/0006044•Physical Review Letters•Jul 26, 2001•848 citations
The no-cloning theorem forbids the distribution of an unknown state to more than one receiver. However, if the sender knows the state, and the state is chosen from a restricted set of possibilities, a procedure known as remote state preparation can be used to broadcast a state. Here we examine a remote state preparation protocol that can be used to send the state of a qubit, confined to the equator of the Bloch sphere, to an arbitrary number of receivers. The entanglement cost is less than that of using teleportation to accomplish the same task. We present a number of variations on this task, probabilistically sending an unknown qubit state to two receivers, sending different qubit states to two receivers, and sending qutrit states to two receivers. Finally, we discuss some applications of these protocols.
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.
Abstract—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. Index Terms—Cryptography, entanglement, large deviations, teleportation, tradeoff. I.
We investigate remote state preparation (RSP) via a non-maximally entangled channel for three cases: a general qubit; a special ensemble of qubits (qubit states on the equator of the Bloch sphere); and an asymptotic limit of N copies of a general state. The results show that the classical communication cost of RSP for the two latter cases can be less than that of teleportation, but for the first case, in a restricted setting, the classical communication cost is equal to that of teleportation. Whether or not this is the case for a more general setting is still an open question.
We investigate remote state preparation (RSP) via a non-maximally entangled channel for three cases:a general qubit;a special ensemble of qubits (qubit states on the equator of the Bloch sphere);and an asymptotic limit of N copies of a general state.The results show that the classical communication cost of RSP for the two latter cases can be less than that of teleportation,but for the first case,in a restricted setting,the classical communication cost is equal to that of teleportation.Whether or not this is the case for a more general setting is still an open question.
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 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.