Struct TemplateMatchingPass 

pub struct TemplateMatchingPass { /* private fields */ }

Gate-reduction pass using precomputed equivalence templates.

Iterates through the gate list, tries to match each template at each position, replaces with the shorter equivalent, and repeats until convergence (no further reductions found).

Implementations

impl TemplateMatchingPass

pub fn new(templates: Vec<GateTemplate>) -> Self

Create a pass with the provided set of templates.

pub fn with_standard_templates() -> Self

Create a pass with the standard library of 20+ templates.

Includes:

• Self-inverse cancellations: H·H, X·X, Y·Y, Z·Z, CNOT·CNOT, CZ·CZ, SWAP·SWAP
• Gate composition rules: S·S→Z, T·T→S, T†·T†→S†, Z·Z→I
• Conjugation identities: H·X·H→Z, H·Z·H→X, H·Y·H→Y (global phase)
• Rotation merging: RZ(a)·RZ(b)→RZ(a+b), RX(a)·RX(b)→RX(a+b), RY(a)·RY(b)→RY(a+b)

pub fn run( &self, gates: &[Arc<dyn GateOp + Send + Sync>], ) -> Vec<Arc<dyn GateOp + Send + Sync>>

Run the pass on a gate list, returning the reduced gate list.

Iterates until no further reductions are found (convergence).