Efficient distributed quantum computing
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 with...
Main Authors: | Beals, Robert, Brierley, Stephen, Gray, Oliver, Harrow, Aram W., Kutin, Samuel, Linden, Noah, Shepherd, Dan, Stather, Mark |
---|---|
Other Authors: | Massachusetts Institute of Technology. Center for Theoretical Physics |
Format: | Article |
Language: | en_US |
Published: |
Royal Society, The
2014
|
Online Access: | http://hdl.handle.net/1721.1/88440 https://orcid.org/0000-0003-3220-7682 |
Similar Items
-
Quantum Computational Supremacy
by: Harrow, Aram W., et al.
Published: (2020) -
Efficient Quantum Pseudorandomness
by: Brandão, Fernando G. S. L., et al.
Published: (2018) -
Simulating Large Quantum Circuits on a Small Quantum Computer
by: Peng, Tianyi, et al.
Published: (2021) -
Expected Communication Cost of Distributed Quantum Tasks
by: Anshu, Anurag, et al.
Published: (2020) -
Approximate orthogonality of permutation operators, with application to quantum information
by: Harrow, Aram W.
Published: (2023)