Universal Test Sets for Reversible Circuits

A set of test vectors is complete for a reversible circuit if it covers all stuck-at faults on the wires of the circuit. It has been known that any reversible circuit has a surprisingly small complete test set, while it is NP-hard to generate a minimum complete test set for a reversible circuit. A test set is universal for a family of reversible circuits if it is complete for any circuit in the family. We show minimum universal test sets for some families of CNOT circuits.

[1]  J. Hayes,et al.  Fault testing for reversible circuits , 2003, Proceedings. 21st VLSI Test Symposium, 2003..

[2]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[3]  Ralph C. Merkle,et al.  Two types of mechanical reversible logic , 1993 .

[4]  John P. Hayes,et al.  Synthesis of reversible logic circuits , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[6]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[7]  Avik Chakraborty.  Synthesis of reversible circuits for testing with universal test set and C-testability of reversible iterative logic arrays , 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

[8]  John P. Hayes,et al.  Optimal synthesis of linear reversible circuits , 2008, Quantum Inf. Comput..