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

Communications in Theoretical Physics

Quantum Dense Coding Without Joint Measurement

Fang Xian-Mei, Gao Xiao-Bo, Zhuo‐Liang Cao

Published Jul 1, 2009• 2 citations
Publisher

Abstract

We propose two schemes for quantum dense coding without Bell states measurement. One is deterministic, the other is probabilistic. In the deterministic scheme, the initial entangled state will be not destructed. In the probabilistic scheme, the initial unknown nonmaximal entangled state will be transformed into a maximal entangled one. Our schemes require two auxiliary particles and perform single-qubit measurements on them. Thus our schemes are simple and economic.

DOI
10.1088/0253-6102/52/1/07

Related papers

Deterministic dense coding with partially entangled states

Shay Mozes, Jonathan Oppenheim, Benni Reznik

The utilization of a $d$-level partially entangled state, shared by two parties wishing to communicate classical information without errors over a noiseless quantum channel, is discussed. We analytically construct deterministic dense coding schemes for certain classes of nonmaximally entangled states, and numerically obtain schemes in the general case. We study the dependency of the maximal alphabet size of such schemes on the partially entangled state shared by the two parties. Surprisingly, for $d>2$ it is possible to have deterministic dense coding with less than one ebit. In this case the number of alphabet letters that can be communicated by a single particle is between $d$ and $2d$. In general, we numerically find that the maximal alphabet size is any integer in the range $[d,{d}^{2}]$ with the possible exception of ${d}^{2}\ensuremath{-}1$. We also find that states with less entanglement can have a greater deterministic communication capacity than other more entangled states.

arXiv:quant-ph/0403189•Physical Review A•Jan 7, 2005•74 citations

Probabilistic Dense Coding Using Non-Maximally Entangled Three-Particle States

Zhang Guo-hua, Yan Feng-Li

We present a scheme for probabilistic dense coding via quantum channels of non-maximally entangled three-particle states. Quantum dense coding will succeed with a certain probability if the sender introduces an auxiliary particle and performs a collective unitary transformation. The average information transmitted in this scheme is calculated.

Chinese Physics Letters•Sep 1, 2009•4 citations

Probabilistic Dense Coding Using Non-Maximally Entangled Three-Particle State

Zhang Guo-hua, Yan Feng-Li

We present a scheme of probabilistic dense coding via a quantum channel of non-maximally entangled three-particle state. The quantum dense coding will be succeeded with a certain probability if the sender introduces an auxiliary particle and performs a collective unitary transformation. Furthermore, the average information transmitted in this scheme is calculated.

arXiv:0902.3711•Feb 21, 2009•0 citations

Probabilistic Dense Coding Using Non-maximally Entangled State Between Multiparticles

Mei Wang

A scheme for probabilistic dense coding between multiparties by an N+1particle nonmaximally entangled state is proposed.By introducing an auxiliary particle and performing a collective unitary operation, quantum dense coding will be succeeded with certain probability.

Journal of Hebei Normal University•Jan 1, 2003•0 citations

Probabilistic Dense Coding for Multi-communications with Non-maximally Entangled State

Ren Shijie, Xin Su

Probabilistic dense coding in the case of three energy-level non-maximally quantum entangled states between three parties has been investigated in this paper. By introducing an auxiliary particle and performing a collective unitary operation, dense coding of non-maximally entangled state is succeeded with certain probability. The coding scheme for multi-communications between N+1-parties is generalized by partly entangled state.

•Jan 1, 2009•0 citations

Probabilistic Dense Coding Using Three-level Non-maximally Entangled State between Multiparticles

Su Jie

The scheme for dense coding by maximally and partly entangled three-level state between three particles are given in detail.By introducing an auxiliary particle and performing a collective unitary operation,dense coding of partly entangled state will be succeeded with certain probability.The scheme for probabilistic dense coding between multiparticles by an N+1-particle partly entangled state is generalized.The average capacity of those schemes are calculated and compared with the two-level’s.

Journal of Liaocheng University•Jan 1, 2008•0 citations
We propose two schemes for quantum dense coding without Bell states measurement. One is deterministic, the other is probabilistic. In the deterministic scheme, the initial entangled state will be not destructed. In the probabilistic scheme, the initial unknown nonmaximal entangled state will be transformed into a maximal entangled one. Our schemes require two auxiliary particles and perform single-qubit measurements on them. Thus our schemes are simple and economic.
The utilization of a ddd-level partially entangled state, shared by two parties wishing to communicate classical information without errors over a noiseless quantum channel, is discussed. We analytically construct deterministic dense coding schemes for certain classes of nonmaximally entangled states, and numerically obtain schemes in the general case. We study the dependency of the maximal alphabet size of such schemes on the partially entangled state shared by the two parties. Surprisingly, for d>2d>2d>2 it is possible to have deterministic dense coding with less than one ebit. In this case the number of alphabet letters that can be communicated by a single particle is between ddd and 2d2d2d. In general, we numerically find that the maximal alphabet size is any integer in the range [d,d2][d,{d}^{2}][d,d2] with the possible exception of ${d}^{2}\ensuremath{-}1$. We also find that states with less entanglement can have a greater deterministic communication capacity than other more entangled states.