Skip to main content

BloqTemplate

Struct BloqTemplate 

Source
pub struct BloqTemplate {
    pub circuit: CoordCircuit,
    pub detectors: Vec<TemplateDetector>,
    pub repeat_states: Vec<TemplateRepeatState>,
    pub boundary_flows: Vec<Flow>,
    pub restarts: Vec<TemplateRestart>,
    /* private fields */
}
Expand description

A reusable circuit template and its local side tables.

Together they form the connection interface a persisted .bloq is edited against. Pooled and shared by TemplateId; a TemplateInstance places one at an offset.

Fields§

§circuit: CoordCircuit

The template’s circuit, in template-local qubit coordinates.

§detectors: Vec<TemplateDetector>

Detectors closing entirely within this template.

§repeat_states: Vec<TemplateRepeatState>

Loop-carried detector recurrences for the circuit’s repeat bodies.

§boundary_flows: Vec<Flow>

The template’s residual open flows — the only detectors instance lowering must compose, since they close against a temporally adjacent node. The retained connection interface that makes a persisted .bloq editable (load → edit → recompose).

A flat list of fused boundary chains: each is one maximal open chain spliced into a single start -> end flow carrying all its measurements, in template-measurement-id space. Cross-chunk chains are threaded once at build time, so entries are mutually independent (no entry’s end is another’s start). A loop’s recurrence lives in repeat_states, not here. Computed by the lowering flow pass and deduped per signature.

§restarts: Vec<TemplateRestart>

Restart syndromes for RepeatUntilSuccess regions instantiating this template. The executor evaluates them after each sandboxed attempt.

Implementations§

Source§

impl BloqTemplate

Source

pub fn flatten(&self) -> Result<BloqTemplate, FlattenError>

This template with every repeat block flattened away (see the module docs): the circuit unrolled, repeat-scoped detectors expanded into one top-level detector per iteration, loop-carried states resolved and repeat_states cleared. Detector coordinates are copied verbatim per iteration, matching what the emitter writes for each pass over a repeat body. boundary_flows pass through unchanged: they name final occurrences, which keep their ids.

A template without repeats (and without loop-state references) round trips unchanged.

§Errors

Returns FlattenError for invalid loop-state references, malformed repeat bodies, or exhausted expansion limits.

Source

pub fn flatten_with_limits( &self, limits: FlattenLimits, ) -> Result<BloqTemplate, FlattenError>

Self::flatten with one allowance for circuit expansion and side-table replay, including substituted loop-state parity terms.

§Errors

Returns FlattenError under the same conditions as Self::flatten, including when limits is exhausted.

Source§

impl BloqTemplate

Source

pub fn new(circuit: CoordCircuit) -> Self

Create a template containing only circuit.

Source

pub fn with_parts( circuit: CoordCircuit, detectors: Vec<TemplateDetector>, repeat_states: Vec<TemplateRepeatState>, boundary_flows: Vec<Flow>, restarts: Vec<TemplateRestart>, ) -> Self

Create a template with all side tables supplied explicitly.

Source

pub fn qubits(&self) -> &[IVec2]

The circuit’s qubits, computed once per template (the circuit walk is expensive and footprint queries re-visit templates heavily).

Trait Implementations§

Source§

impl Clone for BloqTemplate

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for BloqTemplate

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<'de> Deserialize<'de> for BloqTemplate

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl PartialEq for BloqTemplate

Source§

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

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl Serialize for BloqTemplate

Source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. 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
§

impl<T, BorrowedSelf> BitwiseMutViaBorrow<BorrowedSelf> for T
where T: BorrowMut<BorrowedSelf>, BorrowedSelf: BitwiseMut + ?Sized,

§

fn assign_index(&mut self, index: usize, to: bool)

§

fn negate_index(&mut self, index: usize)

§

fn clear_bits(&mut self)

§

fn assign_random( &mut self, bit_count: usize, random_number_generator: &mut impl RngExt, )
where BorrowedSelf: BitLength,

§

impl<Bits, Other, BorrowedSelf, BorrowedOther> BitwisePairMutViaBorrow<Other, BorrowedSelf, BorrowedOther> for Bits
where Bits: BorrowMut<BorrowedSelf> + ?Sized, Other: Borrow<BorrowedOther> + ?Sized, BorrowedSelf: Bitwise + BitwisePairMut<BorrowedOther> + ?Sized, BorrowedOther: Bitwise + ?Sized,

§

fn assign(&mut self, other: &Other)

§

fn bitxor_assign(&mut self, other: &Other)

§

fn bitand_assign(&mut self, other: &Other)

§

fn bitor_assign(&mut self, other: &Other)

§

impl<T, Other, BorrowedSelf, BorrowedOther> BitwisePairViaBorrow<Other, BorrowedSelf, BorrowedOther> for T
where T: Borrow<BorrowedSelf> + ?Sized, Other: Borrow<BorrowedOther> + ?Sized, BorrowedSelf: Bitwise + BitwisePair<BorrowedOther> + ?Sized, BorrowedOther: Bitwise + ?Sized,

§

fn dot(&self, other: &Other) -> bool

§

fn and_weight(&self, other: &Other) -> usize

§

fn or_weight(&self, other: &Other) -> usize

§

fn xor_weight(&self, other: &Other) -> usize

§

impl<T, BorrowedSelf> BitwiseViaBorrow<BorrowedSelf> for T
where T: Borrow<BorrowedSelf>, BorrowedSelf: Bitwise + ?Sized,

§

fn index(&self, index: usize) -> bool

§

fn weight(&self) -> usize

§

fn parity(&self) -> bool

§

fn is_zero(&self) -> bool

§

fn is_unit(&self, index: usize) -> bool

§

fn support<'a>(&'a self) -> impl SortedIterator
where BorrowedSelf: 'a,

§

fn max_support(&self) -> Option<usize>

§

fn min_support(&self) -> Option<usize>

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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.