Fig 1.
Quantum circuit of Grover’s algorithm.
A quantum circuit implementing Grover’s algorithm with four qubits [50].
Table 1.
Representation of Boolean reversible function f.
Table 2.
Truth tables of completely and incompletely specified functions.
Fig 2.
Toffoli gate implementation with basic quantum gates.
A circuit composed of five basic quantum gates implementing the Toffoli gate C2 NOT(1, 2;3).
Table 3.
Quantum costs of multiple control Toffoli gates.
Fig 3.
MCNF representation of the QRCS problem.
Fig 4.
3-qubit example of MCT gate-network conversion: CASE1.
Fig 5.
3-qubit example of MCT gate-network conversion: CASE2.
Fig 6.
3-qubit example of MCT gate-network conversion: CASE3A.
Fig 7.
3-qubit example of MCT gate-network conversion: CASE3B.
Fig 8.
Network representation of MCT circuit for function F1.
Table 4.
Truth table and parameters of completely specified function F1.
Fig 9.
Network representation of MCT circuit for function F2.
Table 5.
Truth table and parameters of incompletely specified function F2.
Table 6.
Sets and parameters.
Table 7.
Decision variables.
Table 8.
Comparison of computational results with those of previous studies.
Table 9.
Computational results with different ND.
Fig 10.
Change in quantum cost as ND increases.
The number on the top-left of each plot indicates the data index in Table 9.
Fig 11.
Resulting circuits of No. 18 mini_alu with varying ND: ND = 5.
Fig 12.
Resulting circuits of No. 18 mini_alu with varying ND: ND = 6.
Fig 13.
Resulting circuits of No. 18 mini_alu with varying ND: ND = 7.
Fig 14.
Resulting circuits of No. 18 mini_alu with varying ND: ND = 8.
Fig 15.
Resulting circuits of No. 18 4gt4_v1 with varying ND: ND = 5.
Fig 16.
Resulting circuits of No. 18 4gt4_v1 with varying ND: ND = 6.
Fig 17.
Resulting circuits of No. 18 4gt4_v1 with varying ND: ND = 7.
Fig 18.
Resulting circuits of No. 18 4gt4_v1 with varying ND: ND = 8.