arXiv:quant-ph/0307027 · Physical Review A

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

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

Published Feb 20, 2004• 249 citations

Abstract

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.

DOI: 10.1103/physreva.69.022310

Related papers

Probabilistic remote state preparation by W states

Liu Jin-Ming, Wang Yu-Zhu

In this paper we consider a scheme for probabilistic remote state preparation of a general qubit by using W states. The scheme consists of the sender, Alice and two remote receivers Bob and Carol. Alice performs a projective measurement on her qubit in the basis spanned by the state she wants to prepare and its orthocomplement. This allows either Bob or Carol to reconstruct the state with finite success probability. It is shown that for some special ensembles of qubits, the remote state preparation scheme requires only two classical bits, unlike the case in the scheme of quantum teleportation where three classical bits are needed.

Chinese PhysicsFeb 1, 200427 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 OpticsMar 10, 200518 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/0205009Physical Review AMay 13, 2003120 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/0307100IEEE Transactions on Information TheoryJan 1, 2005143 citations

Joint remote state preparation

Nguyen Ba An, Jaewan Kim

Alice, Bob and Charlie are three remote parties. Alice and Bob share the classical knowledge of a secret qubit state. We consider the following question: 'how can Alice and Bob jointly prepare the qubit state for Charlie?' Two different protocols are proposed for such a joint remote state preparation. The first protocol uses a single GHZ state while the second one uses a pair of EPR states as the quantum channel whose entanglement is not necessarily maximal.

Journal of Physics B Atomic Molecular and Optical PhysicsApr 22, 2008181 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, 2003120 citations