Journal
PHYSICAL REVIEW LETTERS
Volume 85, Issue 22, Pages 4815-4818Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.85.4815
Keywords
-
Categories
Ask authors/readers for more resources
Quantum computing by nuclear magnetic resonance using pseudopure spin states is bound by the maximal speed of quantum computing algorithms operating on pure states. In contrast to these quantum computing algorithms, a novel algorithm for searching an unsorted database is presented here that operates on truly mixed states in spin Liouville space. It provides an exponential speedup over Grover's quantum search algorithm with the sensitivity scaling exponentially with the number of spins, as for pseudopure state implementations. The minimal decoherence time required is exponentially shorter than that for Grover's algorithm.
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