Publication Date



Technical Report: UTEP-CS-18-66


In many practical problems, the computation speed of modern computers is not sufficient. Due to the fact that all speeds are bounded by the speed of light, the only way to speed up computations is to further decrease the size of the memory and processing cells that form a computational device. At the resulting size level, each cell will consist of a few atoms -- thus, we need to take quantum effects into account. For traditional computational devices, quantum effects are largely a distracting noise, but new quantum computing algorithms have been developed that use quantum effects to speed up computations. In some problems, however, this expected speed-up may not be sufficient. To achieve further speed-up, we need to parallelize quantum computing. For this, we need to be able to transmit a quantum state from the location of one processor to the location of another one; in quantum computing, this process is known as teleportation. A teleportation algorithm is known, but it is not clear how efficient it is: maybe there are other more efficient algorithms for teleportation? In this paper, we show that the existing teleportation algorithm is, in some reasonable sense, unique -- and thus, optimal.