Reversible Logic Synthesis Benchmarks Page

you are in... Main\4_49

Function 4_49 is the worst case scenario 4 variable function for the basic algorithm presented in this paper (DAC'03). This function specification is [15, 1, 12, 3, 5, 6, 8, 7, 0, 10, 13, 9, 2, 4, 14, 11].

Picture Machine-readable version Model Garbage Gate count Quantum cost Author(s) Date

here here GT 0^m 16 58 D. Maslov, G. W. Dueck, D. M. Miller November, 2003

here here GT&GF
0^m
13
63
D. Maslov, G. W. Dueck, D. M. Miller August, 2004

here
here
NCT
0^m
12^m
32
D. Maslov, D. M. Miller, G. W. Dueck
November, 2005

here
here
NCT
0^m
12^m 30
M. Szyprowski, P. Kerntopf
February, 2011

here
here
NCT
0^m
13 29
M. Szyprowski, P. Kerntopf
February, 2011

here
here
NCT
0^m
14 28
M. Szyprowski, P. Kerntopf
February, 2011

________________________________
^m - the number was shown to be minimal

Picture	Machine-readable version	Model	Garbage	Gate count	Quantum cost	Author(s)	Date
here	here	GT	0^m	16	58	D. Maslov, G. W. Dueck, D. M. Miller	November, 2003
here	here	GT&GF	0^m	13	63	D. Maslov, G. W. Dueck, D. M. Miller	August, 2004
here	here	NCT	0^m	12^m	32	D. Maslov, D. M. Miller, G. W. Dueck	November, 2005
here	here	NCT	0^m	12^m	30	M. Szyprowski, P. Kerntopf	February, 2011
here	here	NCT	0^m	13	29	M. Szyprowski, P. Kerntopf	February, 2011
here	here	NCT	0^m	14	28	M. Szyprowski, P. Kerntopf	February, 2011