| Safe Haskell | None |
|---|
Quipper.Algorithms.QLS.QSignedIntAux
Description
Helper module for Quipper.Algorithms.QLS.QSignedInt: some functions defined with Template Haskell.
Synopsis
- be_boollist_sub :: [Bool] -> [Bool] -> [Bool]
- template_be_boollist_sub :: Circ ([Qubit] -> Circ ([Qubit] -> Circ [Qubit]))
- be_boollist_add :: [Bool] -> [Bool] -> [Bool]
- template_be_boollist_add :: Circ ([Qubit] -> Circ ([Qubit] -> Circ [Qubit]))
- be_boollist_less :: [Bool] -> [Bool] -> Bool
- template_be_boollist_less :: Circ ([Qubit] -> Circ ([Qubit] -> Circ Qubit))
- be_signed_boollist_less :: (Bool, [Bool]) -> (Bool, [Bool]) -> Bool
- template_be_signed_boollist_less :: Circ ((Qubit, [Qubit]) -> Circ ((Qubit, [Qubit]) -> Circ Qubit))
- boollist_is_zero :: [Bool] -> Bool
- template_boollist_is_zero :: Circ ([Qubit] -> Circ Qubit)
- be_signed_boollist_add :: (Bool, [Bool]) -> (Bool, [Bool]) -> (Bool, [Bool])
- template_be_signed_boollist_add :: Circ ((Qubit, [Qubit]) -> Circ ((Qubit, [Qubit]) -> Circ (Qubit, [Qubit])))
Documentation
be_boollist_sub :: [Bool] -> [Bool] -> [Bool] Source #
Subtraction on lists of booleans, understood as big-headian, unsigned integers.
be_boollist_add :: [Bool] -> [Bool] -> [Bool] Source #
Addition on lists of booleans, understood as big-headian, unsigned integers.
be_boollist_less :: [Bool] -> [Bool] -> Bool Source #
Strict ordering on lists of booleans, understood as big-headian unsigned integers. If the lists are not of equal length, the shorter list is treated as if its tail were padded with zeros.
template_be_signed_boollist_less :: Circ ((Qubit, [Qubit]) -> Circ ((Qubit, [Qubit]) -> Circ Qubit)) Source #