Efficient quantum communication under collective noise

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages, e figures and 2 appendices. Comments are welcomed

Scientific paper

We introduce a new quantum communication protocol for the transmission of quantum information under collective noise. Our protocol utilizes a decoherence-free subspace in such a way that an optimal asymptotic transmission rate is achieved, while at the same time encoding and decoding operations can be efficiently implemented. The encoding and decoding circuit requires a number of elementary gates that scale linearly with the number of transmitted qudits, m. The logical depth of our encoding and decoding operations is constant and depends only on the channel in question. For channels described by an arbitrary discrete group G, i.e. with a discrete number, |G|, of possible noise operators, perfect transmission at a rate m/(m+r) is achieved with an overhead that scales at most as $\mathcal{O}(d^r)$ where the number of auxiliary qudits, r, depends solely on the group in question. Moreover, this overhead is independent of the number of transmitted qudits, m. For certain groups, e.g. cyclic groups, we find that the overhead scales only linearly with the number of group elements |G|.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Efficient quantum communication under collective noise 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 Efficient quantum communication under collective noise, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient quantum communication under collective noise will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-31782

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.