Combinatorial and rotational quantum abstract detecting systems

作     者：Caceres, J. M. Hernandez Combarro, E. F. Rua, I. F. 

作者机构：Univ Oviedo Math Dept Oviedo Spain Univ Oviedo Comp Sci Dept Oviedo Spain 

出 版 物：《QUANTUM INFORMATION PROCESSING》 (量子信息处理)

年 卷 期：2022年第21卷第2期

页      面：1-27页

核心收录：

学科分类：07[理学] 070201[理学-理论物理] 0702[理学-物理学] 

基　　金：CRUE-CSIC Springer Nature 

主　　题：Quantum abstract detecting systems Grover's algorithm Quantum walks Quantum abstract search Combinatorial QADS Rotational QADS 

摘      要：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 detecting systems 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.