| dc.contributor.author | Beals, Robert | |
| dc.contributor.author | Brierley, Stephen | |
| dc.contributor.author | Gray, Oliver | |
| dc.contributor.author | Harrow, Aram W. | |
| dc.contributor.author | Kutin, Samuel | |
| dc.contributor.author | Linden, Noah | |
| dc.contributor.author | Shepherd, Dan | |
| dc.contributor.author | Stather, Mark | |
| dc.date.accessioned | 2014-07-18T14:47:15Z | |
| dc.date.available | 2014-07-18T14:47:15Z | |
| dc.date.issued | 2013-02 | |
| dc.identifier.issn | 1364-5021 | |
| dc.identifier.issn | 1471-2946 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/88440 | |
| dc.description.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. | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant 0916400) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant 0829937) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant 0803478) | en_US |
| dc.description.sponsorship | United States. Defense Advanced Research Projects Agency (DARPA QuEST contract FA9550-09-1-0044) | en_US |
| dc.description.sponsorship | United States. Intelligence Advanced Research Projects Activity (DoI NBC contract no. D11PC20167) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Royal Society, The | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1098/rspa.2012.0686 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | arXiv | en_US |
| dc.title | Efficient distributed quantum computing | en_US |
| dc.type | Article | en_US |
| dc.identifier.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. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Center for Theoretical Physics | en_US |
| dc.contributor.mitauthor | Harrow, Aram W. | en_US |
| dc.relation.journal | Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | en_US |
| dc.eprint.version | Original manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dspace.orderedauthors | Beals, R.; Brierley, S.; Gray, O.; Harrow, A. W.; Kutin, S.; Linden, N.; Shepherd, D.; Stather, M. | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0003-3220-7682 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
