Recently, a systematic procedure was proposed to derive a minimum space quantum circuit for any given classical logic with the generalized quantum Toffoli gate which is universal in boolean logic. Since quantum computation is reversible, we can apply 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 use Hadamard and general CCN gates to make QILA 1-testable. That is, for any quantum boolean circuit, the number of test patterns is independent of both the size of the array and the length of the inputs. This property can be applied to perform the quantum built-in self-test (QBIST), which makes any boolean circuit 1-testable.