This paper addresses the quantum minimum searching algorithm and provides simulation results using qiskit library by IBM Q. We propose a whole procedure to implement the quantum minimum searching algorithm with high a...
详细信息
ISBN:
(纸本)9781728167589
This paper addresses the quantum minimum searching algorithm and provides simulation results using qiskit library by IBM Q. We propose a whole procedure to implement the quantum minimum searching algorithm with high accuracy and design a quantum circuit for 5-qubit searching. The circuit consists of several oracles(phase inverter) and Grover operators(amplifier) and a comparator. To implement 5-qubit searching, we suggest three things. Modifying the expected number of iterations described in Section II.C, applying the concept of QRAM as an interface between quantum data and classical data in Section II.D, and designing quantum comparator using constant adder by Thomas in 2017 in Section III.A.
Finding a minimum is a fundamental calculation in many quantum ***,challenges are faced in demonstrating it effectively in real quantum *** practice,the number of solutions is unknown,and there is no universal encodin...
详细信息
Finding a minimum is a fundamental calculation in many quantum ***,challenges are faced in demonstrating it effectively in real quantum *** practice,the number of solutions is unknown,and there is no universal encoding *** that,current quantum computers have limited *** alleviate these problems,this paper proposes a general quantumminimumsearching *** adaptive estimation method is adopted to calculate the number of solutions,and a quantum encoding circuit for arbitrary databases is presented for the first time,which improves the universality of the algorithm and helps it achieve a nearly 100%success rate in a series of random ***,gate complexity is reduced by our simplified Oracle,and the realizability of the algorithm is verified on a superconducting quantum *** algorithm can serve as a subroutine for various quantumalgorithms to promote their implementation in the Noisy IntermediateScale quantum era.
Finding a minimum is an essential part of mathematical models, and it plays an important role in some optimization problems. Durr and Hoyer proposed a quantumsearchingalgorithm (DHA), with a certain probability of s...
详细信息
Finding a minimum is an essential part of mathematical models, and it plays an important role in some optimization problems. Durr and Hoyer proposed a quantumsearchingalgorithm (DHA), with a certain probability of success, to achieve quadratic speed than classical ones. In this paper, we propose an optimized quantum minimum searching algorithm with sure-success probability, which utilizes Grover-Long searching to implement the optimal exact searching, and the dynamic strategy to reduce the iterations of our algorithm. Besides, we optimize the oracle circuit to reduce the number of gates by the simplified rules. The performance evaluation including the theoretical success rate and computational complexity shows that our algorithm has higher accuracy and efficiency than DHA algorithm. Finally, a simulation experiment based on Cirq is performed to verify its feasibility.
暂无评论