Is it possible to distribute a quantum computer across many sites and still be able to run powerful quantum algorithms with a minimal overhead? One might expect unwanted interference if say, two processor nodes tried to access the same memory location. Work [1] with coworkers from Bristol, Princeton and MIT has demonstrated that the answer is in fact yes. We have provided algorithms for efficiently addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with low overhead by the more realistic model of a distributed quantum computer

Proof of principal experiments connecting two trapped ion processor nodes with an optical fibre have already been successful. Our work provides a theoretical basis for this architecture that is being developed by the UK's quantum computing hub in Oxford.

**Efficient Distributed Quantum Computing**

R. Beals, S. Brierley, O. Gray, A. Harrow, S. Kutin, N. Linden, D. Shepherd and M. Stather

Proc. R. Soc. A 2013 469, 20120686

**Efficient implementation of Quantum circuits with limited qubit interactions**

S. Brierley

arXiv:1507.04263 2015

This webpage was built with Bootstrap and Jekyll. Last updated: Mar 30, 2017