This method reduces circuit depth and improves execution probability in quantum algorithms using quantum teleportation.
This study proposes a method for parallelising 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.
No takes yet. Share an insight, caveat, or question.
S. S. Sysoev (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: