Sign in
← Atlas
Exact & formalGatesControlled gate

Controlled-Y gate

A controlled version of the Pauli-Y gate that flips the target bit and attaches a ±i phase exactly when the control qubit is |1⟩, completing the CX/CY/CZ family of controlled Paulis.

controlled gatetwo qubitcliffordentanglement

Atlas stars stay in the public catalog. Saving this entry to your workspace starts an unstarred private copy.

CY is less common as a native hardware gate than CX or CZ, but it completes the natural trio of controlled-Pauli gates and is a direct exercise in the general controlled-U-from-CX recipe, since Y is neither diagonal (like Z) nor real (like X).

Circuit & simulation
|10⟩ → i|11⟩100%
|11⟩ → -i|10⟩100%
What this takes and returns
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 →

How it works

Definition

CY=00I+11Y=(10000100000i00i0)\mathrm{CY} = |0\rangle\langle 0|\otimes I + |1\rangle\langle 1|\otimes Y = \begin{pmatrix} 1&0&0&0\\0&1&0&0\\0&0&0&-i\\0&0&i&0 \end{pmatrix}

with the control as the first (leftmost) qubit. Like CX\mathrm{CX}, this matrix is a bit-flip on the target; unlike CX\mathrm{CX}, it also attaches a ±i\pm i phase, since Y0=i1Y|0\rangle = i|1\rangle and Y1=i0Y|1\rangle = -i|0\rangle.

Action on basis states

CY0,t=0,t,CY1,0=i1,1,CY1,1=i1,0\mathrm{CY}|0,t\rangle = |0,t\rangle, \qquad \mathrm{CY}|1,0\rangle = i|1,1\rangle, \qquad \mathrm{CY}|1,1\rangle = -i|1,0\rangle

The control is left untouched in every case; the target flips exactly when the control is 1|1\rangle, exactly as with CX\mathrm{CX}, but the flipped amplitude also picks up a phase of ±i\pm i depending on direction.

Decomposition

Using the single-qubit identity Y=SXSY = S\,X\,S^\dagger (verified directly: SXS=(0ii0)=YS X S^\dagger = \begin{pmatrix}0&-i\\i&0\end{pmatrix} = Y), conjugating a plain CX\mathrm{CX}'s target by SS^\dagger before and SS after reproduces CY\mathrm{CY} exactly:

CY=(IS)CX(IS)\mathrm{CY} = (I\otimes S)\,\mathrm{CX}\,(I\otimes S^\dagger)

so the circuit applies SS^\dagger to the target, then CX\mathrm{CX}, then SS to the target — a direct three-gate analogue of the CZ=(IH)CX(IH)\mathrm{CZ} = (I\otimes H)\,\mathrm{CX}\,(I\otimes H) identity elsewhere in this catalog.

Key identities

  • CY2=II\mathrm{CY}^2 = I\otimes I: CY\mathrm{CY} is its own inverse, since Y2=IY^2=I.
  • CY\mathrm{CY} is Clifford: it maps Pauli operators to Pauli operators under conjugation, just like CX\mathrm{CX} and CZ\mathrm{CZ}.
  • Together, CX\mathrm{CX}, CY\mathrm{CY}, and CZ\mathrm{CZ} are the three controlled-Pauli gates; any one can be built from either of the others plus single-qubit Clifford conjugation (HH for CZCX\mathrm{CZ}\leftrightarrow\mathrm{CX}, SS for CYCX\mathrm{CY}\leftrightarrow\mathrm{CX}).
Implementation
Native
controlled-y.qasm
OPENQASM 3.0;
include "stdgates.inc";
qubit[2] q;
x q[0];
cy 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.

Declared gaps

Nobody has reviewed this record for gaps yet.

Literature & references
Quantum Computation and Quantum Information: 10th Anniversary Edition2010 · Michael A. Nielsen and Isaac L. Chuang

Standard reference for gate matrices, the Clifford/non-Clifford distinction, and controlled-gate constructions used throughout this record.

doi.org/10.1017/cbo9780511976667
OpenQASM 3: A broader and deeper quantum assembly language2021 · 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

Defines the standard gate library (id, sdg, tdg, cy, crz, rxx, rzz, ccx, cx…) used natively by the code snippets on this record.

arxiv.org/abs/2104.14722