Principles of Superconducting Quantum Computers. Daniel D. StancilЧитать онлайн книгу.
equals upper Y squared equals upper Z squared equals upper H squared equals upper I period"/> (1.28)
Note that while X,Y, and Z gates transform between the |0⟩ and |1⟩ states, the Hadamard gate actually creates a superposition state, and therefore will prove to be particularly useful. The states resulting from applying H to the basis states are given their own names:
Multiple gates can be sequentially applied to a qubit by matrix multiplication:
This expression says that we start with the ground state, then apply a Hadamard gate, followed by a Pauli-Y and then a Pauli-Z. Note that this process conceptually moves from right to left. This computation can be represented by a quantum circuit diagram as shown in Figure 1.3. Note that the process moves from left to right on the circuit diagram: we begin with the ground state on the left, then apply a Hadamard gate, a Pauli-Y gate, and a Pauli-X.
Figure 1.3 Circuit representation of Eq. (1.31). In a quantum circuit diagram, the operation goes from left to right, while the matrix expression is shown going from right to left. The final box is a measurement in the standard basis, resulting in a classical bit.
Finally, after performing a quantum calculation, we generally measure each qubit. The symbol for a measurement is shown as the last element in Figure 1.3. This action collapses the final state onto one of the basis states. The outcome of a measurement is a classical bit that is stored in a classical register. “Quantum wires” are denoted by solid lines, and “classical wires” are denoted with double lines. A quantum wire simply represents a time-interval over which the state is kept unchanged.
1.5 Two-Qubit Gates
It is also possible to have gates with multiple qubits as inputs. However, unlike classical multi-bit gates, the fact that quantum gates are reversible requires that there must be the same number of output qubits as input qubits. In this section we will explore some common two-qubit gates.
1.5.1 Two-Qubit States
When we consider a system with two qubits, we don’t just consider each qubit independently of the other. Instead, this forms a two-qubit system with its own set of basis states. If we know the state of each qubit, then the combined two-qubit state is described using the tensor product of the two state vectors, defined as follows:
Using the standard basis, the basis states for a two-qubit system are defined by combinations of the |0⟩ and |1⟩ states:
Any two-qubit state can be written as a linear combination of the basis states:
Two-qubit state vectors are also normalized:
As we will see later, while every two-qubit state can be written in the form of Eq. (1.37), not every two-qubit state can be written as the tensor product of single-qubit states.
This can be generalized into a system with n qubits, requiring state vectors with 2n components with 2n complex coefficients.
1.5.2 Matrix Representation of Two-Qubit Gates
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