Gates · Two-qubit gate
RZZ (ZZ interaction) gate
A parametrized two-qubit gate implementing evolution under the Ising ZZ coupling, the entangling primitive most directly native to superconducting and trapped-ion hardware built from always-on or tunable ZZ interactions.
Exact & formalUpdated
A small worked example, computed in your browser. It is not a result from this record's papers.
RZZ(θ), the two-qubit interaction Ising models are made of
Two qubits, both put into |+⟩, then coupled by RZZ(π/2).
Step 1 of 3 · H
Probability of each outcome after this step
- 0050%
- 0150%
Qubit 0 into an equal superposition.
Probability spreads from 1 outcome to 2. All 2 are equally likely.
Qubit 1 as well.
Probability spreads from 2 outcomes to 4. All 4 are equally likely.
Turns the phase one way where the two qubits agree and the other way where they disagree. No probability moves. This is one term of an Ising Hamiltonian evolved for a short time, and a chain of these is what a Trotter step is made of.
The outcome probabilities do not move at all. What this step changes is phase — 2 distinct relative phases across the state now — which no measurement can see until a later step turns it back into probability. This is the step that entangles the qubits: from here on no single qubit has a state of its own, only the register as a whole does.
Readout All four outcomes stay equally likely. The gate's whole effect is a phase that depends on whether the two qubits agree — which is exactly what a coupling term in an Ising model is, and why this gate appears in every Trotter step and every QAOA cost layer in the Atlas.
Open in Studio- Steps1
- Wires2
- Qubits2
- Depth1 native / 3-gate decomposition (CX, RZ, CX)
- Parameterθ (radians)
- Papers2
RZZ matters because ZZ coupling is often the physical interaction a device actually has: rather than compiling a target algorithm's entangling step down to CNOT, many Hamiltonian-simulation and QAOA compilers target RZZ directly since it matches the hardware's native two-body term.
Takes2 qubitsWhat joins here
Takes a 2-qubit register and states no assumption about what is on it. That is the whole condition: anything returning 2 qubits can feed it.
16 entries meet this end. Named below.
Returns2 qubitsWhat joins here
Returns a 2-qubit register a next stage can take. This is the end that joins.
11 entries meet this end. Named below.
A unitary. The same register goes in and comes out, and this entry states no assumption about what is on it — which is what lets anything of the same width feed it. See all 29 →
Definition
Since , the exponential splits exactly as , and because is diagonal with eigenvalues , the result is diagonal.
Action on basis states
No population moves between basis states; only the relative phase between same-parity and opposite-parity computational states changes, which is exactly the interference resource used by QAOA cost-Hamiltonian layers.
Decomposition
The first CNOT maps the target qubit onto the parity ; a single-qubit there attaches , and the second CNOT restores the target to while leaving the accumulated phase in place — direct basis-state tracking confirms this phase equals the diagonal entry exactly for all four inputs.
Key identities
- is Clifford: numerically, (both sides equal ), so at this special angle reduces to a product of Clifford gates; for generic it is not Clifford.
- : successive ZZ-interaction pulses on the same pair compose additively, matching real continuous-time evolution under a fixed coupling.
- : conjugating by Hadamards on both qubits rotates the interaction axis from to .
- is the two-qubit workhorse of Trotterized Hamiltonian simulation for Ising-type models and of the cost-Hamiltonian layer in QAOA for Max-Cut-style problems.
Takes2 qubitsWhat joins here
Takes a 2-qubit register and states no assumption about what is on it. That is the whole condition: anything returning 2 qubits can feed it.
16 entries meet this end. Named below.
Returns2 qubitsWhat joins here
Returns a 2-qubit register a next stage can take. This is the end that joins.
11 entries meet this end. Named below.
A unitary. The same register goes in and comes out, and this entry states no assumption about what is on it — which is what lets anything of the same width feed it. See all 29 →
- Qubits
- 2
- Depth
- 1 native / 3-gate decomposition (CX, RZ, CX)
- Parameter
- θ (radians)
- Matrix
- diag(e^{-iθ/2}, e^{iθ/2}, e^{iθ/2}, e^{-iθ/2})
- Generator
- exp(-iθ ZZ/2)
- Decomposition
- CX · RZ(θ) · CX
- Gate family
- Non-Clifford (generic θ); Clifford at θ=π/2
RZZ(π/2)on q[0], q[1]
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.
Nobody has reviewed this record for gaps yet.
OPENQASM 3.0;
include "stdgates.inc";
qubit[2] q;
rzz(pi/2) q[0], q[1];Related entries
- Controlled-Z gate
Gates
- RZ rotation gate
Gates
- RXX (XX interaction) gate
Gates
- Transverse-field Ising simulation
Algorithms
- QAOA MaxCut on a 5-node ring
Algorithms
References
- Quantum Computation and Quantum Information: 10th Anniversary Edition
Michael A. Nielsen and Isaac L. Chuang · 2010
Standard reference for gate matrices, the Clifford/non-Clifford distinction, and controlled-gate constructions used throughout this record.
- OpenQASM 3: A broader and deeper quantum assembly language
Andrew W. Cross, Ali Javadi-Abhari, Thomas Alexander, Niel de Beaudrap, Lev S. Bishop, Steven Heidel, Colm A. Ryan, Prasahnt Sivarajah, John Smolin, Jay M. Gambetta, Blake R. Johnson · 2021
Defines the standard gate library (id, sdg, tdg, cy, crz, rxx, rzz, ccx, cx…) used natively by the code snippets on this record.