DENSE CODING WITH MULTIPARTITE QUANTUM STATES
From MaRDI portal
Publication:5484917
DOI10.1142/S0219749906001888zbMATH Open1098.81016arXivquant-ph/0507146OpenAlexW2131069158WikidataQ57640823 ScholiaQ57640823MaRDI QIDQ5484917FDOQ5484917
Authors: M. Lewenstein, Ujjwal Sen, Chiara Macchiavello, D. Bruß, Aditi Sen, Giacomo Mauro D'Ariano 
Publication date: 21 August 2006
Published in: International Journal of Quantum Information (Search for Journal in Brave)
Abstract: We consider generalisations of the dense coding protocol with an arbitrary number of senders and either one or two receivers, sharing a multiparty quantum state, and using a noiseless channel. For the case of a single receiver, the capacity of such information transfer is found exactly. It is shown that the capacity is not enhanced by allowing the senders to perform joint operations. We provide a nontrivial upper bound on the capacity in the case of two receivers. We also give a classification of the set of all multiparty states in terms of their usefulness for dense coding. We provide examples for each of these classes, and discuss some of their properties.
Full work available at URL: https://arxiv.org/abs/quant-ph/0507146
Recommendations
Cites Work
- Unextendible product bases, uncompletable product bases and bound entanglement
- The capacity of the quantum channel with general signal states
- Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Mixed-State Entanglement and Distillation: Is there a “Bound” Entanglement in Nature?
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Optimal dense coding with mixed state entanglement
- Conditional entropies and their relation to entanglement criteria
- Limitation on the Amount of Accessible Information in a Quantum Channel
- Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels
Cited In (25)
- Optimal super dense coding over noisy quantum channels
- When quantum memory is useful for dense coding
- Theory behind quantum error correcting codes: an overview
- Generation of optical-photon-and-magnon entanglement in an optomagnonics-mechanical system
- Bidirectional and cyclic quantum dense coding in a high-dimension system
- Optimal dense coding in a two-qubit Heisenberg XXZ model with decoherence
- Controlled dense coding with four-particle entangled state
- Simultaneous dense coding
- On quantum advantage in dense coding
- Superdense coding with multi-particle GHZ state via local measurement
- Optimal probabilistic dense coding schemes
- Study of controlled dense coding with some discrete tripartite and quadripartite states
- Deterministic quantum dense coding networks
- QUANTUM SECURE DIRECT COMMUNICATION USING A SIX-QUBIT MAXIMALLY ENTANGLED STATE WITH DENSE CODING
- Generalized controlled dense coding with maximally entangled multiqubit states
- Beating no-go theorems by engineering defects in quantum spin models
- Quantum network dense coding via continuous-variable graph states
- Optimal dense coding with mixed state entanglement
- Probabilistic dense coding using a non-symmetric multipartite quantum channel
- Hyperdense coding and superadditivity of classical capacities in hypersphere theories
- Distributed compression and multiparty squashed entanglement
- Conditions for bipartite general Bell states
- Dense coding with nonmaximally entangled cluster state via local measurement
- Secure simultaneous dense coding using \(\chi \)-type entangled state
- Quantum illumination with noisy probes: conditional advantages of non-Gaussianity
This page was built for publication: DENSE CODING WITH MULTIPARTITE QUANTUM STATES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5484917)
