Deterministic remote preparation of an arbitrary qubit state using a partially entangled state and finite classical communication

TL;DR

This paper introduces a deterministic remote state preparation scheme for arbitrary qubits using partially entangled states and finite classical communication, improving efficiency and versatility over previous methods.

Contribution

It presents the first RSP scheme capable of preparing arbitrary mixed and pure qubits with reduced classical communication and the ability to switch to teleportation seamlessly.

Findings

Saves approximately 1 classical bit per qubit compared to prior schemes.

Achieves classical communication cost of 2 bits with maximally entangled states, aligning with theoretical conjectures.

Enables switching between RSP and teleportation without revealing to the receiver.

Abstract

We propose a deterministic remote state preparation (RSP) scheme for preparing an arbitrary (including pure and mixed) qubit, where a partially entangled state and finite classical communication are used. To our knowledge, our scheme is the first RSP scheme that fits into this category. One other RSP scheme proposed by Berry shares close features, but can only be used to prepare an arbitrary pure qubit. Even so, our scheme saves classical communication by approximate 1 bit per prepared qubit under equal conditions. When using a maximally entangled state, the classical communication for our scheme is 2 bits, which agrees with Lo's conjecture on the resource cost. Furthermore Alice can switch between our RSP scheme and a standard teleportation scheme without letting Bob know, which makes the quantum channel multipurpose.