Realization of quantum oracles using symmetries of boolean functions

被引：0
|
作者：
Gao, Peng [1 ]
Li, Yiwei [1 ]
Erkowski, Marek [1 ]
Song, Xiaoyu [1 ]
机构：
[1] Department of Electrical and Computer Engineering, Portland State University, Portland,OR, United States
来源：
Quantum Information and Computation | 2020年 / 20卷 / 5-6期
关键词：
Designing a quantum oracle is an important step in practical realization of Grover algorithm; therefore it is useful to create methodologies to design oracles. Lattice diagrams are regular two-dimensional structures that can be directly mapped onto a quantum circuit. We present a quantum oracle design methodology based on lattices. The oracles are designed with a proposed method using generalized Boolean symmetric functions realized with lattice diagrams. We also present a decomposition-based algorithm that transforms non-symmetric functions into symmetric or partially symmetric functions. Our method; which combines logic minimization; logic decomposition; and mapping; has lower quantum cost with fewer ancilla qubits. Overall; we obtain encouraging synthesis results superior to previously published data. © Rinton Press;
D O I：
10.26421/qic20.5-6-4
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：418 / 448
相关论文
共 50 条
12345