pub struct QuantumAlgorithmProfiler {
pub profiler_id: u64,
pub performance_analyzer: QuantumPerformanceAnalyzer,
pub complexity_analyzer: QuantumComplexityAnalyzer,
pub bottleneck_detector: QuantumBottleneckDetector,
pub optimization_advisor: QuantumOptimizationAdvisor,
pub quantum_advantage_calculator: QuantumAdvantageCalculator,
pub resource_monitor: QuantumResourceMonitor,
pub execution_tracer: QuantumExecutionTracer,
pub benchmark_engine: QuantumBenchmarkEngine,
pub profiling_dashboard: ProfilingDashboard,
}
Expand description
Advanced Quantum Algorithm Performance Profiling System
Fields§
§profiler_id: u64
§performance_analyzer: QuantumPerformanceAnalyzer
§complexity_analyzer: QuantumComplexityAnalyzer
§bottleneck_detector: QuantumBottleneckDetector
§optimization_advisor: QuantumOptimizationAdvisor
§quantum_advantage_calculator: QuantumAdvantageCalculator
§resource_monitor: QuantumResourceMonitor
§execution_tracer: QuantumExecutionTracer
§benchmark_engine: QuantumBenchmarkEngine
§profiling_dashboard: ProfilingDashboard
Implementations§
Source§impl QuantumAlgorithmProfiler
Implementation of the Quantum Algorithm Profiler
impl QuantumAlgorithmProfiler
Implementation of the Quantum Algorithm Profiler
Sourcepub fn profile_quantum_algorithm(
&mut self,
algorithm: QuantumAlgorithm,
profiling_config: ProfilingConfiguration,
) -> Result<QuantumProfilingReport, QuantRS2Error>
pub fn profile_quantum_algorithm( &mut self, algorithm: QuantumAlgorithm, profiling_config: ProfilingConfiguration, ) -> Result<QuantumProfilingReport, QuantRS2Error>
Profile quantum algorithm performance
Sourcepub fn benchmark_quantum_algorithm(
&mut self,
algorithm: QuantumAlgorithm,
benchmark_suite: BenchmarkSuite,
) -> Result<QuantumBenchmarkResult, QuantRS2Error>
pub fn benchmark_quantum_algorithm( &mut self, algorithm: QuantumAlgorithm, benchmark_suite: BenchmarkSuite, ) -> Result<QuantumBenchmarkResult, QuantRS2Error>
Execute quantum algorithm benchmarking
Sourcepub fn demonstrate_profiling_advantages(
&mut self,
) -> QuantumProfilingAdvantageReport
pub fn demonstrate_profiling_advantages( &mut self, ) -> QuantumProfilingAdvantageReport
Demonstrate quantum algorithm profiling advantages
Trait Implementations§
Auto Trait Implementations§
impl Freeze for QuantumAlgorithmProfiler
impl RefUnwindSafe for QuantumAlgorithmProfiler
impl Send for QuantumAlgorithmProfiler
impl Sync for QuantumAlgorithmProfiler
impl Unpin for QuantumAlgorithmProfiler
impl UnwindSafe for QuantumAlgorithmProfiler
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> 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<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.