We describe the construction of quantum gates (unitary operators) from boolean functions and give a number of applications. Both non-reversible and reversible boolean functions are considered. Computer algebra implementations are provided.
To find the discrete symmetries of a Hamilton operatorˆH is of central importance in quantum theory. Here we describe and implement a brute force method to determine the discrete symmetries given by permutation matrices for Hamilton operators acting in a finite-dimensional Hilbert space. Spin and Fermi systems are considered as examples. A computer algebra… (More)
The core in most genetic algorithms is the bitwise manipulations of bit strings. We show that one can directly manipulate the bits in floating point numbers. This means the main bitwise operations in genetic algorithm mutations and crossings are directly done inside the floating point number. Thus the interval under consideration does not need to be known… (More)