On figures of merit in reversible and quantum logic designs

被引:113
作者
Mohammadi, Majid [1 ]
Eshghi, Mohammad [1 ]
机构
[1] Shahid Beheshti Univ, Tehran, Iran
关键词
Quantum circuit; Reversible logic; Quantum cost; Constant inputs; Garbage outputs; Weighted number of gates; Delay; GATES;
D O I
10.1007/s11128-009-0106-0
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Five figures of merit including number of gates, quantum cost, number of constant inputs, number of garbage outputs, and delay are used casually in the literature to compare the performance of different reversible or quantum logic circuits. In this paper we propose new definitions and enhancements, and identify similarities between these figures of merit. We evaluate these measures to show their strength and weakness. Instead of the number of gates, we introduce the weighted number of gates, where a weighting factor is assigned to each quantum or reversible gate, based on its type, size and technology. We compare the quantum cost with weighted number of gates of a circuit and show three major differences between these measures. It is proved that it is not possible to define a universal reversible logic gate without adding constant inputs. We prove that there is an optimum value for number of constant inputs to obtain a circuit with minimum quantum cost. Some reversible logic benchmarks have been synthesized using Toffoli and Fredkin gates to obtain their optimum values of number of constant inputs. We show that the garbage outputs can also be used to decrease the quantum cost of the circuit. A new definition of delay in quantum and reversible logic circuits is proposed for music line style representation. We also propose a procedure to calculate the delay of a circuit, based on the quantum cost and the depth of the circuit. The results of this research show that to achieve a fair comparison among designs, figures of merit should be considered more thoroughly.
引用
收藏
页码:297 / 318
页数:22
相关论文
共 27 条
[1]  
[Anonymous], 2008, Am. J. Appl. Sci., DOI DOI 10.3844/AJASSP.2008.282.288
[2]  
[Anonymous], 2003, P 6 INT S REPR METH
[3]  
BANERJEE A, 2007, ARXIV07074233V1 QUAN
[4]   ELEMENTARY GATES FOR QUANTUM COMPUTATION [J].
BARENCO, A ;
BENNETT, CH ;
CLEVE, R ;
DIVINCENZO, DP ;
MARGOLUS, N ;
SHOR, P ;
SLEATOR, T ;
SMOLIN, JA ;
WEINFURTER, H .
PHYSICAL REVIEW A, 1995, 52 (05) :3457-3467
[5]  
Chuang ML, 2007, ASIA S PACIF DES AUT, P420
[6]   CONSERVATIVE LOGIC [J].
FREDKIN, E ;
TOFFOLI, T .
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1982, 21 (3-4) :219-253
[7]  
GROBE D, 2007, ACM GREAT LAK S VLSI, P96
[8]   An algorithm for synthesis of reversible logic circuits [J].
Gupta, Pallav ;
Agrawal, Abhinav ;
Jha, Niraj K. .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2006, 25 (11) :2317-2330
[9]  
Kaye P., 2007, An introduction to quantum computing
[10]   A new heuristic algorithm for reversible logic synthesis [J].
Kerntopf, P .
41ST DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2004, 2004, :834-837