Show simple item record

dc.contributor.authorBeals, Robert
dc.contributor.authorBrierley, Stephen
dc.contributor.authorGray, Oliver
dc.contributor.authorHarrow, Aram W.
dc.contributor.authorKutin, Samuel
dc.contributor.authorLinden, Noah
dc.contributor.authorShepherd, Dan
dc.contributor.authorStather, Mark
dc.date.accessioned2014-07-18T14:47:15Z
dc.date.available2014-07-18T14:47:15Z
dc.date.issued2013-02
dc.identifier.issn1364-5021
dc.identifier.issn1471-2946
dc.identifier.urihttp://hdl.handle.net/1721.1/88440
dc.description.abstractWe 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.sponsorshipNational Science Foundation (U.S.) (Grant 0916400)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant 0829937)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant 0803478)en_US
dc.description.sponsorshipUnited States. Defense Advanced Research Projects Agency (DARPA QuEST contract FA9550-09-1-0044)en_US
dc.description.sponsorshipUnited States. Intelligence Advanced Research Projects Activity (DoI NBC contract no. D11PC20167)en_US
dc.language.isoen_US
dc.publisherRoyal Society, Theen_US
dc.relation.isversionofhttp://dx.doi.org/10.1098/rspa.2012.0686en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleEfficient distributed quantum computingen_US
dc.typeArticleen_US
dc.identifier.citationBeals, 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.departmentMassachusetts Institute of Technology. Center for Theoretical Physicsen_US
dc.contributor.mitauthorHarrow, Aram W.en_US
dc.relation.journalProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciencesen_US
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsBeals, R.; Brierley, S.; Gray, O.; Harrow, A. W.; Kutin, S.; Linden, N.; Shepherd, D.; Stather, M.en_US
dc.identifier.orcidhttps://orcid.org/0000-0003-3220-7682
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record