关键词：量子搜索；专家算法；几何算法；矩阵多乘加权算法；量子线路；量子随机行走；非零和博弈
摘 要：We introduce the new framework of natural continuous time quantum search algorithms, that in contrast to the adiabatic quantum algorithms, require neither the ground state initialization nor the adiabatic change of the Hamiltonian parameters. We derive a slightly more general bound for the cumulative matrix multiplicative weights algorithm and introduce the first iterative matrix multiplicative weights algorithm with the same small performance regret. Furthermore, we address the following question:”what is the minimal size quantum circuit required to exactly implement a specifiednqubit unitary operationU, without the use of ancillaqubits?” finally we investigate then-dimensional hypercube quantum random walk(QRW) as a particularly appealing example of a quantum walk because it has a natural implementation on a register onnqubits.