pub struct AdiabaticUtils;
Expand description
Adiabatic quantum computing utilities
Implementations§
Source§impl AdiabaticUtils
impl AdiabaticUtils
Sourcepub fn create_max_cut_hamiltonian(
graph_edges: &[(usize, usize)],
weights: &[f64],
) -> Hamiltonian
pub fn create_max_cut_hamiltonian( graph_edges: &[(usize, usize)], weights: &[f64], ) -> Hamiltonian
Create Max-Cut problem Hamiltonian
Sourcepub fn create_3sat_hamiltonian(clauses: &[Vec<i32>]) -> Hamiltonian
pub fn create_3sat_hamiltonian(clauses: &[Vec<i32>]) -> Hamiltonian
Create 3-SAT problem Hamiltonian
Sourcepub fn create_tfim_hamiltonian(
num_qubits: usize,
j_coupling: f64,
h_field: f64,
) -> Hamiltonian
pub fn create_tfim_hamiltonian( num_qubits: usize, j_coupling: f64, h_field: f64, ) -> Hamiltonian
Create transverse field Ising model (TFIM) Hamiltonian
Sourcepub fn create_mixing_hamiltonian(num_qubits: usize) -> Hamiltonian
pub fn create_mixing_hamiltonian(num_qubits: usize) -> Hamiltonian
Create mixing Hamiltonian (typically all X)
Sourcepub fn benchmark_adiabatic_qc() -> Result<AdiabaticBenchmarkResults>
pub fn benchmark_adiabatic_qc() -> Result<AdiabaticBenchmarkResults>
Benchmark adiabatic quantum computing
Auto Trait Implementations§
impl Freeze for AdiabaticUtils
impl RefUnwindSafe for AdiabaticUtils
impl Send for AdiabaticUtils
impl Sync for AdiabaticUtils
impl Unpin for AdiabaticUtils
impl UnwindSafe for AdiabaticUtils
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.