Distributed Shor's algorithm
Ligang Xiao, Daowen Qiu, Le Luo, Paulo Mateus

TL;DR
This paper introduces a distributed version of Shor's quantum algorithm that uses two quantum computers and quantum teleportation to estimate the order of an integer, reducing qubit count and circuit depth.
Contribution
The paper proposes a novel distributed approach to Shor's algorithm employing quantum teleportation, decreasing qubit requirements and circuit complexity.
Findings
Reduces qubit count by nearly half compared to traditional methods.
Decreases circuit depth per quantum computer.
Maintains high-precision estimation of order.
Abstract
Shor's algorithm is one of the most important quantum algorithm proposed by Peter Shor [Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 124--134]. Shor's algorithm can factor a large integer with certain probability and costs polynomial time in the length of the input integer. The key step of Shor's algorithm is the order-finding algorithm. Specifically, given an -bit integer , we first randomly pick an integer with , the order of modulo is the smallest positive integer such that . The order-finding algorithm in Shor's algorithm first uses quantum operations to obtain an estimation of for some , then is obtained by means of classical algorithms. In this paper, we propose a distributed Shor's algorithm. The difference between our distributed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
