Physics – Quantum Physics
Scientific paper
2001-08-14
J. Math. Phys. 43(9):4341--4352, 2002.
Physics
Quantum Physics
9 pages, revtex4. Added a few references and updated others. Extended discussion a bit
Scientific paper
10.1063/1.1498489
We consider two apparently separated problems: in the first part of the paper we study the concept of a scalable (approximate) programmable quantum gate (SPQG). These are special (approximate) programmable quantum gates, with nice properties that could have implications on the theory of universal computation. Unfortunately, as we prove, such objects do not exist in the domain of usual quantum theory. In the second part the problem of noisy dense coding (and generalizations) is addressed. We observe that the additivity problem for the classical capacity obtained is of apparently greater generality than for the usual quantum channel (completely positive maps): i.e., the latter occurs as a special case of the former, but, as we shall argue with the help of the non-existence result of the first part, the former cannot be reduced to an instance of the latter. We conclude by suggesting that the additivity problem for the classical capacity of quantum channels, as posed until now, may conceptually not be in its appropriate generality.
No associations
LandOfFree
Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels 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 Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-76153