Table of Contents
Controlled-Unitary gates
Controlled-unitary (or controlled-) gate applies a unitary operation to target qubits if and only if all control qubits are . It generalizes controlled single-qubit gates (like CNOT) and is fundamental to quantum algorithms including phase estimation, Shor's algorithm, and variational quantum algorithms.
Definition
For a unitary acting on target qubits and control qubits, the controlled- gate is:
for single control qubit, generalizing to multiple controls:
where if all controls are , else .
Action
Single control, single target:
- If control is : apply identity to target
- If control is : apply to target
Multiple controls:
- If any control is : apply identity to targets
- If all controls are : apply to targets
Common examples
Controlled-X (CNOT):
- (Pauli-X)
- Flips target if control is
- One of the most frequently used two-qubit gates
Controlled-Z:
- (Pauli-Z)
- Applies phase if both qubits are
Controlled-phase ():
- (global phase)
- Applies phase to target if control is
Controlled-rotation (Controlled-):
- Rotates target qubit around Z axis if control is
Doubly-controlled-X (Toffoli/CCX):
- , with two control qubits
- Flips target if both controls are
Circuit implementation
For controlled- with single control and single target:
where .
Decomposition into elementary gates
For arbitrary unitary , decompose using Euler angle decomposition:
where and are single-qubit unitaries. Then:
using controlled-single-qubit gates (easier to implement).
Gate count for controlled-:
- Single-qubit rotations:
- CNOT gates: to depending on and connectivity
Multi-Control implementation
For control qubits and single target, implement controlled-controlled-…-controlled-:
Naive approach: cascade controls
- Total depth:
- Requires ancilla qubits for intermediate phases
- Gate count:
Optimized approach (e.g., Toffoli-based):
- Decompose into Toffoli chains
- Requires Toffoli gates + cleanup
- Depth: with careful scheduling
Applications
Phase estimation:
- Apply controlled- for
- Extract eigenvalues via inverse Fourier transform
- Controlled-unitary is essential subroutine
Shor's factoring algorithm:
- Compute controlled modular exponentiation:
- Find period via phase estimation
- Controlled-unitary enables quantum speedup
Variational quantum algorithms (VQE, QAOA):
- Construct parameterized ansätze with controlled gates
- Hybrid classical-quantum optimization
Quantum simulation:
- Simulate time evolution:
- Use Trotter-Suzuki decomposition with controlled- terms
Controlled-Rotation gates
Controlled-, Controlled-, Controlled-:
- Rotate target qubit around axis if control is
- Parametric angle enables tunable interactions
- Used in QAOA and variational circuits
Multi-Target controlled-unitary
For acting on multiple target qubits with single control:
The unitary acts on all targets simultaneously. Example: controlled-SWAP (Fredkin gate).
Scalability issues
- Gate depth: for control qubits (exponential blowup)
- Ancilla overhead: intermediate states require scratch qubits
- Error accumulation: each added control increases error
- Practical limit: current devices limited to 3–4 control qubits efficiently
Approximations
Approximate controlled-: drop least significant gates to reduce depth
- Trade accuracy for circuit size
- Useful for near-term devices
Relation to other gates
- CX: simplest controlled gate ()
- CCX: doubly-controlled-X
- CSWAP: controlled-SWAP
- Quantum Fourier Transform: uses controlled-rotations
- Phase oracle: marks solutions via controlled-phase
