Parallelization of Quantum Algorithms Using Quantum Teleportation

This study proposes a method for parallelizing quantum algorithms in the circuit model based on the technique of quantum gate teleportation. The resulting parallel representation of the algorithm has reduced circuit depth and, consequently, a higher probability of correct execution under conditions of increasing quantum state decoherence over time. The reduction in circuit depth is achieved by increasing circuit width, i.e., the number of qubits simultaneously used in the computation.