|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Violating the Shannon capacity of metric graphs with entanglement | | Jop Briet
; Harry Buhrman
; Dion Gijswijt
; | | Date: |
7 Jul 2012 | | Abstract: | The Shannon capacity of a graph G is the maximum asymptotic rate at which
messages can be sent with zero probability of error through a noisy channel
with confusability graph G. This extensively studied graph parameter disregards
the fact that on atomic scales, Nature behaves in line with quantum mechanics.
Entanglement, arguably the most counterintuitive feature of the theory, turns
out to be a useful resource for communication across noisy channels. Recently,
Leung, Mancinska, Matthews, Ozols and Roy [Comm. Math. Phys. 311, 2012]
presented two examples of graphs whose Shannon capacity is strictly less than
the capacity attainable if the sender and receiver have entangled quantum
systems. Here we give new, possibly infinite, families of graphs for which the
entangled capacity exceeds the Shannon capacity. | | Source: | arXiv, 1207.1779 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER