quantum abstract detecting systems (QADS) were introduced as a common framework for the study and design of detecting algorithms in a quantum computing setting. In this paper, we introduce new families of such QADS, k...
详细信息
quantum abstract detecting systems (QADS) were introduced as a common framework for the study and design of detecting algorithms in a quantum computing setting. In this paper, we introduce new families of such QADS, known as combinatorial and rotational, which, respectively, generalize detectingsystems based on single qubit controlled gates and on Grover's algorithm. We study the algorithmic closure of each family and prove that some of these QADS are equivalent (in the sense of having the same detection rate) to others constructed from tensor product of controlled operators and their square roots. We also apply the combinatorial QADS construction to a problem of eigenvalue decision, and to a problem of phase estimation.
quantum abstract detecting systems (QADS) provide a common framework to address detection problems in quantum computers. A particular QADS family, that of combinatorial QADS, has been proved to be useful for decision ...
详细信息
quantum abstract detecting systems (QADS) provide a common framework to address detection problems in quantum computers. A particular QADS family, that of combinatorial QADS, has been proved to be useful for decision problems on eigenvalues or phase estimation methods. In this paper, we consider functional QADS, which not only have interesting theoretical properties (intrinsic detection ability, relation to the QFT), but also yield improved decision and phase estimation methods, as compared to combinatorial QADS. A first insight into the comparison with other phase estimation methods also shows promising results.
暂无评论