Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don't Cares
Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don't Cares
复制标题
无需关心可逆函数的基本量子门电路的精确综合
DOI：
10.1109/ismvl.2008.42
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
R. Drechsler
中科院分区：
文献类型：
--
作者：
Daniel Große;R. Wille;G. Dueck;R. Drechsler
可逆逻辑函数的紧凑实现在量子计算机的设计中具有重要意义。在本文中，我们提出了一个精确的综合算法，基于布尔可满足性（SAT），找到一个给定的可逆函数的最小初等量子门实现。由于这些门是以量子比特的形式工作的，因此提出了一种多值编码。不关心条件在许多可逆函数中自然出现。当一个函数被嵌入到一个可逆函数中时，经常需要常量输入。该算法充分利用了无关条件，并自动将常数输入设置为最优值。一组基准函数的算法的有效性。
Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean satisfiability (SAT), that finds the minimal elementary quantum gate realization for a given reversible function. Since these gates work in terms of qubits, a multi-valued encoding is proposed. Don't care conditions appear naturally in many reversible functions. Constant inputs are often required when a function is embedded into a reversible one. The proposed algorithm takes full advantage of don't care conditions and automatically sets the constant inputs to their optimal values. The effectiveness of the algorithm is shown on a set of benchmark functions.