Efficient distributed quantum computing
Name
Harrow_Efficient distributed.pdf
Size
282.97 KB
Format
Adobe PDF
Checksum (MD5)
ed376f336bcef6e4d8d42d2e68f3bb56
Author(s)
Beals, Robert
Brierley, Stephen
Gray, Oliver
Harrow, Aram W.
Kutin, Samuel
Linden, Noah
Shepherd, Dan
Stather, Mark
Date Issued
February 2013
Journal
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Publisher
Royal Society, The
Citation
Beals, R., S. Brierley, O. Gray, A. W. Harrow, S. Kutin, N. Linden, D. Shepherd, and M. Stather. “Efficient Distributed Quantum Computing.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 469, no. 2153 (February 20, 2013): 20120686–20120686.
Version
Original manuscript
Abstract
We provide algorithms for efficiently moving and addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with a low overhead by a more realistic model of a distributed quantum computer. As a result, the circuit model can be used by algorithm designers without worrying whether the underlying architecture supports the connectivity of the circuit. In addition, we apply our results to existing memory-intensive quantum algorithms. We present a parallel quantum search algorithm and improve the time–space trade-off for the element distinctness and collision finding problems.
MIT Department
Massachusetts Institute of Technology. Center for Theoretical Physics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1098/rspa.2012.0686
