QUIDD-BASED QUANTUM COMPUTER MODELING
Creating algorithms for quantum computing requires the ability to verify their results through the use of physical or mathematical models of quantum computer. Mathematical models are available to any developer, but their efficiency is too low to simulate the register with volume more than 12 bits. This article describes the structure and algorithms of developed 2-level model of increased efficiency. The enhanced algorithms for permutation of q-bits and QuIDD-graph synthesis by removing the bits of index of original matrix elements are proposed. The direction for further optimization for QuIDD techniques are defined.