PIRSA:13030104

Video URL

https://pirsa.org/13030104

Efficient Distributed Quantum Computing

Gray, O. (2013). Efficient Distributed Quantum Computing. Perimeter Institute for Theoretical Physics. https://pirsa.org/13030104

Gray, Oliver. Efficient Distributed Quantum Computing. Perimeter Institute for Theoretical Physics, Mar. 11, 2013, https://pirsa.org/13030104 

          @misc{ scivideos_PIRSA:13030104,
            doi = {10.48660/13030104},
            url = {https://pirsa.org/13030104},
            author = {Gray, Oliver},
            keywords = {Quantum Information},
            language = {en},
            title = {Efficient Distributed Quantum Computing},
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2013},
            month = {mar},
            note = {PIRSA:13030104 see, \url{https://scivideos.org/pirsa/13030104}}
          }

Oliver Gray University of Bristol

Talk numberPIRSA:13030104
DOI10.48660/13030104
Source RepositoryPIRSA
Collection
Talk Type Scientific Series
Subject

Abstract

I will explain how to simulate arbitrary quantum circuits on a distributed quantum computer (DQC), in which the pairs of qubits that are allowed to interact are restricted to the edges of some (connected) graph G.  Even for graphs with only a modest number of long-range qubit interactions, such as the hypercube, this simulation is, in fact, efficient.  Furthermore, for all graphs, the emulation scheme is very close to being optimal. Secondly I will present an efficient quantum algorithm for parallel unrestricted memory look-up.  As an application, I will show that the space-time trade off for Element Distinctness and Collision Finding can be improved. Both results arise from applying the ideas of reversible sorting networks to quantum computing.http://arxiv.org/abs/1207.2307