pub struct AdaptiveCompiler { /* private fields */ }Expand description
Main adaptive compilation engine.
AdaptiveCompiler orchestrates a sequence of optimization passes:
- Routing — maps logical qubits to physical qubits using hardware connectivity and calibration data (Dijkstra on the coupling map).
- Native-gate decomposition — replaces non-native gates with sequences of gates supported by the target backend.
- Gate-count optimization — removes identities and cancels adjacent inverse gates found by the graph dependency analysis.
All passes are applied up to config.max_optimization_passes rounds.
Implementations§
Source§impl AdaptiveCompiler
impl AdaptiveCompiler
Sourcepub fn new(config: AdaptiveCompilationConfig) -> Self
pub fn new(config: AdaptiveCompilationConfig) -> Self
Create an AdaptiveCompiler with the given configuration
Sourcepub fn compile<const N: usize>(
&self,
circuit: Circuit<N>,
) -> QuantRS2Result<(Circuit<N>, CompilationSummary)>
pub fn compile<const N: usize>( &self, circuit: Circuit<N>, ) -> QuantRS2Result<(Circuit<N>, CompilationSummary)>
Main compilation entry point.
Applies routing → native-gate decomposition → optimization in a loop
up to max_passes iterations. Returns the (possibly transformed)
circuit together with a summary of applied passes.
Auto Trait Implementations§
impl Freeze for AdaptiveCompiler
impl RefUnwindSafe for AdaptiveCompiler
impl Send for AdaptiveCompiler
impl Sync for AdaptiveCompiler
impl Unpin for AdaptiveCompiler
impl UnsafeUnpin for AdaptiveCompiler
impl UnwindSafe for AdaptiveCompiler
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.