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 \(\Theta(\sqrt{k(N-k)})\) .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
