Читать книгу Principles of Superconducting Quantum Computers - Daniel D. Stancil - Страница 24

Just as single qubit gates can be represented by 2×2 matrices, an n-qubit gate can be represented by a 2n×2n matrix. Consequently two-qubit gates require the construction of 4×4 unitary matrices. Given two single-qubit operators A and B, the tensor product is defined as:

(1.39)

which creates a 4×4 matrix.

Suppose we wanted to construct a two-qubit circuit starting in the state |10⟩ with an X gate applied to the left qubit, and a Y gate applied to the other. Mathematically this would be written

(1.40)

Referring to (1.24) we see that the X gate will simply flip the left qubit, and referring to (1.25) we see that the Y gate will flip the right qubit and add the coefficient i. We conclude that

(1.41)

To see how this would be implemented using the matrix representation, we first construct the X⊗Y matrix:

(1.42)

Completing the calculation gives the expected result:

(1.43)

A particularly interesting two-qubit circuit is formed by applying a Hadamard gate to each qubit in the ground state: H ⊗ H|00⟩. Let us first compute H ⊗ H:

(1.44)

Completing the calculation gives:

(1.45)

Note that the resulting state vector can be decomposed into a sum of all of the two-qubit basis states:

(1.46)

or alternatively

(1.47)

We see that application of Hadamard gates to each qubit creates an equally weighted superposition of all possible basis states. This is often a very useful starting point for a quantum calculation.

Although the matrix representation can be helpful in understanding the operations, calculations can often be done more compactly once the effect of the gates are understood. For example, we could write H ⊗ H |00⟩ = H ⊗ H |0⟩ |0⟩, apply the Hadamard gates to each qubit, and simplify:

(1.48)

We conclude this section with a comment on notation. A more compact notation is often used for situations where the same operator is applied across multiple qubits; i.e., H⊗H is alternatively written H⊗2, H⊗H⊗H=H⊗3, etc.