Finding a minimum is a fundamental calculation in many quantum algorithms.However,challenges are faced in demonstrating it effectively in real quantum computers.In practice,the number of solutions is unknown,and there...Finding a minimum is a fundamental calculation in many quantum algorithms.However,challenges are faced in demonstrating it effectively in real quantum computers.In practice,the number of solutions is unknown,and there is no universal encoding method.Besides that,current quantum computers have limited resources.To alleviate these problems,this paper proposes a general quantum minimum searching algorithm.An 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 databases.Moreover,gate complexity is reduced by our simplified Oracle,and the realizability of the algorithm is verified on a superconducting quantum computer.Our algorithm can serve as a subroutine for various quantum algorithms to promote their implementation in the Noisy IntermediateScale Quantum era.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.62074116,61874079,and 81971702)the Luojia Young Scholars Program。
文摘Finding a minimum is a fundamental calculation in many quantum algorithms.However,challenges are faced in demonstrating it effectively in real quantum computers.In practice,the number of solutions is unknown,and there is no universal encoding method.Besides that,current quantum computers have limited resources.To alleviate these problems,this paper proposes a general quantum minimum searching algorithm.An 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 databases.Moreover,gate complexity is reduced by our simplified Oracle,and the realizability of the algorithm is verified on a superconducting quantum computer.Our algorithm can serve as a subroutine for various quantum algorithms to promote their implementation in the Noisy IntermediateScale Quantum era.
