Journal
PHYSICAL REVIEW LETTERS
Volume 85, Issue 25, Pages 5448-5451Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.85.5448
Keywords
-
Categories
Ask authors/readers for more resources
By considering quantum computation as a communication process, we relate its efficiency to its classical communication capacity. This formalism allows us to derive lower bounds on the complexity of search algorithms in the most general context. It enables us to link the mixedness of a quantum computer to its efficiency and also allows us to derive the critical level. of mixedness beyond which there is no quantum advantage in computation.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available