Defining quantum computations using decision tables

Quantum computations can be defined in decision table format by using the keyword "quantum"

During execution the computation defined in a quantum decision table will be sent to a suitable quantum processor (eg IBM)

Note: typically a quantum decision will consist of both conventional and quantum components (for example Shor's algorithm for factorization)

Shor's algorithm consists of two parts:

1. A classical reduction of the factoring problem to the problem of order-finding. This reduction is similar to that used for other factoring algorithms, such as the quadratic sieve.
2. A quantum algorithm to solve the order-finding problem.

Deutsch Algorithm for determining if a function is balanced

)