| 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 size prec = QSearchCFNW (PrimSearch size prec)
- data UQSearchEnv size = UQSearchEnv {
- search_arg_type :: VarType size
- pred_call_builder :: Arg size -> Arg size -> Arg size -> UStmt size
- algoQSearchZalka :: forall ext size prec. (Integral size, RealFloat prec, TypingReqs size, size ~ SizeType ext, prec ~ PrecType ext) => FailProb prec -> Ident -> Ident -> UQSearchBuilder ext ()
- groverK :: forall size. MetaParam size -> (Ident, VarType size) -> Ident -> (Ident -> Ident -> UStmt size) -> UStmt size
- _EQSearch :: forall size prec. (Integral size, Floating prec) => size -> size -> FailProb prec -> prec
- _EQSearchWorst :: forall size prec. (Integral size, Floating prec) => size -> FailProb prec -> prec
- _QSearchZalka :: forall size prec. (Integral size, Floating prec) => size -> FailProb prec -> prec
Search Primitive
newtype QSearchCFNW size prec #
Constructors
| QSearchCFNW (PrimSearch size prec) |
Instances
Unitary Implementation
data UQSearchEnv size #
Information for building QSearch_Zalka
Constructors
| UQSearchEnv | |
Fields
| |
CQ Implementation
Arguments
| :: forall size. MetaParam size | number of rounds |
| -> (Ident, VarType size) | the element and type to search for. |
| -> Ident | the output bit |
| -> (Ident -> Ident -> UStmt size) | run the predicate |
| -> UStmt size |
Run K grover iterations
Cost Formulas
_EQSearch :: forall size prec. (Integral size, Floating prec) => size -> size -> FailProb prec -> prec #
_EQSearchWorst :: forall size prec. (Integral size, Floating prec) => size -> FailProb prec -> prec #
_QSearchZalka :: forall size prec. (Integral size, Floating prec) => size -> FailProb prec -> prec #