排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Farid Ablayev Alexander Vasiliev 《International Journal of Software and Informatics》2013,7(4):485-500
In the paper, we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs). Our method is based on ˉngerprinting technique and representation of Boolean functions by their characteristic polynomials. We use circuit notation for branching programs for desired algorithms presentation. For several known functions our approach provides optimal QOBDDs. Namely we consider such functions as MODm, EQn, Palindromen, and PERMn (testing whether given Boolean matrix is the Permutation Matrix). We also propose a generalization of our method and apply it to the Boolean variant of the Hidden
Subgroup Problem. 相似文献
1