Skip to main content

Crate tk_pg_greedy_synth

Crate tk_pg_greedy_synth 

Source
Expand description

Greedy synthesis pass for Pauli graphs.

GreedySynthPass lowers a canonical Pauli graph whose operations are grouped into commuting sets. The output contains Clifford gates on individual qubits, Pauli rotations, measurements, resets and entangling gates between two qubits, known as TQEs. ParallelMode controls whether Rayon evaluates candidate costs in parallel.

The pass expects input produced by CanonicalFormPass followed by GroupCommutingOpsPass.

Structs§

GreedySynthPass
Greedily synthesizes a canonical Pauli graph with scalar packed kernels.

Enums§

ParallelMode
Parallelization mode for gate costing.