Study the complexity of discretec quantum states by defining Fibonacci states

A model of discrete quantum computing is presented in details. The model is proved for two-qubit discrete quantum gates. We investigate discrete quantum gates of more than two qubits. In order to develop the model to apply to n-qubit systems, we need to study the complexity of the states and the gates. Frankly it is very complicated to study the complexity of discrete quantum states, because they grow exponentially. We deffine some general simple arbitrary states to facilitate studying the complexity of disceret quantum states