S. Iriyama, M. Ohya, I. V. Volovich
Published 2013-06-21Version 1
A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time.
Comments: 8 pages, no figures
Quantum CPU and Quantum Algorithm
Computational Complexity and the Nature of Quantum Mechanics
On Quantum Algorithms for Noncommutative Hidden Subgroups
![QR code for arXiv:1306.5039 [quant-ph]](http://oss.arxitics.com/images/favicon.svg)