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

Quantum Information Processing

A scheme for remote state preparation of a general pure qubit with optimized classical communication cost

Congyi Hua, Yi-Xin Chen

Published Dec 10, 2014• 14 citations
Publisher
DOI
10.1007/s11128-014-0897-5

Related papers

Classical communication cost and probabilistic remote two-qubit state preparation via POVM and W-type states

Zhang-Yin Wang

Quantum Information Processing•Oct 28, 2011•14 citations

Classical Communication Cost and Remote Preparation of Multi-qubit with Three-Party

Dai, Hong-Yi, Zhang +3 more

理论物理通讯：英文版•Jan 1, 2008•13 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

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

Congyi Hua, Yixin Chen

arXiv:1604.08707•Quantum Information Processing•Aug 20, 2016•6 citations

Optimizing classical communication in remote preparation of a general pure qubit

Congyi Hua, Yixin Chen

How to uses shared entanglement and forward classical communication to remotely prepare an arbitrary (mixed or pure) state has been fascinating quantum information scientists. A constructive scheme has been given by Berry for remotely preparing a general pure state with a pure entangled state and finite classical communication. Based on this scheme, for high-dimensional systems it is possible to use a coding of the target state to optimize the classical communication cost. Unfortunately, for low-dimensional systems such as a pure qubit the coding method is inapplicable. Because qubit plays a central role in quantum information theory, we propose an optimization procedure which can be used to minimize the classical communication cost in the remote preparation of a general pure qubit. Interestingly, our optimization procedure is linked to the uniform arrangement of $N$ points on the Bloch sphere, which provides a geometric description.

arXiv:1405.5309•May 21, 2014•0 citations

Optimizing scheme for probabilistic remote preparation of a two-qubit state

Jia-fan Xia, Xin-Wei Zha

中国邮电高校学报：英文版•Dec 1, 2013•1 citation
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.
How to uses shared entanglement and forward classical communication to remotely prepare an arbitrary (mixed or pure) state has been fascinating quantum information scientists. A constructive scheme has been given by Berry for remotely preparing a general pure state with a pure entangled state and finite classical communication. Based on this scheme, for high-dimensional systems it is possible to use a coding of the target state to optimize the classical communication cost. Unfortunately, for low-dimensional systems such as a pure qubit the coding method is inapplicable. Because qubit plays a central role in quantum information theory, we propose an optimization procedure which can be used to minimize the classical communication cost in the remote preparation of a general pure qubit. Interestingly, our optimization procedure is linked to the uniform arrangement of NNN points on the Bloch sphere, which provides a geometric description.