Physics – Quantum Physics
Scientific paper
2009-08-11
Physics
Quantum Physics
12 pages, 2 figures, generalizes some of the results in arXiv:0902.1299 to the k-pair problem and codes over rings. Appeared i
Scientific paper
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is impossible even for the simple butterfly network. As additional resource we allow free classical communication between any pair of network nodes. It is shown that perfect quantum network coding is achievable in this model whenever classical network coding is possible over the same network when replacing all quantum capacities by classical capacities. More precisely, it is proved that perfect quantum network coding using free classical communication is possible over a network with $k$ source-target pairs if there exists a classical linear (or even vector linear) coding scheme over a finite ring. Our proof is constructive in that we give explicit quantum coding operations for each network node. This paper also gives an upper bound on the number of classical communication required in terms of $k$, the maximal fan-in of any network node, and the size of the network.
Gall François Le
Kobayashi Hirotada
Nishimura Harumichi
Roetteler Martin
No associations
LandOfFree
General Scheme for Perfect Quantum Network Coding with Free Classical Communication does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with General Scheme for Perfect Quantum Network Coding with Free Classical Communication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and General Scheme for Perfect Quantum Network Coding with Free Classical Communication will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-164329