Skip to main content
archive Search
Submit Donate Log in

Press Enter to search · Advanced search

Quantum Physics

arXiv:1703.00804 (quant-ph)
[Submitted on 2 Mar 2017]

Title:Optimal probabilistic dense coding schemes

Authors:Roger Alfredo Kögler, Leonardo Neves
View a PDF of the paper titled Optimal probabilistic dense coding schemes, by Roger Alfredo K\"ogler and Leonardo Neves
View PDF HTML (experimental)
Abstract:Dense coding with non-maximally entangled states has been investigated in many different scenarios. We revisit this problem for protocols adopting the standard encoding scheme. In this case, the set of possible classical messages cannot be perfectly distinguished due to the non-orthogonality of the quantum states carrying them. So far, the decoding process has been approached in two ways: (i) The message is always inferred, but with an associated (minimum) error; (ii) the message is inferred without error, but only sometimes; in case of failure, nothing else is done. Here, we generalize on these approaches and propose novel optimal probabilistic decoding schemes. The first uses quantum-state separation to increase the distinguishability of the messages with an optimal success probability. This scheme is shown to include (i) and (ii) as special cases and continuously interpolate between them, which enables the decoder to trade-off between the level of confidence desired to identify the received messages and the success probability for doing so. The second scheme, called multistage decoding, applies only for qudits ($d$-level quantum systems with $d>2$) and consists of further attempts in the state identification process in case of failure in the first one. We show that this scheme is advantageous over (ii) as it increases the mutual information between the sender and receiver.
Comments: 18 pages, 8 figures
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:1703.00804 [quant-ph]
  (or arXiv:1703.00804v1 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.1703.00804
arXiv-issued DOI via DataCite
Journal reference: Quantum Inf. Process. 16, 92 (2017)
Related DOI: https://doi.org/10.1007/s11128-017-1545-7
DOI(s) linking to related resources

Submission history

From: Roger Alfredo Kögler [view email]
[v1] Thu, 2 Mar 2017 14:40:38 UTC (2,268 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Optimal probabilistic dense coding schemes, by Roger Alfredo K\"ogler and Leonardo Neves
  • View PDF
  • HTML (experimental)
  • TeX Source
view license

Current browse context:

quant-ph
< prev   |   next >
new | recent | 2017-03

References & Citations

  • INSPIRE HEP
  • SciX
  • Google Scholar
  • Semantic Scholar
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)