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/0605057 · Physical Review A

General criterion for oblivious remote state preparation

Z. Kurucz, Петер Адам, József Janszky

Published Jun 1, 2006• 57 citations
arXivHTMLPDF

Abstract

A necessary and sufficient condition is given for general exact remote state preparation (RSP) protocols to be oblivious, that is, no information about the target state can be retrieved from the classical message. A criterion in terms of commutation relations is also derived for the existence of deterministic exact protocols in which Alice's measurement eigenstates are related to each other by fixed linear operators similar to Bob's unitaries. For nonmaximally entangled resources, it provides an easy way to search for RSP protocols. As an example, we show how to reduce the case of partially entangled resources to that of maximally entangled ones, and we construct RSP protocols exploiting the structure of the irreducible representations of Abelian groups.

DOI
10.1103/physreva.73.062301

Related papers

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

Oblivious Remote State Preparation

Debbie Leung, Peter W. Shor

We characterize the class of remote state preparation (RSP) protocols that use only forward classical communication and entanglement, deterministically prepare an exact copy of a general state, and do so obliviously-without leaking further information about the state to the receiver. We prove that any such protocol can be modified to require from the sender only a single specimen of the state, without increasing the classical communication cost. This implies Lo's conjectured lower bound on the cost for these protocols. We relate our RSP protocols to the private quantum channels and establish a one-to-one correspondence between them.

arXiv:quant-ph/0201008•Physical Review Letters•Mar 26, 2003•240 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

Eavesdropper-Blind Remote State Preparation and Applications to Quantum Public-Key Encryption

Kaniuar Bacho, Alexandru Cojocaru

Remote state preparation (RSP) is a central primitive in quantum cryptography, enabling classical parties to remotely construct quantum states using only classical communication. As a result, RSP serves as a key building block in numerous protocols involving classical clients and quantum servers, allowing classical parties to leverage the advantages offered by powerful quantum computers. All known constructions of RSP rely on strong cryptographic assumptions, typically variants of trapdoor claw-free functions (TCFs). In this work, we initiate the study of a weaker form of remote state preparation, which we call eavesdropper-blind remote state preparation (EB-RSP). Informally, EB-RSP requires blindness only against external observers who see the transcript of the honest protocol, rather than against the quantum server itself. Despite this relaxed adversarial model, the resulting notion remains sufficient for useful cryptographic applications. In particular, we show that two-message EB-RSP already suffices to construct quantum public-key encryption with classical public keys and quantum ciphertexts. We then construct two-message EB-RSP protocols from specific one-way group actions, yielding a first step toward RSP-type primitives based on assumptions that do not rely on trapdoors. Finally, we observe that existing RSP constructions are likely naturally adaptable to the two-message EB-RSP notion; we demonstrate this explicitly for a concrete TCF-based RSP construction.

quant-pharXiv:2608.21241•Aug 24, 2026•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

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.

quant-pharXiv:2602.09428•Feb 11, 2026•0 citations
A necessary and sufficient condition is given for general exact remote state preparation (RSP) protocols to be oblivious, that is, no information about the target state can be retrieved from the classical message. A criterion in terms of commutation relations is also derived for the existence of deterministic exact protocols in which Alice's measurement eigenstates are related to each other by fixed linear operators similar to Bob's unitaries. For nonmaximally entangled resources, it provides an easy way to search for RSP protocols. As an example, we show how to reduce the case of partially entangled resources to that of maximally entangled ones, and we construct RSP protocols exploiting the structure of the irreducible representations of Abelian groups.
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.
We characterize the class of remote state preparation (RSP) protocols that use only forward classical communication and entanglement, deterministically prepare an exact copy of a general state, and do so obliviously-without leaking further information about the state to the receiver. We prove that any such protocol can be modified to require from the sender only a single specimen of the state, without increasing the classical communication cost. This implies Lo's conjectured lower bound on the cost for these protocols. We relate our RSP protocols to the private quantum channels and establish a one-to-one correspondence between them.
Remote state preparation (RSP) is a central primitive in quantum cryptography, enabling classical parties to remotely construct quantum states using only classical communication. As a result, RSP serves as a key building block in numerous protocols involving classical clients and quantum servers, allowing classical parties to leverage the advantages offered by powerful quantum computers. All known constructions of RSP rely on strong cryptographic assumptions, typically variants of trapdoor claw-free functions (TCFs). In this work, we initiate the study of a weaker form of remote state preparation, which we call eavesdropper-blind remote state preparation (EB-RSP). Informally, EB-RSP requires blindness only against external observers who see the transcript of the honest protocol, rather than against the quantum server itself. Despite this relaxed adversarial model, the resulting notion remains sufficient for useful cryptographic applications. In particular, we show that two-message EB-RSP already suffices to construct quantum public-key encryption with classical public keys and quantum ciphertexts. We then construct two-message EB-RSP protocols from specific one-way group actions, yielding a first step toward RSP-type primitives based on assumptions that do not rely on trapdoors. Finally, we observe that existing RSP constructions are likely naturally adaptable to the two-message EB-RSP notion; we demonstrate this explicitly for a concrete TCF-based RSP construction.
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 study the following task: Alice is given a classical description of a rank-kkk projector PPP on Cd\mathbb{C}^dCd, and Alice and Bob want to prepare the quantum state P/kP/kP/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/kP/kP/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)o(d)o(d) bits of communication, can distill log⁡d\log dlogd ebits of entanglement, and conversely, any state that can distill log⁡d\log dlogd 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/kP/kP/k, and give a new entanglement-assisted communication protocol for the equality function that uses 12log⁡n+O(1)\frac{1}{2}\log n + O(1)21​logn+O(1) many ebits, and O(1)O(1)O(1) communication.