Quantum Gates
This table fixes common quantum-information gate conventions. It is a matrix lookup, not a circuit-design guide.
Convention
Section titled “Convention”One-qubit matrices use the computational basis . Two-qubit matrices use the basis order
Gates act on state column vectors from the left.
One-Qubit Gates
Section titled “One-Qubit Gates”| Gate | Matrix | Action |
|---|---|---|
| identity | ||
| bit flip | ||
| bit and phase flip | ||
| phase flip | ||
| Hadamard basis change | ||
| phase gate, | ||
| phase gate |
Two-Qubit Gates
Section titled “Two-Qubit Gates”| Gate | Matrix or Action | Note |
|---|---|---|
| CNOT | first qubit controls second | |
| CZ | symmetric controlled phase | |
| SWAP | exchanges tensor factors |
In the stated basis, CNOT is
Common Mistakes
Section titled “Common Mistakes”- Reversing qubit order between matrix convention and circuit diagram.
- Treating a global phase as a distinct physical gate on a closed state.
- Forgetting that differs by phases from a simple bit flip.
- Comparing CNOT matrices from sources that use opposite control-target ordering.
Canonical Links
Section titled “Canonical Links”- Quantum Gates Formula Card
- Circuit Model
- Single-Qubit Gates
- Multi-Qubit Gates
- Stabilizer Identities
- Tensor Product Exercises
- Quantum Information Problem Map
References
Section titled “References”- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2010.
- J. Watrous, The Theory of Quantum Information, Cambridge University Press, 2018.
- M. M. Wilde, Quantum Information Theory, 2nd ed., Cambridge University Press, 2017.