Struct AdiabaticSchedule 

pub struct AdiabaticSchedule {
    pub charge_recovery: usize,
    pub ancilla: usize,
    pub effect: usize,
    pub control: usize,
}

The adiabatic cell budget of a program — the count of each CellClass its Silicon datapath needs. The charge_recovery fraction is the adiabatic (zero-erasure) share; a program with no ancilla or effect cells is FULLY ADIABATIC — its Landauer floor is 0, since no cell can erase a bit.

Fields

charge_recovery: usize

ancilla: usize

effect: usize

control: usize

Implementations

impl AdiabaticSchedule

pub fn is_fully_adiabatic(&self) -> bool

FULLY ADIABATIC iff the datapath needs no history (ancilla) cell and hits no effect — every instruction charge-recovers or reverses on the trace, so nothing can erase a bit. A sufficient static condition for a Landauer-0 run (the dynamic floor is crate::vm::journal::HistoryTape::landauer_bytes).

pub fn charge_recovery_fraction(&self) -> f64

The fraction of instructions on the zero-erasure charge-recovery datapath (1.0 for empty).

Trait Implementations

impl Clone for AdiabaticSchedule

fn clone(&self) -> AdiabaticSchedule

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for AdiabaticSchedule

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for AdiabaticSchedule

fn default() -> AdiabaticSchedule

Returns the “default value” for a type.

impl PartialEq for AdiabaticSchedule

fn eq(&self, other: &AdiabaticSchedule) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for AdiabaticSchedule

impl Eq for AdiabaticSchedule

impl StructuralPartialEq for AdiabaticSchedule