经典的逻辑关系可以使用逻辑函数加以表示,通过类比可以定义量子逻辑函数.然而量子逻辑门实现的都是幺正变换,从而是可逆变换,非可逆变换不能直接实现.通过添加辅助量子位可以增添量子输出信号的区分位,完成对非可逆逻辑门的改造,使得非可逆逻辑门在量子逻辑电路中得到可逆实现.具体研究了或门、与非门以及或非门等常见的逻辑门的改造方法.以丢失部分量子信息为代价来改造量子逻辑电路,并给出了可以实现的优化后的量子逻辑电路.
Classic logic relationship can be represented by logic functions. Quantum logic function can be defined similarly. However, quantum logic gates are unitary transformations, which are reversible. So it can not realize irreversible transformation directly. By introducing auxiliary qubits and adding the output signal of quantum bits, the irreversible logic operations can be achieved. The sample irreversible logic gates of OR, NOR, and NAND were studied. Their corresponding reversible realization was proposed. At the cost of losing part of quantum information, the optimized circuits were finally obtained.
参考文献
| [1] | Feynman R P.Simulating physics with computers[J].Int.J.Theor.Phys.,1982,21:457-488. |
| [2] | Deutsch D.Quantum theory,the Church-Turing principle and the universal quantum computer[C].Proc.of Roy.Soc.London A,1985,400:97-117. |
| [3] | Shor P W.Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J].SIAM Journal on Computing,1997,26:1484-1509. |
| [4] | Miller D M,Maslov D,Dueck G W.A transformation based algorithm for reversible logic synthesis[C].Proc.of the 40th Conference on Design Automation,2003,318-321. |
| [5] | Dueck G W,Maslov D,Miller D M.Transformation-based synthesis of networks of Toffoli/Fredkin gates[G].Proceedings of the 2003 IEEE/ACM International Conference on Computer-aided Design,2003,211-214. |
| [6] | Maslov D,Dueck G W,Miller D M.Fredkin/Toffoli templates for reversible logic synthesis[C].ICCAD,2003,9-13. |
| [7] | Fredkin E.Toffoli T.Conservative logic[J].Int.J.Theor.Phys.,1982,21:219-253. |
- 下载量()
- 访问量()
- 您的评分：
-
10%
-
20%
-
30%
-
40%
-
50%