Because of the expansion of transformations and read/write memory states by tensor products in multidimensional quantum applications, the exponential increase in temporal and spatial complexities constitutes one of the main challenges for quantum computing simulations. Simulation of these systems is very relevant to develop and test new quantum algorithms. In order to overcome the increase in simulation complexity, this work presents reduction and decomposition optimizations for the Distributed Geometric Machine environment. By exploring properties as the sparsity of the Identity operator and partiality of dense unitary transformations, better storage and distribution of quantum information are achieved. The main improvements are reached by decreasing replication and void elements inherited from quantum operators. In the evaluation of this proposal, Hadamard transformations from 21 to 28 qubits and Quantum Fourier Transforms from 26 to 28 qubits were simulated over CPU, sequentially and in parallel, and in graphics processing unit, showing reduced temporal complexity and, consequently, shorter simulation time. Moreover, evaluations of the Shor's algorithm considering 2n C 3 qubits in the order-finding quantum algorithm were simulated up to 25 qubits. When comparing our implementations running on the same hardware with language-integrated quantum operation, academic release version, our new simulator was faster and allowed for the simulation of more qubits. the clever use of the Identity operator (Id-operator) and by splitting independent operations. Instead of executing the QT in a single step, they are divided in sub-QTs, and only the different values from Id-operators are stored.Although the number of steps required for simulation is increased, simulation time is greatly reduced even when steps are sequentially executed. Besides, these sub-steps may be executed in parallel and distributed computations among GPUs. Relative speedups of more than 10,000 were achieved for the most demanding transformations when compared with previous works [2], thus making QC simulation more affordable and interesting for a range of algorithms.Reduction and decomposition optimizations are proposed from design to implementation of quantum algorithms (QAs) in the Distributed Geometric Machine environment (D-GM environment) [3]. By exploring properties as sparsity of the Id-operator and partiality of density unitary transformations, the results achieved present better storage and distribution of quantum information.Additionally, the structure of mixed partial processes [4] preserve control over the increase in the size of read/write memory states in the calculation of a QT, contributing to increase the scalability of QTs and regarding hardware-GPUs memory limit.The main improvements are achieved by decreasing replication and void elements inherited from such operators. In the evaluation of this proposal, Hadamard transformations from 21 to 28 qubits and the Quantum Fourier Transforms from 26 to 28 qubits were both simulated over a sin...