[Quantum Information] Quantum gates
Quantum gates
Notes from RWTH Aachen University course
“Quantum Information” Summer semester 2020
professor: Müller, Markus
Quantum gates
Classical
Universality: There exist minimal sets of gates that suffice to implement any classical Boolean circuits. E.g. AND and NOT.
Irreversible computing: The two-bit gates are essentially irresverible and non-invertable: e.g. a⊕b of XOR gate
- loss the information
- because two input bits just flow into one output bit
Reversible computing: the number of inputs and outputs are equal
The three bits Toffeli-gate is a universal reversible logic gate: any reversible classical circuit can be built from Toffeli-gate only.
Quantum
In quantum information processing, all unitary transformations are allowed, represents valid quantum operations.
time evolution U(t)=exp(−ithH)
Example:
- single qubit rotation: H∝σ,σ∈{X,Y,Z}
- e.g. Hj=E⋅Xj on the j-th qubit
H: hamiltonian
E: energy
X: X-rotation - RXj(α)=exp(−iα2Xj)
α is controlled by the strength E and the time t
2E⋅th∝α - RXj can be simplified:
use identity for operators A, for which A2=I
eiαA=∞∑n=01n!(iα)nAn=(1−α22+...)I+i(α−16α3+...)A=cos(α)⋅I+isin(α)⋅A - Since σ2=I
Rσ(α)=exp(−iα2σ)=cos(α)⋅I−isin(α)⋅σ
Single-qubit gate:
classical: only NOT gate
quantum: many more (infinitely)
- e.g. rotation operations
Pauli gates can be generated from rotations, up to overall phase
Rσ(π)=(−i)⋅σHadamard gate
- H=1√2(111−1)
- H=1√2(111−1)
phase gate
- S=(100i)
- S=(100i)
T-gate
- T=(100eiπ/4)
- T=(100eiπ/4)
no correlations / entanglement can be created by a single qubit gate
we need two-qubit gate.
Two-qubit gate:
- CNOT
- CNOT=(1000010000010010)
- CNOT=(1000010000010010)
- controlled-U
- U applies ⇔ the first qubit is |1⟩
- U applies ⇔ the first qubit is |1⟩
- creation of entanglement: C1NOT2⋅H1|ψ12⟩
- Definition of entangled state: all pure states cannot be written as a product state, are entangled
1√2(|00⟩+|11⟩)≠(α1|0⟩+β1|1⟩)(α2|0⟩+β2|1⟩)
留言
張貼留言