QIO.QioClass

This module defines the functions that can be used run the classical subset of QIO. That is, QIO computations that only use classical unitary operations.

Documentation

newtype UnitaryC

A classical unitary operation is defined as a function that will update the current classical state.

Constructors

U

Fields

• unU :: Int -> HeapMap -> HeapMap

Instances

Monoid UnitaryC

The classical unitary type forms a Monoid

Methods

mempty :: UnitaryC

mappend :: UnitaryC -> UnitaryC -> UnitaryC

mconcat :: [UnitaryC] -> UnitaryC

uRotC :: Qbit -> Rotation -> UnitaryC

A single qubit rotation can be converted into the classical unitary type, if it is indeed classical (otherwise an error is thrown).

uSwapC :: Qbit -> Qbit -> UnitaryC

A swap operation can be defined in the classical unitary type.

uCondC :: Qbit -> (Bool -> UnitaryC) -> UnitaryC

A conditional operation can be defined in the classical unitary type.

uLetC :: Bool -> (Qbit -> UnitaryC) -> UnitaryC

A let operation can be defined in the classical unitary type.

runUC :: U -> UnitaryC

A unitary can be run by converting it into the classical unitary type.

data StateC

A classical state consists of the next free qubit reference, along with a Heap that represents the overall state of the current qubits in scope.

Constructors

StateC

Fields

• fv :: Int
• heap :: HeapMap

initialStateC :: StateC

An initial state is defined as an empty heap, with 0 set as the next free qubit referece

runQStateC :: QIO a -> State StateC a

A QIO computation can be converted into a stateful computation, over a state of type StateC.

runC :: QIO a -> a

We can run a classical QIO computation by converting it into a stateful computation, and evaluating that using the initial state.