Abstract
The quantum Fourier transform is a key factor in achieving exponential speedup relative to classical algorithms. We implemented the phase estimation algorithm, which is the very basic application example of the quantum Fourier transform, on a three-bit nuclear magnetic resonance quantum-information processor. The algorithm was applied to one-bit Grover operators to estimate eigenvalues. We also demonstrated the counting algorithm with the same operators to obtain the number of the marked states. The results of projective measurements required by the algorithms were obtained from the split peak positions in the spectra.
Sign-in/Register to access full text options 
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.
