New analysis eliminates a potential speed bump in quantum computing
San Diego CA (SPX) May 23, 2014 - A quantum particle can search for an item in an unsorted "database" by jumping from one item to another in superposition, and it does so faster than a classical computer ever could. This assertion assumes, however, that the particle can directly hop from any item to any other. Any restriction on which items the particle can directly hop to could slow down the search. "Intuition says ... more
No comments:
Post a Comment