QLearningOptimizer

Struct QLearningOptimizer 

Source
pub struct QLearningOptimizer { /* private fields */ }
Expand description

Q-learning agent for circuit optimization

Implementations§

Source§

impl QLearningOptimizer

Source

pub fn new( learning_rate: f64, discount_factor: f64, initial_epsilon: f64, ) -> Self

Create a new Q-learning optimizer

§Arguments
  • learning_rate - How quickly the agent learns (0.0 to 1.0)
  • discount_factor - How much future rewards matter (0.0 to 1.0)
  • initial_epsilon - Initial exploration rate (0.0 to 1.0)
Source

pub fn choose_action( &self, state: &CircuitState, available_actions: &[OptimizationAction], ) -> OptimizationAction

Choose action using epsilon-greedy policy

§Arguments
  • state - Current circuit state
  • available_actions - List of actions that can be taken
Source

pub fn update_q_value( &mut self, state: &CircuitState, action: OptimizationAction, reward: f64, next_state: &CircuitState, next_actions: &[OptimizationAction], )

Update Q-value based on observed reward

§Arguments
  • state - Previous state
  • action - Action taken
  • reward - Reward received
  • next_state - New state after action
  • next_actions - Actions available in next state
Source

pub fn calculate_reward( &self, old_state: &CircuitState, new_state: &CircuitState, ) -> f64

Calculate reward for a state transition

Reward is based on improvements in circuit metrics:

  • Reduced depth (+reward)
  • Reduced gate count (+reward)
  • Increased fidelity (+reward)
Source

pub fn finish_episode(&mut self, episode: OptimizationEpisode)

Complete an optimization episode

Source

pub fn get_statistics(&self) -> OptimizationStatistics

Get optimization statistics

Source

pub fn save_q_table(&self, path: &str) -> QuantRS2Result<()>

Save Q-table to file

Source

pub fn load_q_table(&mut self, path: &str) -> QuantRS2Result<()>

Load Q-table from file

Trait Implementations§

Source§

impl Default for QLearningOptimizer

Source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V