| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Traq.Primitives.Search.QSearchCFNW
Description
Cost formulas and implementations of the quantum search algorithms in Ref [1].
References:
Synopsis
- newtype QSearchCFNW sizeT precT = QSearchCFNW (PrimSearch sizeT precT)
- data UQSearchEnv sizeT = UQSearchEnv {
- search_arg_type :: VarType sizeT
- pred_call_builder :: Ident -> Ident -> Ident -> UStmt sizeT
- algoQSearchZalka :: forall ext sizeT precT. (Integral sizeT, RealFloat precT, TypingReqs sizeT, sizeT ~ SizeType ext, precT ~ PrecType ext) => FailProb precT -> Ident -> UQSearchBuilder ext ()
- _EQSearch :: forall sizeT precT. (Integral sizeT, Floating precT) => sizeT -> sizeT -> FailProb precT -> precT
- _EQSearchWorst :: forall sizeT precT. (Integral sizeT, Floating precT) => sizeT -> FailProb precT -> precT
- _QSearchZalka :: forall sizeT precT. (Integral sizeT, Floating precT) => sizeT -> FailProb precT -> precT
Search Primitive
newtype QSearchCFNW sizeT precT #
Constructors
| QSearchCFNW (PrimSearch sizeT precT) |
Instances
Unitary Implementation
data UQSearchEnv sizeT #
Information for building QSearch_Zalka
Constructors
| UQSearchEnv | |
Fields
| |
CQ Implementation
Cost Formulas
_EQSearch :: forall sizeT precT. (Integral sizeT, Floating precT) => sizeT -> sizeT -> FailProb precT -> precT #
_EQSearchWorst :: forall sizeT precT. (Integral sizeT, Floating precT) => sizeT -> FailProb precT -> precT #
_QSearchZalka :: forall sizeT precT. (Integral sizeT, Floating precT) => sizeT -> FailProb precT -> precT #