26 lines
1.5 KiB
Markdown
26 lines
1.5 KiB
Markdown
|
|
|||
|
|
> The simplest way to decompose the multiqubit Toffoli gate in terms of the usual Toffoli gat is by using (n − 2) draft qubits called ancillas. The ancillary qubits are interlaced with the control qubits, the first ancilla qubit being inserted between the second and third qubits. The 5best way to explain the decomposition is to show an example. Consider the gate C(X), whos
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
* *highlighted by Shwetha Jayaraj at page 26 on [[BasicQuantumAlgorithms.pdf]]*
|
|||
|
|
|
|||
|
|
> decomposition requires three ancillas, as shown in the following circuit equivalence:
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
* *highlighted by Shwetha Jayaraj at page 27 on [[BasicQuantumAlgorithms.pdf]]*
|
|||
|
|
|
|||
|
|
> The multiqubit Toffoli gate can also be activated by zero. In this case, the control qubit i n shown as an empty circle. For n qubits, we have 2multiqubit Toffoli gates that can implemen any Boolean function of n bits,
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
* *highlighted by Shwetha Jayaraj at page 27 on [[BasicQuantumAlgorithms.pdf]]*
|
|||
|
|
|
|||
|
|
> s show how to obtain the quantum circuit of a truth table. We only need multiqubit Toffol gates. To show that the multiqubit Toffoli gates can implement any Boolean function on a quantum computer, let’s take the 3-bit Boolean function f (a, b, c) defined by the following truth table as an example
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
* *highlighted by Shwetha Jayaraj at page 27 on [[BasicQuantumAlgorithms.pdf]]*
|
|||
|
|
|
|||
|
|
> After this example, it is evident how the general case is obtained. Since f has three input bits, we use multiqubit Toffoli gates with three controls. The 4th qubit is the targe
|