Principles of Superconducting Quantum Computers. Daniel D. Stancil
Чтение книги онлайн.

Читать онлайн книгу Principles of Superconducting Quantum Computers - Daniel D. Stancil страница 11

Название: Principles of Superconducting Quantum Computers

Автор: Daniel D. Stancil

Издательство: John Wiley & Sons Limited

Жанр: Программы

Серия:

isbn: 9781119750741

isbn:

СКАЧАТЬ a different set of basis states. (We will discuss measurement in more detail in later chapters.)

      When a qubit is measured: (a) the state is changed to one of the basis states associated with the measurement, and (b) the measurement apparatus tells us the resulting state. In general, the probability that a state |ψ⟩ will be found in the basis state |a⟩ when measured is given by

      

(1.9)

      This is called the Born Rule. For example, the probability that the outcome of measuring the state |ψ⟩ above is |0⟩,|1⟩ is given by

      

(1.10)

      

(1.11)

      as we found before.

      1.4 Unitary Operations and Single-Qubit Gates

      

(1.12)

      This can be written as a matrix equation

      

(1.13)

      

(1.14)

      Since the length of the state vector must always be unity, we are only allowed to use matrices U that conserve the length of the vector. In other words, ⟨ψ′|ψ′⟩ = ⟨ψ|ψ⟩ = 1. This puts a very important constraint on the matrix U:

      

(1.15)

      using the following observation:

      

(1.16)

      Since ⟨ψ|ψ⟩ = 1, we conclude that

      

(1.17)

      where I is the identity matrix

      

(1.18)

      Matrices that satisfy this requirement are called unitary matrices. We can view these matrices as performing an operation on a qubit by changing the mixture of basis states. Consequently, the matrices U are also referred to as unitary operators.

      The identity matrix I can be considered to be the simplest “gate” and leaves the state vector unchanged. Classically, the NOT gate is the only non-trivial single-bit gate. In contrast, there are many non-trivial single qubit quantum gates (technically, the number of 2×2 unitary matrices is unlimited). The most common non-trivial single qubit gates are the Pauli-X (X), Pauli-Y (Y), Pauli-Z (Z), and Hadamard (H) gates defined as follows:

      

(1.19)

      

(1.20)

      

(1.21)

      

(1.22)

      

(1.23)

      Similarly,