A New Searching Problem Solved by Quantum Computers
YAN Hai-Yang
Department of Physics, Tsinghua University, Beijing 100084
Key Laboratory for Quantum Information and Measurements, Ministry of Education of China, Beijing 100084
A New Searching Problem Solved by Quantum Computers
YAN Hai-Yang
Department of Physics, Tsinghua University, Beijing 100084
Key Laboratory for Quantum Information and Measurements, Ministry of Education of China, Beijing 100084
Abstract： It is well known that a quantum computer can search more quickly than a classical computer in solving the so-called Grover-searching problem. We present a new searching problem which cannot be classified into Grover's problem and can be solved by using the modified searching iterations with the same efficiency of Grover's problem.
(Quantum computation architectures and implementations)
引用本文:
YAN Hai-Yang. A New Searching Problem Solved by Quantum Computers[J]. 中国物理快报, 2002, 19(4): 460-462.
YAN Hai-Yang. A New Searching Problem Solved by Quantum Computers. Chin. Phys. Lett., 2002, 19(4): 460-462.
2002, Vol. 19 
