QIO.Qdata

This module defines a type class for quantum data types, as well as some instances of this class for pairs, lists, and quantum integers

Documentation

class Qdata a qa | a -> qa, qa -> a where

The Qdata type class defines the operation a quantum datatype must implement.

Minimal complete definition

mkQ, measQ, letU, condQ

Methods

mkQ :: a -> QIO qa

measQ :: qa -> QIO a

letU :: a -> (qa -> U) -> U

condQ :: qa -> (a -> U) -> U

Instances

Qdata Bool Qbit

The lowest-level instance of Qdata is the relation between Booleans and Qubits.

Methods

mkQ :: Bool -> QIO Qbit

measQ :: Qbit -> QIO Bool

letU :: Bool -> (Qbit -> U) -> U

condQ :: Qbit -> (Bool -> U) -> U

Qdata Int QInt

quantum integers form a quantum data type, relating them to the classical Haskell Int type.

Methods

mkQ :: Int -> QIO QInt

measQ :: QInt -> QIO Int

letU :: Int -> (QInt -> U) -> U

condQ :: QInt -> (Int -> U) -> U

Qdata a qa => Qdata [a] [qa]

A list of quantum data is also a quantum data type

Methods

mkQ :: [a] -> QIO [qa]

measQ :: [qa] -> QIO [a]

letU :: [a] -> ([qa] -> U) -> U

condQ :: [qa] -> ([a] -> U) -> U

(Qdata a qa, Qdata b qb) => Qdata (a, b) (qa, qb)

A pair of quantum data types is itself a quantum data type.

Methods

mkQ :: (a, b) -> QIO (qa, qb)

measQ :: (qa, qb) -> QIO (a, b)

letU :: (a, b) -> ((qa, qb) -> U) -> U

condQ :: (qa, qb) -> ((a, b) -> U) -> U

condQRec :: Qdata a qa => [qa] -> [a -> U] -> U

A recursive conditional on a list of quantum data

qIntSize :: Int

Quantum integers are of a fixed length, which is defined by this constant. Currently, this is set to 4.

newtype QInt

A Quantum integer is a wrapper around a fixed-length list of qubits

Constructors

QInt [Qbit]

Instances

Show QInt

Methods

showsPrec :: Int -> QInt -> ShowS

show :: QInt -> String

showList :: [QInt] -> ShowS

Qdata Int QInt

quantum integers form a quantum data type, relating them to the classical Haskell Int type.

Methods

mkQ :: Int -> QIO QInt

measQ :: QInt -> QIO Int

letU :: Int -> (QInt -> U) -> U

condQ :: QInt -> (Int -> U) -> U

int2bits :: Int -> [Bool]

Convert an integer to a list of Booleans

bits2int :: [Bool] -> Int

Convert a list of Booleans to an integer