A unitary operation on a fixed number of qubits used as a component of a quantum circuit. Examples include the Hadamard gate and Controlled-Z gate. Measurements are described separately by quantum measurement; a gate is a reversible operation on its full input state.
A unitary gate on two quantum systems is entangling if it maps at least one pure state that is a product state to an entangled state. The controlled-NOT gate qualifies because it maps to a Bell state. A gate that merely exchanges the two systems need not be a local unitary operation, but cannot create quantum entanglement from a product state.
For two -dimensional unitary matrices, this normalized absolute trace lies in and equals one exactly when . The triangle inequality on the eigenphases of proves both statements. It ignores an overall global phase and compares complete propagators. It is not the same definition as average gate fidelity; for unitary implementations that latter quantity is .
A method that combines a prepared magic state, Clifford gates, and measurements with outcome-dependent corrections to implement a non-Clifford operation on a data register.
Apply a controlled-NOT gate from data to the resource , then measure the resource in the standard basis. Outcome zero leaves data ; outcome one leaves . Both outcomes have probability . Correct outcome one with , using , so the data has undergone the T gate irrespective of the measurement result. The resource is consumed, and its Bloch vector lies outside the stabilizer octahedron.
A two-qubit gate is a unitary operator on two qubit lines, extended by the identity on the others. It may be entangling, as a CNOT gate is, or a product of local operations. In a Hamiltonian simulation model allowing arbitrary two-qubit gates, the exponential of a Hermitian term supported on two lines counts as one such gate. Compiling it into a fixed discrete universal quantum gate set introduces a separate approximation cost.
A two-qubit gate in which an interaction shifts the energy of a selected joint computational basis state and thereby accumulates a relative quantum phase. With Hamiltonian operator , where has units of energy, an interaction time gives with . The selected basis state is part of the convention: this gate differs from the usual Controlled-Z gate at . Conjugation by a Pauli X gate on the first qubit gives , because the conjugation interchanges and .
A diagonal two-qubit gate with entries is a product of local diagonal gates, up to global phase, exactly when modulo . This follows by factoring the two-by-two array of phases; its determinant vanishes precisely in that case. If the determinant is nonzero, applying the gate to produces an entangled state by the two-qubit product-state determinant criterion. In particular is local, whereas is the entangling Controlled-Z gate.
Every two-qubit gate has the displayed form with local elements of the special unitary group and real interaction parameters. The three Pauli-product generators commute, so the central exponential is the product of three interactions. Local basis changes turn an Ising coupling into either of the other Pauli-product couplings. A fixed entangling controlled phase together with arbitrary local rotations can also synthesize each variable interaction, for example through two CNOT gates enclosing a variable rotation.

Articles by others on the same topic (2)

A quantum logic gate is a fundamental building block of quantum computing, analogous to classical logic gates in traditional computing. Quantum gates manipulate individual qubits (quantum bits), which are the basic units of quantum information. Unlike classical bits that can exist in a state of either 0 or 1, qubits can exist in superpositions of these states, allowing for a more complex form of computation.
Quantum logic gate by Ciro Santilli 40 Updated 2025-07-16
At Section "Quantum computing is just matrix multiplication" we saw that making a quantum circuit actually comes down to designing one big unitary matrix.
We have to say though that that was a bit of a lie.
Quantum programmers normally don't just produce those big matrices manually from scratch.
Instead, they use quantum logic gates.