pure-state
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| pure-state [May 23, 2026 at 20:42] – Ivan Janevski | pure-state [June 13, 2026 at 03:13] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| # Pure state | # Pure state | ||
| - | **Pure state** is a quantum state that completely | + | **Pure state** is a quantum state that is completely |
| + | |||
| + | Classical bits can be `0` or `1`, encoded as voltages such as $0\, | ||
| + | |||
| + | ## Density matrix representation | ||
| + | Any pure state $\lvert\psi\rangle$ can be equivalently represented as a [[density-matrix|density matrix]] $\rho = \lvert\psi\rangle\langle\psi\rvert$. Pure states are exactly the states whose density matrix satisfies $\text{tr}(\rho^2) = 1$. On the [[bloch-sphere]], | ||
| + | |||
| + | $$\rho = \lvert\psi\rangle\langle\psi\rvert, | ||
| - | A classical computer uses bits. Bits can be `0` or `1`. Behind the scenes bits are encoded as voltages. Usually `0` is $0V$ and `1` is `3,3V`. | ||
pure-state.1779568958.txt.gz · Last modified: by Ivan Janevski
