Remote State Preparation

Teleportation is the protocol that solves the canonical-sounding problem: Alice holds a qubit in some unknown state |\psi\rangle, she wants Bob (far away) to end up holding that qubit's state. The protocol needs one pre-shared Bell pair and two classical bits per qubit teleported. You saw it in the teleportation chapter; it is the textbook resource count.

Here is a different problem. Alice knows exactly what state she wants Bob to end up with. She has the pair of complex amplitudes (\alpha, \beta) written on a piece of paper — maybe she computed them, maybe they are part of an agreed-upon protocol, maybe she is sending a one-time-pad quantum token whose contents she specified. She does not have a qubit in that state; she has the description of the state. She has a Bell pair shared with Bob. She has a classical communication channel to Bob.

Question. Can she do better than teleportation?

The answer is yes, and only yes in certain cases. For a restricted family — specifically, states on the equator of the Bloch sphere, which have the form \tfrac{1}{\sqrt 2}(|0\rangle + e^{i\varphi}|1\rangle) — Alice can succeed with just one classical bit per qubit, half the teleportation cost. This is the remote state preparation (RSP) protocol. It was introduced in 2001 by a constellation of six authors (Bennett, DiVincenzo, Shor, Smolin, Terhal, Wootters), and the subtle resource-counting trade-offs it revealed triggered a decade of follow-up work on quantum communication complexity.

The difference from teleportation lives in one sentence: when Alice knows the state, she can measure in a basis tailored to it; when she does not, she must measure in a fixed basis and send more bits. The knowledge is the resource, and RSP is the protocol that turns Alice's knowledge into classical-communication savings.

By the end of this chapter you should be able to: run through the RSP protocol for any equator state |\psi(\varphi)\rangle, see exactly where Bob's Pauli correction comes from, derive the "1 classical bit" count, work out two worked examples (|+\rangle and |+i\rangle), explain why arbitrary states need more, and place RSP in the broader map of teleportation-family protocols.

The setting — picture before formula

Three things live in the problem:

1. The target state |\psi\rangle, whose amplitudes (\alpha, \beta) Alice knows classically. No qubit is in this state at the start; it is a description on Alice's side.

2. A pre-shared Bell pair |\Phi^+\rangle_{AB} = \tfrac{1}{\sqrt 2}(|00\rangle + |11\rangle) with Alice's half (call it q_A) on Alice's side and Bob's half (q_B) on Bob's side. This is one ebit of entanglement — the standard resource unit of quantum communication.

3. A classical channel from Alice to Bob. This is what the protocol is trying to use sparingly.

Compare with teleportation. In teleportation, Alice has an extra unknown-state qubit |\psi\rangle that she must consume. The extra qubit is why she is forced into a fixed-basis Bell measurement on two qubits — her qubit in |\psi\rangle and her half of the Bell pair — which yields 2 bits of outcome. She cannot tailor the measurement to |\psi\rangle, because she does not know what |\psi\rangle is.

In RSP, Alice has no extra qubit. She has only her half of the Bell pair. She is going to measure just that single qubit — in a basis that depends on |\psi\rangle. A single-qubit measurement gives 1 bit of outcome. That is where the savings come from, structurally.

The key identity — Bell pair viewed in any basis

Here is the one algebraic fact that the whole protocol rests on. The Bell state |\Phi^+\rangle has a special property: you can rewrite it in any orthonormal basis on either qubit, and the other qubit's amplitudes rearrange symmetrically.

Take any orthonormal basis \{|u\rangle, |u^\perp\rangle\} on the 2D qubit space. Then

where |u^*\rangle means the complex-conjugate of |u\rangle in the computational basis — i.e. if |u\rangle = a|0\rangle + b|1\rangle, then |u^*\rangle = a^*|0\rangle + b^*|1\rangle.

Why the complex conjugate appears: the Bell state |\Phi^+\rangle = \sum_i |i\rangle_A |i\rangle_B uses the same index i on both sides, so when you re-express |i\rangle_A using coefficients on the new basis, those same coefficients appear un-starred on the B side — but because the original |i\rangle_B are computational basis vectors, the change-of-basis matrix on B is the transpose of the one on A, which for real matrices equals the original and for complex ones means the conjugate. A line-by-line derivation follows in the next paragraph.

The derivation is short enough to do here. Write |u\rangle = a|0\rangle + b|1\rangle (so |u^\perp\rangle = -b^*|0\rangle + a^*|1\rangle, the standard orthogonal vector). Invert to express computational basis vectors in the new basis:

Why these are correct: verify by substituting. a^*|u\rangle - b|u^\perp\rangle = a^*(a|0\rangle + b|1\rangle) - b(-b^*|0\rangle + a^*|1\rangle) = (|a|^2 + |b|^2)|0\rangle + (a^*b - ba^*)|1\rangle = |0\rangle, since |a|^2 + |b|^2 = 1 and the second coefficient cancels. Similarly for |1\rangle.

Substitute these into |\Phi^+\rangle_{AB}:

Regroup terms by the A-side basis:

Recognise the B-side pieces: a^*|0\rangle + b^*|1\rangle = |u^*\rangle, and -b|0\rangle + a|1\rangle = (a moment of bookkeeping) |u^{\perp *}\rangle up to an overall sign, since |u^{\perp *}\rangle = -b|0\rangle + a|1\rangle by conjugating |u^\perp\rangle = -b^*|0\rangle + a^*|1\rangle.

So

The identity is proved.

The punchline. If Alice measures q_A in the basis \{|u\rangle, |u^\perp\rangle\}:

• With probability \tfrac{1}{2}, she gets outcome "u", and Bob's qubit is now in |u^*\rangle.
• With probability \tfrac{1}{2}, she gets outcome "u^\perp", and Bob's qubit is now in |u^{\perp *}\rangle.

Alice's measurement outcome is 1 bit of classical information. It tells Bob which of two possible states he now holds. And crucially: the choice of basis \{|u\rangle, |u^\perp\rangle\} is Alice's — she picks it based on the state |\psi\rangle she wants to prepare remotely. That is the knob RSP turns.

The equator-state protocol — one bit suffices

For equator states of the Bloch sphere, the protocol is fully transparent. An equator state is one with equal |0\rangle and |1\rangle amplitudes and some relative phase:

These are the states that sit on the equator of the Bloch sphere — the circle through |+\rangle, |+i\rangle, |-\rangle, |-i\rangle. They form a continuous one-parameter family and are the "typical" states used as signal states in quantum key distribution and many quantum-communication protocols.

The measurement basis Alice uses is the basis adapted to |\psi(\varphi)\rangle:

These are two orthogonal states on the equator, diametrically opposite. The check that they are orthogonal:

Why the cross-terms vanish: \langle 0 | 0 \rangle = 1, \langle 1 | 1 \rangle = 1, \langle 0 | 1 \rangle = \langle 1 | 0 \rangle = 0. The surviving terms are \tfrac{1}{2}(1 \cdot 1 + e^{-i\varphi}(-e^{i\varphi}) \cdot 1) = \tfrac{1}{2}(1 - e^{-i\varphi} e^{i\varphi}) = 0.

Now apply the Bell-pair identity with |u\rangle = |+_\varphi\rangle. Working out |u^*\rangle and |u^{\perp*}\rangle: if |u\rangle = \tfrac{1}{\sqrt 2}(|0\rangle + e^{i\varphi}|1\rangle), then |u^*\rangle = \tfrac{1}{\sqrt 2}(|0\rangle + e^{-i\varphi}|1\rangle) = |+_{-\varphi}\rangle. And |u^\perp\rangle = \tfrac{1}{\sqrt 2}(|0\rangle - e^{i\varphi}|1\rangle) = |-_\varphi\rangle, so |u^{\perp*}\rangle = \tfrac{1}{\sqrt 2}(|0\rangle - e^{-i\varphi}|1\rangle) = |-_{-\varphi}\rangle.

So after Alice's measurement in the \{|+_\varphi\rangle, |-_\varphi\rangle\} basis, Bob's qubit is in either |+_{-\varphi}\rangle or |-_{-\varphi}\rangle.

Case 1. Alice's outcome is "+_\varphi" (1 of 2 outcomes). Bob's qubit is now in |+_{-\varphi}\rangle = \tfrac{1}{\sqrt 2}(|0\rangle + e^{-i\varphi}|1\rangle). This is not the target |\psi(\varphi)\rangle — it has e^{-i\varphi} instead of e^{i\varphi}. Bob needs to fix this.

Case 2. Alice's outcome is "-_\varphi" (the other outcome). Bob's qubit is in |-_{-\varphi}\rangle = \tfrac{1}{\sqrt 2}(|0\rangle - e^{-i\varphi}|1\rangle). Again, not the target. Needs a different fix.

In both cases, Alice sends 1 classical bit to Bob encoding which outcome she got. Bob applies the corresponding correction.

Working out Bob's corrections

In Case 1, Bob has \tfrac{1}{\sqrt 2}(|0\rangle + e^{-i\varphi}|1\rangle) and wants \tfrac{1}{\sqrt 2}(|0\rangle + e^{i\varphi}|1\rangle). The target and the current state differ by swapping \varphi \to -\varphi, which on the Bloch sphere is a reflection across the xz-plane. Equivalently: his current state is the complex conjugate of the target.

Here is the subtlety: no single-qubit unitary maps |\psi\rangle \to |\psi^*\rangle for all \psi simultaneously. Complex conjugation is antiunitary, not unitary. But we only need to fix the specific pair of states in play, and for equator states there is a simple fix: Bob applies the Pauli Z gate, which takes |0\rangle \to |0\rangle and |1\rangle \to -|1\rangle. Applied to Bob's current state:

That's not the target either. So plain Z doesn't work. Let's try a different protocol choice.

Choice that makes the protocol clean: Alice measures in a different equator basis, specifically \{|+_{-\varphi}\rangle, |-_{-\varphi}\rangle\} — the basis with the negated phase relative to her target. Let's redo the analysis with |u\rangle = |+_{-\varphi}\rangle = \tfrac{1}{\sqrt 2}(|0\rangle + e^{-i\varphi}|1\rangle).

Then |u^*\rangle = \tfrac{1}{\sqrt 2}(|0\rangle + e^{i\varphi}|1\rangle) = |+_\varphi\rangle = |\psi(\varphi)\rangle. Exactly the target. And |u^\perp\rangle = |-_{-\varphi}\rangle, so |u^{\perp *}\rangle = |-_\varphi\rangle = \tfrac{1}{\sqrt 2}(|0\rangle - e^{i\varphi}|1\rangle).

Why this basis choice is "natural": Alice picks the measurement basis \{|+_{-\varphi}\rangle, |-_{-\varphi}\rangle\} — conjugate-mirror of the target. By the Bell-pair identity, the conjugates on Bob's side are precisely \{|+_\varphi\rangle, |-_\varphi\rangle\}, which contain |\psi(\varphi)\rangle as one option and its antipode as the other. So Bob either already has |\psi(\varphi)\rangle or has its antipode — a Z gate in the same basis flips one to the other.

So the corrected protocol:

1. Alice wants to send |\psi(\varphi)\rangle. She measures her qubit q_A in the basis \{|+_{-\varphi}\rangle, |-_{-\varphi}\rangle\} — the basis rotated by -\varphi on the equator.
2. Outcome +_{-\varphi} (probability \tfrac{1}{2}): Bob's qubit is immediately in |\psi(\varphi)\rangle. Done. No correction.
3. Outcome -_{-\varphi} (probability \tfrac{1}{2}): Bob's qubit is in \tfrac{1}{\sqrt 2}(|0\rangle - e^{i\varphi}|1\rangle). Apply Z to flip the sign of the |1\rangle component? That gives \tfrac{1}{\sqrt 2}(|0\rangle + e^{i\varphi}|1\rangle) \cdot wait, Z flips |1\rangle's sign: Z(|0\rangle - e^{i\varphi}|1\rangle) = |0\rangle - e^{i\varphi}(-|1\rangle) = |0\rangle + e^{i\varphi}|1\rangle. Yes. Bob applies Z and now has |\psi(\varphi)\rangle. Done.
4. Alice sends 1 classical bit telling Bob which outcome she got — "apply Z" or "do nothing."

Total: one Bell pair consumed, one classical bit sent, and Bob deterministically holds |\psi(\varphi)\rangle. Compare to teleportation, which would need the same one Bell pair and two classical bits to achieve the same deterministic single-qubit state transfer.

The resource comparison:

One bit saved, every single qubit. Over a million-qubit protocol, that's a million bits of classical bandwidth saved — real money in satellite QKD uplinks, where downlink classical bandwidth is orders of magnitude more abundant than Alice's uplink.

Worked examples

Beyond equator states — the resource trade-off

The equator-state protocol buys a 50% classical-bit discount compared to teleportation. Nice. But RSP for arbitrary single-qubit states is a richer story, and the accounting is subtler.

A general single-qubit state has two real parameters — the polar angle \theta and the azimuthal angle \varphi on the Bloch sphere. Equator states fix \theta = \pi/2, leaving only \varphi. For a fully general state, there is no single-measurement RSP protocol that uses only 1 classical bit — you need more information to pin down a 2-parameter state.

The Lo bound (H.-K. Lo, 1999, arXiv:quant-ph/9912009) gives the deep answer. For exactly-deterministic RSP of an arbitrary unknown state from a finite ensemble, the classical communication cost can be as high as 2 bits per qubit — the same as teleportation. The equator-state saving doesn't generalise to arbitrary states.

But there is a subtler resource landscape when you allow:

• Approximate RSP (Bob's final state is close to |\psi\rangle but not exact).
• Asymptotic RSP (send n qubits jointly, and look at the per-qubit cost as n \to \infty).
• Probabilistic RSP (the protocol succeeds with some probability < 1; failed runs are detected and discarded).

In the asymptotic setting, the Bennett-Hayden-Leung-Shor-Winter trade-off (2005) gives a clean formula: you can trade classical bits for entanglement. At one end, RSP of n qubits costs 2n classical bits and n ebits (same as n independent teleportations). At the other end, you can cut the classical cost to n bits at the price of needing 2n ebits of shared entanglement (asymptotically). Between those, there's a continuous trade-off curve.

The structural lesson: classical communication and shared entanglement are interchangeable resources, and RSP maps out the exchange rate. This is the cleanest illustration in quantum information of Shannon-style resource accounting. When one resource is cheap and the other is expensive, you pick the operating point on the curve that minimises your total cost.

For the 15-year-old on their phone, the take-away is simpler. Knowing the state you want to send is itself a resource. Alice's classical notebook — her knowledge of (\alpha, \beta) — gets converted by RSP into classical-bandwidth savings. Teleportation works for an unknown state and pays full price in classical bits. RSP is the discount protocol for the known-state case.

Common confusions

• "RSP is teleportation of a known state." This is a natural thing to say but mechanically wrong. In teleportation, Alice holds a qubit in |\psi\rangle and performs a Bell measurement on it plus her half of the Bell pair. In RSP, Alice has no |\psi\rangle qubit — she has the classical description only. She performs a single-qubit measurement on her half of the Bell pair, in a basis chosen using the description. The two protocols use different circuits and different resource counts; RSP is not a special case of teleportation.

• "RSP always sends 1 classical bit less than teleportation." Only for equator states. For general single-qubit states the story is more subtle, and the bit-counting depends on whether you want exact or approximate preparation, single-shot or asymptotic, deterministic or probabilistic. The "save 1 bit" rule of thumb is a genuine win only in the equator-state regime.

• "Remote state preparation sounds like cloning." It isn't. Alice destroys her half of the Bell pair in the measurement. There is only one copy of |\psi\rangle at the end — the one on Bob's side. The state does not exist at both locations simultaneously. The no-cloning theorem is not threatened.

• "If Alice knows |\psi\rangle and they have a classical channel, why not just send the real numbers (\alpha, \beta) digitally and have Bob prepare |\psi\rangle locally?" If Alice can send arbitrary real-number precision over the classical channel, this is in fact fine — but the real-number precision is hiding arbitrarily many bits of classical communication inside the (\alpha, \beta) pair. RSP's significance is that it achieves the preparation with a small, fixed number of classical bits (exactly 1 for equator states, at a fixed classical granularity), regardless of how precise Bob's target is. The entanglement is what provides the "continuous" part of the state-specification for free.

• "Alice's basis choice is a kind of 'cheating' because she uses information about |\psi\rangle that teleportation's Alice didn't have." This is the correct read. Teleportation's Alice is forbidden from knowing |\psi\rangle (by problem statement) and so cannot tailor her measurement; she must use the fixed Bell basis. RSP's Alice knows |\psi\rangle and can tailor. The "cheating" is exactly what RSP formalises: the value of Alice's classical knowledge in the accounting.

• "RSP proves that quantum communication can beat teleportation's bound." It doesn't break any bound. It is a different protocol solving a different problem. Teleportation's 2-bit bound is for the transfer of an unknown quantum state. RSP's 1-bit cost is for the remote preparation of a known state. Different inputs, different problems, different optimal costs.

Going deeper

Lo's lower bound on RSP

H.-K. Lo's 1999 paper — Classical-communication cost in distributed quantum-information processing: a generalization of quantum-communication complexity, arXiv:quant-ph/9912009 — proved that for deterministic RSP of an arbitrary single-qubit state, the worst-case classical-communication cost cannot be less than the number of classical bits required to describe the state to the required precision. For a continuous family of states, this is formally unbounded; for a discrete set of N possible target states, it is \log_2 N bits.

The equator-state family is continuous, so naively Lo's bound says the cost is unbounded. The reason we can get away with just 1 bit is that the entanglement resource supplies the "continuous" part of the specification. A pre-shared Bell pair already carries infinite-precision correlations between Alice and Bob — the 1 classical bit picks out which branch of those correlations to use, and Alice's basis-tailoring does the rest.

The Bennett–DiVincenzo–Shor–Smolin–Terhal–Wootters protocol

The full 2001 paper — Remote state preparation, Phys. Rev. Lett. 87, 077902 (2001), arXiv:quant-ph/0006044 — treats RSP for arbitrary single-qubit states. Their protocol generalises the equator-state case by using a more elaborate entangled resource (multiple Bell pairs, or a maximally entangled state in a higher-dimensional space) and more elaborate measurements.

The main theorem: for ensembles of single-qubit states that are not on the equator, you can still achieve RSP with less classical communication than teleportation asymptotically — i.e., when sending n qubits jointly — but the per-qubit savings are smaller and require more entanglement. The trade-off is captured in the asymptotic RSP theorem: in the limit of many qubits, the total resources (C, E) (classical bits and ebits) required to prepare n independent copies of |\psi\rangle satisfy C + 2E \geq 2n (conservation of a "total resource" count), with equality achievable in some regimes.

The BHLSW trade-off (Bennett, Hayden, Leung, Shor, Winter 2005) tightened this: you can in fact choose any operating point (C, E) with C + 2E \geq 2n and C \geq n, E \geq n/2 (roughly). The classical-bit floor of n is interesting — it says no matter how much entanglement you burn, you need at least 1 classical bit per qubit.

The duality with superdense coding

Teleportation, RSP, and superdense coding form a family of protocols that trade off three kinds of resources: qubits, ebits, and classical bits. Informally:

The rough "resource conservation" law: 1 qubit \approx 1 ebit + 1 classical bit, with fine-structure corrections depending on whether the sender's state is known (RSP) or unknown (teleportation) and whether the receiver produces a known output (superdense) or reconstructs an unknown one.

This is sometimes phrased as a duality between RSP and superdense coding: both involve "extra" knowledge on one side of the protocol, both save a bit compared to the naive protocol, and both make use of the pre-shared Bell pair as a resource. The duality is formalised in the language of quantum Shannon theory — see the Wilde textbook (open access: arXiv:1106.1445) for the full treatment.

Experimental demonstrations

Peng, Yang, Bao, and Pan demonstrated photonic RSP of polarisation-encoded qubits in 2003 (Phys. Rev. Lett. 90, 150502), using parametric-down-conversion-generated Bell pairs and polarisation-dependent measurements. Several subsequent experiments — atomic ensembles, trapped ions, superconducting processors — have reproduced and extended the protocol. The fidelity of RSP on current hardware is comparable to teleportation fidelity (90-99% depending on platform and purpose).

For Indian context: RSP has not been a headline experimental focus at Indian quantum-communication groups (the main focus has been QKD and entanglement distribution), but it is a candidate optimisation for satellite uplinks. Satellite-to-ground QKD, including ISRO's 2022 demonstration, has severe uplink classical-bandwidth constraints — the satellite can listen to ground, but ground can only uplink a limited number of bits per second. RSP-style protocols are actively considered for reducing uplink classical traffic when the quantum signal states are pre-agreed in the protocol.

RSP and communication complexity

In quantum communication complexity — the study of how many bits (or qubits) two parties need to exchange to compute a joint function — RSP is a useful subroutine. If Alice knows a function of her input and Bob needs to receive a specific quantum state encoding that function value, RSP gets the job done with less classical overhead than teleportation. Several communication-complexity lower-bound proofs (Razborov, Klauck, others) use RSP as a building block to show separations between classical and quantum protocols.

The conceptual lesson: in quantum communication, knowledge is a resource. Classical knowledge of the target state lets Alice tailor her measurement; the tailoring saves classical bits. This is not a trick; it is the structural fact that unitaries on Alice's side translate to basis changes on Bob's side via the shared Bell pair, and so Alice's knowledge "flows" across the pair.

Where this leads next

• Quantum teleportation — the unknown-state sibling of RSP.
• Superdense coding — the classical-bit-sending counterpart.
• Entanglement swapping — the protocol for teleporting entanglement between unconnected parties.
• Measurement in arbitrary bases — the prerequisite for Alice's basis-tailored measurement.
• Quantum communication complexity — the theory that RSP helps delineate.

References

1. C. H. Bennett, D. P. DiVincenzo, P. W. Shor, J. A. Smolin, B. M. Terhal, W. K. Wootters, Remote State Preparation (2001) — arXiv:quant-ph/0006044. The foundational paper.
2. H.-K. Lo, Classical-communication cost in distributed quantum-information processing (1999) — arXiv:quant-ph/9912009. The lower-bound paper.
3. Wikipedia, Remote state preparation — concise summary with further references.
4. John Preskill, Lecture Notes on Quantum Computation, Ch. 4 — theory.caltech.edu/~preskill/ph229. Derivation in a broader information-theoretic setting.
5. Mark Wilde, Quantum Information Theory (open-access textbook) — arXiv:1106.1445. The full resource-trade-off accounting.
6. Qiskit Textbook, Introduction to Quantum Communication Protocols — code for running teleportation and RSP variants on simulators.