Quantum boolean circuit is 1-testable
Yao–Hsin Chou, I-Ming Tsai, Sy‐Yen Kuo · 2007
Recently, a systematic procedure is proposed to derive a minimum space quantum circuit for a given classical logic with the generalized quantum Toffoli gate which is universal in classical boolean logic. Since quantum computation is reversible, we can use this property to build Quantum Iterative Logic Array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we apply Hadamard and general CCN gates on QILA circuits to make them 1-testable. As a result, for quantum boolean circuits, the number of test patterns is independent of both the size of the array and the length of the inputs.