For the unsorted database quantum search with the unknown fraction λ of target items, there are mainly two kinds of methods, i.e., fixed-point and trail-and-error.(i) In terms of the fixed-point method, Yoder et al. ...For the unsorted database quantum search with the unknown fraction λ of target items, there are mainly two kinds of methods, i.e., fixed-point and trail-and-error.(i) In terms of the fixed-point method, Yoder et al. [Phys. Rev. Lett.113 210501(2014)] claimed that the quadratic speedup over classical algorithms has been achieved. However, in this paper, we point out that this is not the case, because the query complexity of Yoder’s algorithm is actually in O(1/λ01/2)rather than O(1/λ1/2), where λ0 is a known lower bound of λ.(ii) In terms of the trail-and-error method, currently the algorithm without randomness has to take more than 1 times queries or iterations than the algorithm with randomly selected parameters. For the above problems, we provide the first hybrid quantum search algorithm based on the fixed-point and trail-and-error methods, where the matched multiphase Grover operations are trialed multiple times and the number of iterations increases exponentially along with the number of trials. The upper bound of expected queries as well as the optimal parameters are derived. Compared with Yoder’s algorithm, the query complexity of our algorithm indeed achieves the optimal scaling in λ for quantum search, which reconfirms the practicality of the fixed-point method. In addition, our algorithm also does not contain randomness, and compared with the existing deterministic algorithm, the query complexity can be reduced by about 1/3. Our work provides a new idea for the research on fixed-point and trial-and-error quantum search.展开更多
A new method that stabilizes network-based systems with both bounded delay and packet disordering is discussed under the state feedback controller. A novel model, fully describing the dynamic characteristic of network...A new method that stabilizes network-based systems with both bounded delay and packet disordering is discussed under the state feedback controller. A novel model, fully describing the dynamic characteristic of network-based systems with packet disordering, is constructed. Different from the existing models of network-based systems, the number of delay items is time-varying in the model proposed. Further, this model is converted into a parameter-uncertain discrete-time system with time-varying delay item numbers in terms of matrix theory. Moreover, the less conservative stability condition is obtained by avoiding utilisation of Moon et al.’ inequality and bounding inequalities for quadratic functional terms. By solving a minization problem based on linear matrix inequalities, the state feedback controller is presented. A numerical example is given to illustrate the effectiveness of the proposed method.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11504430 and 61502526)the National Basic Research Program of China(Grant No.2013CB338002)
文摘For the unsorted database quantum search with the unknown fraction λ of target items, there are mainly two kinds of methods, i.e., fixed-point and trail-and-error.(i) In terms of the fixed-point method, Yoder et al. [Phys. Rev. Lett.113 210501(2014)] claimed that the quadratic speedup over classical algorithms has been achieved. However, in this paper, we point out that this is not the case, because the query complexity of Yoder’s algorithm is actually in O(1/λ01/2)rather than O(1/λ1/2), where λ0 is a known lower bound of λ.(ii) In terms of the trail-and-error method, currently the algorithm without randomness has to take more than 1 times queries or iterations than the algorithm with randomly selected parameters. For the above problems, we provide the first hybrid quantum search algorithm based on the fixed-point and trail-and-error methods, where the matched multiphase Grover operations are trialed multiple times and the number of iterations increases exponentially along with the number of trials. The upper bound of expected queries as well as the optimal parameters are derived. Compared with Yoder’s algorithm, the query complexity of our algorithm indeed achieves the optimal scaling in λ for quantum search, which reconfirms the practicality of the fixed-point method. In addition, our algorithm also does not contain randomness, and compared with the existing deterministic algorithm, the query complexity can be reduced by about 1/3. Our work provides a new idea for the research on fixed-point and trial-and-error quantum search.
基金supported by the National Natural Science Foundation of China (60874057 60725312+3 种基金 61074029)the Liaoning Provincal Foundation of Science and Technology (20082023)the Natural Science Foundation of Liaoning Province (20092083)China Postdoctoral Science Foundation Project (20100471488)
文摘A new method that stabilizes network-based systems with both bounded delay and packet disordering is discussed under the state feedback controller. A novel model, fully describing the dynamic characteristic of network-based systems with packet disordering, is constructed. Different from the existing models of network-based systems, the number of delay items is time-varying in the model proposed. Further, this model is converted into a parameter-uncertain discrete-time system with time-varying delay item numbers in terms of matrix theory. Moreover, the less conservative stability condition is obtained by avoiding utilisation of Moon et al.’ inequality and bounding inequalities for quadratic functional terms. By solving a minization problem based on linear matrix inequalities, the state feedback controller is presented. A numerical example is given to illustrate the effectiveness of the proposed method.
