Efficient distributed quantum computing

DOI10.1098/rspa.2012.0686zbMath1371.81074arXiv1207.2307OpenAlexW2112813087WikidataQ61155780 ScholiaQ61155780MaRDI QIDQ5362139

D. J. Shepherd, Mark Stather, Aram W. Harrow, Robert Beals, Oliver Gray, Noah Linden, Stephen Brierley, Samuel Kutin

Publication date: 29 September 2017

Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.2307

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (27)

Low-gate quantum golden collision finding ⋮ Optimal parallel quantum query algorithms ⋮ Concurrent multipath quantum entanglement routing based on segment routing in quantum hybrid networks ⋮ Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm ⋮ Distributed Bernstein-Vazirani algorithm ⋮ Optimization of the transmission cost of distributed quantum circuits based on merged transfer ⋮ Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction ⋮ A dynamic programming approach for distributing quantum circuits by bipartite graphs ⋮ Distributed Grover's algorithm ⋮ Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization ⋮ Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective ⋮ Information geometric aspects of probability paths with minimum entropy production for quantum state evolution ⋮ Spatial reference frame agreement in quantum networks ⋮ The cost reduction of distributed quantum factorization circuits ⋮ Improving the teleportation cost in distributed quantum circuits based on commuting of gates ⋮ Low-communication parallel quantum multi-target preimage search ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimized quantum circuit partitioning ⋮ Optimizing teleportation cost in distributed quantum circuits ⋮ Identification protocols and signature schemes based on supersingular isogeny problems ⋮ A proof system for disjoint parallel quantum programs ⋮ An evolutionary approach to optimizing teleportation cost in distributed quantum computation ⋮ Asynchronous reference frame agreement in a quantum network ⋮ Optimal quantum networks and one-shot entropies ⋮ The complexity of quantum circuit mapping with fixed parameters ⋮ Implementing Grover oracles for quantum key search on AES and LowMC

This page was built for publication: Efficient distributed quantum computing