General criterion for oblivious remote state preparation

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 novel 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 non-maximally 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.

5 pages, RevTeX

References in corpus (11)

• Remote State Preparation
• Minimum cbits for remote preperation and measurement of a qubit
• Faithful remote state preparation using finite classical bits and a non-maximally entangled state
• Oblivious remote state preparation
• Low-Entanglement Remote State Preparation
• Remote state preparation in higher dimension and the parallelizable manifold $S^{n-1}$
• Remote preparation of quantum states
• Continuous variable remote state preparation
• Generalized remote state preparation: Trading cbits, qubits and ebits in quantum communication
• Remote State Preparation without Oblivious Conditions
• Resources required for exact remote state preparation

Cited by in corpus (5)

• Minimal classical communication and measurement complexity for quantum information splitting
• Generalized Remote Preparation of Arbitrary $m$-qubit Entangled States via Genuine Entanglements
• Generalized Quantum Telecloning
• Remote preparation for single-photon state in two degrees of freedom with hyper-entangled states
• Two-step deterministic remote preparation of an arbitrary quantum state in the whole Hilbert space