Generalized quantum counting algorithm for non-uniform amplitude distribution
- 159 Downloads
We give generalized quantum counting algorithm to increase universality of quantum counting algorithm. Non-uniform initial amplitude distribution is possible due to the diversity of situations on counting problems or external noise in the amplitude initialization procedure. We give the reason why quantum counting algorithm is invalid on this situation. By modeling in three-dimensional space spanned by unmarked state, marked state and free state to the entire Hilbert space of n qubits, we find Grover iteration can be regarded as improper rotation in the space. This allows us to give formula to solve counting problem. Furthermore, we express initial amplitude distribution in the eigenvector basis of improper rotation matrix. This is necessary to obtain mathematical analysis of counting problem on various situations. Finally, we design four simulation experiments, the results of which show that compared with original quantum counting algorithm, generalized quantum counting algorithm wins great satisfaction from three aspects: (1) Whether initial amplitude distribution is uniform; (2) the diversity of situations on counting problems; and (3) whether phase estimation technique can get phase exactly.
KeywordsQuantum counting algorithm Non-uniform Grover iteration Three-dimensional space Improper rotation Eigenvector
This work is supported by the National Natural Science Foundation of China (Grant Nos. 61170321,61502101), Natural Science Foundation of Jiangsu Province, China (Grant No. BK20140651), Natural Science Foundation of Anhui Province, China (Grant No. 1708085MF162), Research Fund for the Doctoral Program of Higher Education (Grant No. 20110092110024), Foundation for Natural Science Foundation of Jiangsu Province, China (Grant No. BK20140823) and the open fund of Key Laboratory of Computer Network and Information Integration in Southeast University, Ministry of Education, China (Grant No. K93-9-2015-10C).
- 1.Brassard, G., Hoyer, P., Tapp, A.: Quantum counting. arXiv preprint arXiv:quant-ph/9805082 (1998)
- 4.Boyer, M., Brassard, G., Hoyer, P., Tapp, A.: Tight bounds on quantum searching. arXiv preprint arXiv:quant-ph/9605034 (1996)
- 5.Mosca, M., et al.: Quantum searching, counting and amplitude amplification by eigenvector analysis. Mfcs’98 Workshop on Randommized Algorithms (1998)Google Scholar
- 9.Morawiec, A.: Orientations and Rotations, Chapter Preliminaries. Springer, Berlin (2003)Google Scholar
- 11.Grover, L.K.: A fast quantum mechanical algorithm for database search. Annual Acm Symposium on Theory of Computing (1996)Google Scholar
- 13.Kitaev, A.Y.: Quantum measurements and the abelian stabilizer problem. arXiv preprint arXiv:quant-ph/9511026 (1995)
- 14.Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences (1998)Google Scholar
- 15.Mosca, M.: Quantum Computer Algorithms. Ph.D. Thesis, Oxford University Press (1999)Google Scholar
- 16.Brassard, G., Hoyer, P.: An exact quantum polynomial-time algorithm for Simon’s problem. Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems (1997)Google Scholar