Quantum Compilation
Drastically reduce the size of your circuits to allow them to run on next-generation quantum computing hardware. On this page, you will find explanations and implementations of important compilation passes and techniques.
Explore our guide to quantum compilation
(Clifford + T) Gate Set
This target gate set contains S, H, CNOT, and T gates for FTQC.
Pauliopt: Holistic circuit resynthesis using phase polynomials
A holistic approach to phase polynomial based circuit resynthesis
RowCol Algorithm
Maps CNOT circuits to new optimized ones under constrained connectivity.
One-qubit Synthesis
Creates a circuit with three rotations gates from a unitary 2x2 matrix.
Parity Table
The parity table is a representation for the phase polynomial.
Two-qubit Synthesis
Creates a circuit with optimal CNOT gate count from a 4x4 unitary matrix U.
Loop Boundary Optimization
Optimizes redundant operations across loop iterations without unrolling.
ZX-Calculus Intermediate Representation
ZX-calculus is a graphical language that can represent quantum circuits.
Diagonal unitary decomposition
Recursively decompose a diagonal unitary operator.
Control logic decompositions
Discover a collection of decompositions for control logic.
PCPhase decomposition
Decompose projector-controlled phase operators into phase shifts.
Select-U(2) Decomposition
See how to decompose a Select-applied/multiplexed U(2) operator or Pauli rotation.
Lazy Select
Remove complementary control nodes of Select operators.
Parity Matrix Intermediate Representation
The parity matrix describes a circuit containing only CNOT gates.
Partial Select
Remove redundant control nodes from a partial Select operator.
PermRowCol Algorithm
Maps CNOT circuits to new optimized ones under constrained connectivity and dynamic qubit allocation.
Phase gradient
Learn about phase gradient states and their use.
Unary Iteration
Reduce the cost of Select operators via caching.
Pauli-Based Computation
A universal model of quantum computing consisting of Pauli product measurements and Pauli product rotations.
Efficient Adjoint Operations
Make adjoint operations more efficient with measurements.
Pauli Frame Tracking
Learn how Pauli frame tracking works.
Pauli Product Rotations
Pauli product rotation representations of common static and parametrized gates and subroutines.
Phase Polynomial Intermediate Representation
See a modern overview of phase polynomials and how they are utilized in various contexts in quantum compilation.
Swap Network
Build an efficient Swap network.