Quantum computing
History /
Edit /
PDF /
EPUB /
BIB /
Created: December 21, 2019 / Updated: November 2, 2024 / Status: draft / 2 min read (~243 words)
Created: December 21, 2019 / Updated: November 2, 2024 / Status: draft / 2 min read (~243 words)
|0⟩=(10)
|1⟩=(01)
- Quantum computers only use reversible operations
- Identity and Negation are reversible
- Constant-0 and Constant-1 aare not reversible
(x0x1)⊗(y0y1)=(x0(y0y1)x1(y0y1))=(x0y0x0y1x1y0x1y1)
(12)⊗(34)=(3468)
- This tensored representation is called the product state
|00⟩=(10)⊗(10)=(1000)
|01⟩=(10)⊗(01)=(0100)
|10⟩=(01)⊗(10)=(0010)
|11⟩=(01)⊗(01)=(0001)
|4⟩=|100⟩=(01)⊗(10)⊗(10)=(00001000)
C=(1000010000010010)
C|10⟩=C((01)⊗(10))=(1000010000010010)(0010)=(0001)=(01)⊗(01)=|11⟩