We present the analog analogue of Grover's problem as an example of the time-independent Hamiltonian for applying the speed limit of the imaginary-time Schrödinger equation derived by Okuyama and Ohzeki and t...We present the analog analogue of Grover's problem as an example of the time-independent Hamiltonian for applying the speed limit of the imaginary-time Schrödinger equation derived by Okuyama and Ohzeki and the new class of energy-time uncertainty relation proposed by Kieu. It is found that the computational time of the imaginary-time quantum annealing of this Grover search can be exponentially small, while the counterpart of the quantum evolution driven by the real-time Schrödinger equation could only provide square root speedup, compared with classic search. The present results are consistent with the cases of the time-dependent quantum evolution of the natural Grover problem in previous works. We once again emphasize that the logarithm and square root algorithmic performances are generic in imaginary-time quantum annealing and quantum evolution driven by real-time Schrödinger equation, respectively. Also, we provide evidences to search deep reasons why the imaginary-time quantum annealing can lead to exponential speedup and the real-time quantum annealing can make square root speedup.展开更多
The continuous top-t most influential place (CTtMIP) query is defined formally and solved efficiently in this paper. A CTtMIP query continuously monitors the t places with the maximum influence from the set of place...The continuous top-t most influential place (CTtMIP) query is defined formally and solved efficiently in this paper. A CTtMIP query continuously monitors the t places with the maximum influence from the set of places, where the influence of a place is defined as the number of its bichromatic reverse k nearest neighbors (BRkNNs). Two new metrics and their corresponding rules are introduced to shrink the search region and reduce the candidates of BRkNNs checked. Extensive experiments confirm that our proposed approach outperforms the state-of-the-art competitor significantly.展开更多
基金Project supported by the China Postdoctoral Science Foundation (Grant No. 2017M620322)the Priority Fund for the Postdoctoral Scientific and Technological Program of Hubei Province in 2017, the Seed Foundation of Huazhong University of Science and Technology (Grant No. 2017KFYXJJ070)the Science and Technology Program of Shenzhen of China (Grant No. JCYJ 20180306124612893).
文摘We present the analog analogue of Grover's problem as an example of the time-independent Hamiltonian for applying the speed limit of the imaginary-time Schrödinger equation derived by Okuyama and Ohzeki and the new class of energy-time uncertainty relation proposed by Kieu. It is found that the computational time of the imaginary-time quantum annealing of this Grover search can be exponentially small, while the counterpart of the quantum evolution driven by the real-time Schrödinger equation could only provide square root speedup, compared with classic search. The present results are consistent with the cases of the time-dependent quantum evolution of the natural Grover problem in previous works. We once again emphasize that the logarithm and square root algorithmic performances are generic in imaginary-time quantum annealing and quantum evolution driven by real-time Schrödinger equation, respectively. Also, we provide evidences to search deep reasons why the imaginary-time quantum annealing can lead to exponential speedup and the real-time quantum annealing can make square root speedup.
基金Supported by the National Natural Science Foundation of China (61003049)the Natural Science Foundation of Zhejiang Province (Y110278, 2010QNA5051)Zheda Zijin Plan
文摘The continuous top-t most influential place (CTtMIP) query is defined formally and solved efficiently in this paper. A CTtMIP query continuously monitors the t places with the maximum influence from the set of places, where the influence of a place is defined as the number of its bichromatic reverse k nearest neighbors (BRkNNs). Two new metrics and their corresponding rules are introduced to shrink the search region and reduce the candidates of BRkNNs checked. Extensive experiments confirm that our proposed approach outperforms the state-of-the-art competitor significantly.