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/0212164

Remote state preparation and measurement of single photon

Arun Kumar Pati

Published Dec 31, 2002• 1 citation
arXivHTMLPDF

Abstract

Quantum information theory has revolutionized the way in which information is processed using quantum resources such as entangled states, local operations and classical communications. Two important protocols in quantum communications are quantum teleportation and remote state preparation. In quantum teleportation neither the sender nor the receiver know the identity of a state. In remote state preparation the sender knows the state which is to be remotely prepared without ever physically sending the object or the complete classical description of it. Using one unit of entanglement and one classical bit Alice can remotely prepare a photon (from special ensemble) of her choice at Bob's laboratory. In remote state measurement Alice asks Bob to simulate any single particle measurement statistics on an arbitrary photon. In this talk we will present these ideas and discuss the latest developments and future open problems.

DOI
10.48550/arxiv.quant-ph/0212164

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

Experimental multilocation remote state preparation

Magnus Rådmark, Marcin Wieśniak, Marek Żukowski +1 more

Transmission of quantum states is a central task in quantum information science. Remote state preparation (RSP) has the same goal as teleportation, i.e., transferring quantum information without sending physically the information carrier, but in RSP the sender knows the state which is to be transmitted. We present experimental demonstrations of RSP for two and three locations. In our experimental scheme Alice (the preparer) and her three partners share four and six photon polarization entangled singlets. This allows us to perform RSP of two or three copies of a single-qubit state, a two-qubit Bell state, and a three-qubit $W$, or $\overline{W}$ state. A possibility to prepare two-qubit nonmaximally entangled and GHZ states is also discussed. The ability to remotely prepare an entangled states by local projections at Alice is a distinguishing feature of our scheme.

arXiv:1304.4504•Physical Review A•Sep 5, 2013•41 citations

Classical-communication cost in distributed quantum-information processing: A generalization of quantum-communication complexity

Hoi‐Kwong Lo

We study the amount of classical communication needed for distributed quantum-information processing. In particular, we introduce the concept of ``remote preparation'' of a quantum state. Given an ensemble of states, Alice's task is to help Bob in a distant laboratory to prepare a state of her choice. We find several examples of an ensemble with an entropy S where the remote preparation can be done with a communication cost lower than the amount $(2S)$ required by standard teleportation. We conjecture that, for an arbitrary N-dimensional pure state, its remote preparation requires $2{\mathrm{log}}_{2}N$ bits of classical communication, as in standard teleportation.

arXiv:quant-ph/9912009•Physical Review A•Jun 16, 2000•671 citations

Remote state preparation without oblivious conditions

A. Hayashi, T. Hashimoto, M. Horibe

In quantum teleportation, neither Alice nor Bob acquires any classical knowledge on teleported states. The teleportation protocol is said to be oblivious to both parties. In remote state preparation (RSP), it is assumed that Alice is given complete classical knowledge on the state that is to be prepared by Bob. Recently, Leung and Shor [e-print quant-ph/0201008] showed that the same amount of classical information as that in teleportation needs to be transmitted in any exact and deterministic RSP protocol that is oblivious to Bob. Assuming that the dimension of subsystems in the prior-entangled state is the same as the dimension of the input space, we study similar RSP protocols, but not necessarily oblivious to Bob. We show that in this case Bob's quantum operation can be safely assumed to be a unitary transformation. We then derive an equation that is a necessary and sufficient condition for such a protocol to exist. By studying this equation, we show that one-qubit RSP requires two classical bits of communication, which is the same amount as in teleportation, even if the protocol is not assumed oblivious to Bob. For higher dimensions, it is still an open question whether the amount of classical communication can be reduced by abandoning oblivious conditions.

arXiv:quant-ph/0205009•Physical Review A•May 13, 2003•120 citations

Remote Preparation of a Three-paticle Entangled State

XU Mingdong

With three pairs of entangled particles as the quantum channel, we present a scheme for preparing remotely a three-particle entangled state. One different point between remote state preparation and quantum teleportation is that we assume Alice starts with complete classical knowledeg of the state but Bob doesn't. Then the state wanted will be got through a series of operation. Eventually, a conclusion that remote state preparation needs less classical resource than quantum teleportation can be made.

Acta Sinica Quantum Optica•Jan 1, 2004•0 citations
Quantum information theory has revolutionized the way in which information is processed using quantum resources such as entangled states, local operations and classical communications. Two important protocols in quantum communications are quantum teleportation and remote state preparation. In quantum teleportation neither the sender nor the receiver know the identity of a state. In remote state preparation the sender knows the state which is to be remotely prepared without ever physically sending the object or the complete classical description of it. Using one unit of entanglement and one classical bit Alice can remotely prepare a photon (from special ensemble) of her choice at Bob's laboratory. In remote state measurement Alice asks Bob to simulate any single particle measurement statistics on an arbitrary photon. In this talk we will present these ideas and discuss the latest developments and future open problems.
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.
Transmission of quantum states is a central task in quantum information science. Remote state preparation (RSP) has the same goal as teleportation, i.e., transferring quantum information without sending physically the information carrier, but in RSP the sender knows the state which is to be transmitted. We present experimental demonstrations of RSP for two and three locations. In our experimental scheme Alice (the preparer) and her three partners share four and six photon polarization entangled singlets. This allows us to perform RSP of two or three copies of a single-qubit state, a two-qubit Bell state, and a three-qubit WWW, or W‾\overline{W}W state. A possibility to prepare two-qubit nonmaximally entangled and GHZ states is also discussed. The ability to remotely prepare an entangled states by local projections at Alice is a distinguishing feature of our scheme.
We study the amount of classical communication needed for distributed quantum-information processing. In particular, we introduce the concept of ``remote preparation'' of a quantum state. Given an ensemble of states, Alice's task is to help Bob in a distant laboratory to prepare a state of her choice. We find several examples of an ensemble with an entropy S where the remote preparation can be done with a communication cost lower than the amount (2S)(2S)(2S) required by standard teleportation. We conjecture that, for an arbitrary N-dimensional pure state, its remote preparation requires 2log2N2{\mathrm{log}}_{2}N2log2​N bits of classical communication, as in standard teleportation.
In quantum teleportation, neither Alice nor Bob acquires any classical knowledge on teleported states. The teleportation protocol is said to be oblivious to both parties. In remote state preparation (RSP), it is assumed that Alice is given complete classical knowledge on the state that is to be prepared by Bob. Recently, Leung and Shor [e-print quant-ph/0201008] showed that the same amount of classical information as that in teleportation needs to be transmitted in any exact and deterministic RSP protocol that is oblivious to Bob. Assuming that the dimension of subsystems in the prior-entangled state is the same as the dimension of the input space, we study similar RSP protocols, but not necessarily oblivious to Bob. We show that in this case Bob's quantum operation can be safely assumed to be a unitary transformation. We then derive an equation that is a necessary and sufficient condition for such a protocol to exist. By studying this equation, we show that one-qubit RSP requires two classical bits of communication, which is the same amount as in teleportation, even if the protocol is not assumed oblivious to Bob. For higher dimensions, it is still an open question whether the amount of classical communication can be reduced by abandoning oblivious conditions.
With three pairs of entangled particles as the quantum channel, we present a scheme for preparing remotely a three-particle entangled state. One different point between remote state preparation and quantum teleportation is that we assume Alice starts with complete classical knowledeg of the state but Bob doesn't. Then the state wanted will be got through a series of operation. Eventually, a conclusion that remote state preparation needs less classical resource than quantum teleportation can be made.