Quantum Computer Algorithm for Parity Determination Based on Quantum Counting |
| |
| Authors: | Hong-Fu Wang and Shou Zhang |
| |
| Institution: | (1) Center for the Condensed-Matter Science and Technology, Harbin Institute of Technology, Harbin, Heilongjiang, 150001, People’s Republic of China;(2) Department of Physics, College of Science, Yanbian University, Yanji, Jilin, 133002, People’s Republic of China |
| |
| Abstract: | A new quantum computer algorithm is proposed for determining the parity of function f(x) by using quantum counting algorithm. The parity of function f(x) can be determined by counting exactly the number of satisfying f(x)=−1, which is equivalent to determine the number of solutions, M, to an N item search problem. The algorithm can be accomplished in time of order
. |
| |
| Keywords: | Parity determination Quantum computer Quantum counting |
| 本文献已被 SpringerLink 等数据库收录！ |
|
