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:1802.07795 · IEEE Transactions on Information Theory

Communication Complexity of One-Shot Remote State Preparation

Shima Bab Hadiashar, Ashwin Nayak, Renato Renner

Published Mar 2, 2018• 10 citations
arXivHTMLPDF

Abstract

Quantum teleportation uses prior shared entanglement and classical communication to send an unknown quantum state from one party to another. Remote state preparation (RSP) is a similar distributed task in which the sender knows the entire classical description of the state to be sent. (This may also be viewed as the task of nonoblivious compression of a single sample from an ensemble of quantum states.) We study the communication complexity of approximate RSP (ARSP) in which the goal is to prepare an approximation of the desired quantum state. Jain (Quant. Inf. & Comp., 2006) showed that the worst-case communication complexity of ARSP can be bounded from above in terms of the maximum possible information in an encoding. He also showed that this quantity is a lower bound for communication complexity of (exact) remote state preparation. In this paper, we tightly characterize the worst-case and average-case communication complexity of remote state preparation in terms of nonasymptotic information-theoretic quantities. We also show that the average-case communication complexity of RSP can be much smaller than the worst-case one. In the process, we show that $n$ bits cannot be communicated with less than $n$ transmitted bits in local operations and classical communication protocols. This strengthens a result due to Nayak and Salzman (J. ACM, 2006) and may be of independent interest.

DOI
10.1109/tit.2018.2811509

Related papers

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

Communication Complexity of Remote State Preparation

Shima Bab Hadiashar

Superdense coding and quantum teleportation are two phenomena which were not possible without prior entanglement. In superdense coding, one sends n bits of information using n/2 qubits in the presence of shared entanglement. However, we show that n bits of information cannot be sent with less than n bits of communication in LOCC protocols even in the presence of prior entanglement. This is an interesting result which will be used in the rest of this thesis. \n \nQuantum teleportation uses prior entanglement and classical communication to send \nan unknown quantum state. Remote state preparation (RSP) is the same distributed task, \nbut in the case that the sender knows the description of the state to be sent, completely. \nWe study the communication complexity of approximate remote state preparation in which \nthe goal is to prepare an approximation of the desired quantum state. Jain showed that the worst-case error communication complexity of RSP can be bounded from above in terms of the maximum possible information in an encoding [18]. He also showed that this quantity is a lower bound for communication complexity of exact remote state preparation [18]. \nIn this thesis, we characterize the worst-case error and average-case error communication complexity of remote state preparation in terms of non-asymptotic information-theoretic quantities. We also utilize the bound we derived for the communication complexity of LOCC protocols in the first part of the thesis, to show that the average-case error communication complexity of RSP can be much smaller than the worst-case.

•May 27, 2014•1 citation

Remote State Preparation for Multiple Parties

Wenhan Dai, Tianyi Peng, Moe Z. Win

Remote state preparation (RSP) is a technique to transmit quantum states with classical communication and previously shared entanglement. In this paper, we consider RSP in a multiparty setting. A simple yet nontrivial case is studied, where there is one sender and two receivers. We put forth a broadcasting method for developing multiparty RSP protocols. We show that this method can remotely prepare arbitrary states by consuming classical and quantum resources. For preparing highly entangled states, the proposed method achieves the lower bound for the amount of consumed resources asymptotically.

IEEE International Conference on Acoustics Speech and Signal Processing•Apr 17, 2019•3 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

Nonlocality in Remote State Preparation vis-a-vis Teleportation

Aiman Khan, Som Kanjilal, Dipankar Home

The hitherto unexplored nonlocality of quantum correlations in the information transfer protocol of remote state preparation (RSP) is investigated in terms of a unified nonlocality argument formulated for teleportation as well as for two distinct RSP schemes. The argument differs only in the respective types of local measurements used in each scenario. One of the RSP schemes uses single particle projective measurements, while the other uses joint Bell-basis measurements. Interestingly, the quantum mechanical violations of the Bell-CHSH type inequalities formulated for each of the RSP setups, while being equal to each other, also turn out to be equal to that of the corresponding Bell-CHSH type local realist inequality for teleportation, using the common resource of non-maximally entangled state. This reveals that for such a resource state, the maximum amount of extractable nonlocality of correlations involved in the transfer of information is the same for the standard teleportation protocol and the two RSP schemes considered here, thereby implying that the essential difference between teleportation and remote state preparation lies in the amount of classical information required to be exchanged between parties, and not in the nonlocality of underlying correlations.

arXiv:1612.01136•Dec 4, 2016•0 citations

Derivation and experimental test of fidelity benchmarks for remote preparation of arbitrary qubit states

Nathan Killoran, Devon N. Biggerstaff, Rainer Kaltenbaek +2 more

Remote state preparation (RSP) is the act of preparing a quantum state at a remote location without actually transmitting the state itself. Using at most two classical bits and a single shared maximally entangled state, one can in theory remotely prepare any qubit state with certainty and with perfect fidelity. However, in any experimental implementation the average fidelity between the target and output states cannot be perfect. In order for an RSP experiment to demonstrate genuine quantum advantages, it must surpass the optimal threshold of a comparable classical protocol. Here we study the fidelity achievable by RSP protocols lacking shared entanglement and determine the optimal value for the average fidelity in several different cases. We implement an experimental scheme for deterministic remote preparation of arbitrary photon polarization qubits, preparing $178$ different pure and mixed qubit states with an average fidelity of $0.995$. Our experimentally achieved average fidelities surpass our derived classical thresholds whenever the classical protocol does not trivially allow for perfect RSP.

arXiv:0909.5461•Physical Review A•Jan 29, 2010•48 citations
Quantum teleportation uses prior shared entanglement and classical communication to send an unknown quantum state from one party to another. Remote state preparation (RSP) is a similar distributed task in which the sender knows the entire classical description of the state to be sent. (This may also be viewed as the task of nonoblivious compression of a single sample from an ensemble of quantum states.) We study the communication complexity of approximate RSP (ARSP) in which the goal is to prepare an approximation of the desired quantum state. Jain (Quant. Inf. & Comp., 2006) showed that the worst-case communication complexity of ARSP can be bounded from above in terms of the maximum possible information in an encoding. He also showed that this quantity is a lower bound for communication complexity of (exact) remote state preparation. In this paper, we tightly characterize the worst-case and average-case communication complexity of remote state preparation in terms of nonasymptotic information-theoretic quantities. We also show that the average-case communication complexity of RSP can be much smaller than the worst-case one. In the process, we show that nnn bits cannot be communicated with less than nnn transmitted bits in local operations and classical communication protocols. This strengthens a result due to Nayak and Salzman (J. ACM, 2006) and may be of independent interest.
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.
Superdense coding and quantum teleportation are two phenomena which were not possible without prior entanglement. In superdense coding, one sends n bits of information using n/2 qubits in the presence of shared entanglement. However, we show that n bits of information cannot be sent with less than n bits of communication in LOCC protocols even in the presence of prior entanglement. This is an interesting result which will be used in the rest of this thesis. \n \nQuantum teleportation uses prior entanglement and classical communication to send \nan unknown quantum state. Remote state preparation (RSP) is the same distributed task, \nbut in the case that the sender knows the description of the state to be sent, completely. \nWe study the communication complexity of approximate remote state preparation in which \nthe goal is to prepare an approximation of the desired quantum state. Jain showed that the worst-case error communication complexity of RSP can be bounded from above in terms of the maximum possible information in an encoding [18]. He also showed that this quantity is a lower bound for communication complexity of exact remote state preparation [18]. \nIn this thesis, we characterize the worst-case error and average-case error communication complexity of remote state preparation in terms of non-asymptotic information-theoretic quantities. We also utilize the bound we derived for the communication complexity of LOCC protocols in the first part of the thesis, to show that the average-case error communication complexity of RSP can be much smaller than the worst-case.
Remote state preparation (RSP) is a technique to transmit quantum states with classical communication and previously shared entanglement. In this paper, we consider RSP in a multiparty setting. A simple yet nontrivial case is studied, where there is one sender and two receivers. We put forth a broadcasting method for developing multiparty RSP protocols. We show that this method can remotely prepare arbitrary states by consuming classical and quantum resources. For preparing highly entangled states, the proposed method achieves the lower bound for the amount of consumed resources asymptotically.
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.
The hitherto unexplored nonlocality of quantum correlations in the information transfer protocol of remote state preparation (RSP) is investigated in terms of a unified nonlocality argument formulated for teleportation as well as for two distinct RSP schemes. The argument differs only in the respective types of local measurements used in each scenario. One of the RSP schemes uses single particle projective measurements, while the other uses joint Bell-basis measurements. Interestingly, the quantum mechanical violations of the Bell-CHSH type inequalities formulated for each of the RSP setups, while being equal to each other, also turn out to be equal to that of the corresponding Bell-CHSH type local realist inequality for teleportation, using the common resource of non-maximally entangled state. This reveals that for such a resource state, the maximum amount of extractable nonlocality of correlations involved in the transfer of information is the same for the standard teleportation protocol and the two RSP schemes considered here, thereby implying that the essential difference between teleportation and remote state preparation lies in the amount of classical information required to be exchanged between parties, and not in the nonlocality of underlying correlations.
Remote state preparation (RSP) is the act of preparing a quantum state at a remote location without actually transmitting the state itself. Using at most two classical bits and a single shared maximally entangled state, one can in theory remotely prepare any qubit state with certainty and with perfect fidelity. However, in any experimental implementation the average fidelity between the target and output states cannot be perfect. In order for an RSP experiment to demonstrate genuine quantum advantages, it must surpass the optimal threshold of a comparable classical protocol. Here we study the fidelity achievable by RSP protocols lacking shared entanglement and determine the optimal value for the average fidelity in several different cases. We implement an experimental scheme for deterministic remote preparation of arbitrary photon polarization qubits, preparing 178178178 different pure and mixed qubit states with an average fidelity of 0.9950.9950.995. Our experimentally achieved average fidelities surpass our derived classical thresholds whenever the classical protocol does not trivially allow for perfect RSP.