Struct NeutralAtomQC

Source
pub struct NeutralAtomQC {
    pub tweezers: Vec<OpticalTweezer>,
    pub qubit_map: FxHashMap<QubitId, usize>,
    pub lasers: HashMap<String, LaserSystem>,
    pub state: Array1<Complex64>,
    pub num_qubits: usize,
    pub global_phase: f64,
    pub error_model: NeutralAtomErrorModel,
}
Expand description

Neutral atom quantum computer platform

Fields§

§tweezers: Vec<OpticalTweezer>

Array of optical tweezers

§qubit_map: FxHashMap<QubitId, usize>

Map from qubit ID to tweezer index

§lasers: HashMap<String, LaserSystem>

Laser systems for different transitions

§state: Array1<Complex64>

Current quantum state (simplified representation)

§num_qubits: usize

Number of qubits

§global_phase: f64

Global phase accumulation

§error_model: NeutralAtomErrorModel

Error model parameters

Implementations§

Source§

impl NeutralAtomQC

Source

pub fn new(num_qubits: usize) -> Self

Create a new neutral atom quantum computer

Source

pub fn load_atoms(&mut self, species: AtomSpecies) -> QuantRS2Result<usize>

Load atoms into the tweezer array

Source

pub fn rearrange_atoms(&mut self) -> QuantRS2Result<()>

Perform atom rearrangement to fill gaps

Source

pub fn apply_single_qubit_gate( &mut self, qubit: QubitId, gate_matrix: &Array2<Complex64>, ) -> QuantRS2Result<()>

Apply single-qubit rotation gate

Source

pub fn apply_rydberg_gate( &mut self, control: QubitId, target: QubitId, ) -> QuantRS2Result<()>

Apply two-qubit Rydberg gate

Source

pub fn measure_qubit(&mut self, qubit: QubitId) -> QuantRS2Result<u8>

Measure a qubit

Source

pub fn loaded_atom_count(&self) -> usize

Get number of loaded atoms

Source

pub fn get_probabilities(&self) -> Vec<f64>

Get quantum state probabilities

Source

pub fn reset(&mut self)

Reset to ground state

Source

pub fn get_atom_positions(&self) -> Vec<(QubitId, Position3D, bool)>

Get atom positions for visualization

Trait Implementations§

Source§

impl Debug for NeutralAtomQC

Source§

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

Formats the value using the given formatter. 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