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.
Quantum Information Processing – Springer Journals
Published: Jan 25, 2017
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud