Skip to main content

tk_pg_greedy_synth/
lib.rs

1//! Greedy synthesis pass for Pauli graphs.
2//!
3//! [`GreedySynthPass`] lowers a canonical Pauli graph whose operations are
4//! grouped into commuting sets. The output contains Clifford gates on
5//! individual qubits, Pauli rotations, measurements, resets and entangling
6//! gates between two qubits, known as TQEs. [`ParallelMode`] controls whether
7//! Rayon evaluates candidate costs in parallel.
8//!
9//! The pass expects input produced by `CanonicalFormPass` followed by
10//! `GroupCommutingOpsPass`.
11
12#![cfg_attr(feature = "unstable_simd", feature(portable_simd))]
13#![expect(clippy::upper_case_acronyms)]
14#![expect(clippy::too_many_arguments)]
15mod backend;
16mod frontier;
17mod packed_pg_slice;
18mod reducer;
19mod synthesis;
20mod tqe;
21mod utils;
22
23#[cfg(feature = "unstable_simd")]
24pub use synthesis::GreedySynthSimdPass;
25pub use synthesis::{GreedySynthPass, ParallelMode};