Quantum gate
The basic operation in a quantum computer — a rotation of the qubits' state, and unlike classical gates always reversible.
Every quantum gate is a unitary operation, which among other things means it has an inverse. A classical AND throws information away — you cannot deduce the inputs from the output — and nothing of that sort is permitted here. It is why quantum algorithms often have to carry intermediate results along and clean them up afterwards.
A handful of gates suffices for everything: arbitrary single-qubit rotations plus CNOT form a universal set. Real hardware physically implements only a small selection, and the compiler decomposes the rest into them — a process that easily multiplies the operation count.