Pauli gates (X, Y, Z)
Think of a single qubit as an arrow that can point anywhere on a globe (the Bloch sphere). The Pauli gates are the three simplest ways to flip that arrow halfway around the globe, one for each axis. X is the bit-flip: it swaps |0> and |1>, just like a classical NOT. Z is the phase-flip: it leaves |0> alone but flips the sign in front of |1>, which does nothing you can see directly in a single measurement but changes how the qubit interferes with others. Y does both at once, a bit-flip and a phase-flip together. Each gate is its own undo button: apply it twice and you are back where you started.
These three gates matter for a second reason that is easy to miss. When a qubit gets disturbed by noise, you can always describe what went wrong as some mix of 'a bit got flipped' (X), 'a phase got flipped' (Z), or both (Y). So the Pauli gates are not just operations you choose to run; they are also the standard vocabulary for the errors that quantum error correction has to detect and reverse. If a code can reliably catch X, Z, and Y errors on its qubits, it can in principle catch any single-qubit error, because every error is a combination of these. That is why you will see X, Y, and Z everywhere in discussions of how to build a reliable machine, not only in discussions of what the machine computes.
X swaps the two amplitudes (a bit-flip); Z leaves |0> untouched and flips the sign of the |1> amplitude (a phase-flip).
X, Y, and Z are useful building blocks but are not a universal gate set by themselves; you need extra gates (such as H and T, plus a two-qubit gate like CNOT) to reach arbitrary computations.