A Non-Oracle Quantum Search Algorithm and Its Experimental Implementation
Nanyang Xu, Jin Zhu, Xinhua Peng, Xianyi Zhou, and Jiangfeng Du

TL;DR
This paper introduces a new adiabatic quantum search algorithm that does not rely on an Oracle, capable of handling multiple solutions, and demonstrates its implementation on an NMR quantum computer, marking a first in real quantum database search.
Contribution
The paper presents a non-Oracle adiabatic quantum search algorithm applicable to multiple solutions and provides the first experimental implementation on an NMR quantum computer.
Findings
Successful implementation of the algorithm on NMR quantum computer
Algorithm handles both single and multiple solutions without modification
First real quantum database search experiment
Abstract
Grover's algorithm has achieved great success. But quantum search algorithms still are not complete algorithms because of Grover's Oracle. We concerned on this problem and present a new quantum search algorithm in adiabatic model without Oracle. We analyze the general difficulties in quantum search algorithms and show how to solve them in the present algorithm. As well this algorithm could deal with both single-solution and multi-solution searches without modification. We also implement this algorithm on NMR quantum computer. It is the first experiment which perform a real quantum database search rather than a marked-state search.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
