Standard graduate textbook covering the single- and two-qubit gate definitions, matrix identities, and circuit primitives this record states.
doi.org/10.1017/cbo9780511976667 ↗Pauli-X operator
A bit-flip operator that makes the relationship between a circuit and its truth table explicit.
Atlas stars stay in the public catalog. Saving this entry to your workspace starts an unstarred private copy.
Pauli-X is the quantum analogue of a classical NOT gate and a useful anchor for operator-level explanations.
Circuit & simulation
What this takes and returns
TakesNothingWhat joins here
No input port, deliberately. You measure a state with this entry; you do not apply it and pass a register on.
Nothing in the Atlas meets this end.
ReturnsNothingWhat joins here
No output port, deliberately. An observable is measured with, never applied, so there is no register to hand on.
Nothing in the Atlas meets this end.
Not a stage. You measure a state with this; you do not apply it and pass a register on. It has a width and deliberately no ports. See all 60 →
How it works
Pauli- is the bit-flip operator , the quantum analogue of a classical NOT gate. On computational basis states it acts exactly as a truth table: and , which is the identity this record's basis-state simulation checks directly rather than inferring from a general formula. is Hermitian and unitary with , so it is its own inverse, and its eigenstates are and with eigenvalues and . Geometrically, is a rotation of the Bloch sphere about the -axis. Because , together with and , generates the full single-qubit Pauli group ( and cyclic permutations), it anchors error models, stabilizer codes, and controlled two-qubit gates such as CNOT.
Implementation
OPENQASM 3.0;
include "stdgates.inc";
qubit q;
x q;Quantum vs classical
Classical baseline
Use a classical state-vector or matrix simulation at the same width, precision, and measurement objective.
Quantum claim
The quantum record demonstrates a state or operator behavior; it does not make classical simulation or communication costs disappear.
How to compare
Compare fidelity, samples, gate depth, noise, memory, and the cost of preparing and reading the state.
Declared gaps
Nobody has reviewed this record for gaps yet.