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

arXiv:quant-ph/0110112 · Physical Review A

General scheme for superdense coding between multiparties

X. S. Liu, Gui‐Lu Long, D. M. Tong, Feng Li

Published Jan 4, 2002• 470 citations
arXivHTMLPDF

Abstract

Dense coding or superdense coding in the case of high-dimension quantum states between two parties and multiparties is studied in this paper. We construct explicitly the measurement basis and the forms of the single-body unitary operations corresponding to the basis chosen, and the rules for selecting the one-body unitary operations in a multiparty case.

DOI
10.1103/physreva.65.022304

Related papers

Superdense Coding and Multiparty Communication Protocols Using Quantum Systems of Several Levels

Guillermo B. Morales-Luna

We consider high-dimensional quantum states which generalize multivalued logics. Through maximally entangled states, a central part is able to receive 2( n −1) classical bits from n corresponding parts by one two-dimensional qubit from each of them. As a second generalization, we introduce a multiparty protocol for this kind of superdense coding using quantum systems with k quantum levels.

Series on knots and everything•Oct 1, 2023•0 citations

High-capacity three-party quantum secret sharing with superdense coding

Bin Gu, Li Chuan-Qi, Xu Fei +1 more

This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liu et al (2002 Phys. Rev. A 65 022304) and the quantum secret sharing scheme by Deng et al (2008 Phys. Lett. A 372 1957). Instead of using two sets of nonorthogonal states, the boss Alice needs only to prepare a sequence of Einstein–Podolsky–Rosen pairs in d -dimension. The two agents Bob and Charlie encode their information with dense coding unitary operations, and security is checked by inserting decoy photons. The scheme has a high capacity and intrinsic efficiency as each pair can carry 2lb d bits of information, and almost all the pairs can be used for carrying useful information.

Chinese Physics B•Nov 1, 2009•35 citations

Symmetric scheme for superdense coding between multiparties

Andrzej Grudka, Antoni Wójcik

Recently Liu, Long, Tong, and Li [Phys. Rev. A 65, 022304 (2002)] proposed a scheme for superdense coding between multiparties. This scheme seems to be highly asymmetric in the sense that only one sender effectively exploits entanglement. We show that this scheme can be modified in order to allow more senders to benefit from the entanglement-enhanced information transmission.

arXiv:quant-ph/0202159•Physical Review A•Jul 11, 2002•75 citations

Protocol for multi-party superdense coding by using multi-atom in cavity QED

Tan Jia, Mao-Fa Fang

We present a protocol for multi-party superdense coding by using multi-atom in cavity quantum electrodynamics (QED). It is shown that, with a highly detuned cavity mode and a strong driving field, the protocol is insensitive to both cavity decay and thermal field. It is even certain to identify GHZ states via detecting the atomic states. Therefore we can realize the quantum dense coding in a simple way in the multiparty system.

Chinese Physics•Jul 26, 2006•6 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

Distributed Quantum Dense Coding

Dagmar Bruß, Giacomo Mauro D’Ariano, Maciej Lewenstein +3 more

We introduce the notion of distributed quantum dense coding, i.e., the generalization of quantum dense coding to more than one sender and more than one receiver. We show that global operations (as compared to local operations) of the senders do not increase the information transfer capacity, in the case of a single receiver. For the case of two receivers, using local operations and classical communication, a nontrivial upper bound for the capacity is derived. We propose a general classification scheme of quantum states according to their usefulness for dense coding. In the bipartite case (for any dimensions), bound entanglement is not useful for this task.

arXiv:quant-ph/0407037•Physical Review Letters•Nov 19, 2004•181 citations
Dense coding or superdense coding in the case of high-dimension quantum states between two parties and multiparties is studied in this paper. We construct explicitly the measurement basis and the forms of the single-body unitary operations corresponding to the basis chosen, and the rules for selecting the one-body unitary operations in a multiparty case.
This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liu et al (2002 Phys. Rev. A 65 022304) and the quantum secret sharing scheme by Deng et al (2008 Phys. Lett. A 372 1957). Instead of using two sets of nonorthogonal states, the boss Alice needs only to prepare a sequence of Einstein–Podolsky–Rosen pairs in d -dimension. The two agents Bob and Charlie encode their information with dense coding unitary operations, and security is checked by inserting decoy photons. The scheme has a high capacity and intrinsic efficiency as each pair can carry 2lb d bits of information, and almost all the pairs can be used for carrying useful information.
We introduce the notion of distributed quantum dense coding, i.e., the generalization of quantum dense coding to more than one sender and more than one receiver. We show that global operations (as compared to local operations) of the senders do not increase the information transfer capacity, in the case of a single receiver. For the case of two receivers, using local operations and classical communication, a nontrivial upper bound for the capacity is derived. We propose a general classification scheme of quantum states according to their usefulness for dense coding. In the bipartite case (for any dimensions), bound entanglement is not useful for this task.