// quantum computing emulation routines using real coefficients
//
// Deutsch-Jozsa problem: determine if a hidden Boolean function is constant or balanced

// classical hidden Boolean function
//
int fx( int x, int N); // 0 <= x <= N-1

// quantum hidden Boolean function
//
void fq( double q[], int M); // q[0]...q[M-1]

// perform Hadamard transformation on all qubits
//
void H( double q[], int M);