|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'585
Articles rated: 2609
24 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Perfect Quantum Network Communication Protocol Based on Classical Network Coding | | Hirotada Kobayashi
; Francois Le Gall
; Harumichi Nishimura
; Martin Roetteler
; | | Date: |
8 Feb 2009 | | Abstract: | This paper considers a problem of quantum communication between parties that
are connected through a network of quantum channels. The model in this paper
assumes that there is no prior entanglement shared among any of the parties,
but that classical communication is free. The task is to perfectly transfer an
unknown quantum state from a source subsystem to a target subsystem, where both
source and target are formed by ordered sets of some of the nodes. It is proved
that a lower bound of the rate at which this quantum communication task is
possible is given by the classical min-cut max-flow theorem of network coding,
where the capacities in question are the quantum capacities of the edges of the
network. | | Source: | arXiv, 0902.1299 | | 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