Efficient Distributed Quantum Computing

Abstract

We provide 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. 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 problems.

Some material rearranged and references added

References in corpus (24)

• Circuit Quantum Electrodynamics: Coherent Coupling of a Single Photon to a Cooper Pair Box
• Cavity quantum electrodynamics for superconducting electrical circuits: an architecture for quantum computation
• Quantum state transfer and entanglement distribution among distant nodes in a quantum network
• Quantum Amplitude Amplification and Estimation
• Quantum random access memory
• An Elementary Quantum Network of Single Atoms in Optical Cavities
• Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
• Substituting Quantum Entanglement for Communication
• Architectures for a quantum random access memory
• An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
• Layered architecture for quantum computing
• Quantum Circuit Placement
• Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
• Nested quantum search and NP-complete problems
• Arithmetic on a Distributed-Memory Quantum Multicomputer
• Quantum Algorithms for Element Distinctness
• A bridge to lower overhead quantum computation
• Limitations of Noisy Reversible Computation
• Reversible Circuit Optimization via Leaving the Boolean Domain
• Could Grover's quantum algorithm help in searching an actual database?
• On the Effect of Quantum Interaction Distance on Quantum Addition Circuits
• Quantum Algorithms for the Triangle Problem
• How significant are the known collision and element distinctness quantum algorithms?
• String Matching in $\tilde{O}(\sqrt{n}+\sqrt{m})$ Quantum Time

Cited by in corpus (92)

• Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
• Quantum simulation and computing with Rydberg-interacting qubits
• A Crossbar Network for Silicon Quantum Dot Qubits
• Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers
• Distributed Quantum Computing: a Survey
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• Coherent conversion between microwave and optical photons -- an overview of physical implementations
• Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
• Compiling quantum circuits to realistic hardware architectures using temporal planners
• Compiler Design for Distributed Quantum Computing
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Experimental Quantum Communication Enhancement by Superposing Trajectories
• Biology and medicine in the landscape of quantum advantages
• Optimized Quantum Circuit Partitioning
• An integrated microwave-to-optics interface for scalable quantum computing
• How will quantum computers provide an industrially relevant computational advantage in quantum chemistry?
• Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series
• Distributed Quantum Computing and Network Control for Accelerated VQE
• Optimal quantum networks and one-shot entropies
• Long-range big quantum-data transmission
• Two dimensional quantum repeaters
• Quantum codes for quantum simulation of Fermions on a square lattice of qubits
• Optimized compiler for Distributed Quantum Computing
• Two-step approach to scheduling quantum circuits
• Conference key agreement in a quantum network
• Quantum Computing: An Overview Across the System Stack
• Quantum NETwork: from theory to practice
• Generation of arbitrary all-photonic graph states from quantum emitters
• Quantum Information Processing With Integrated Silicon Carbide Photonics
• Practical repeaters for ultra-long distance quantum communication
• Photonic graph state generation from quantum dots and color centers for quantum communications
• Near-term performance of quantum repeaters with imperfect ensemble-based quantum memories
• Multipartite state generation in quantum networks with optimal scaling
• Deterministic quantum state transfer between remote qubits in cavities
• Spin chains for two-qubit teleportation
• Optimization of Lattice Surgery is NP-Hard
• Distributed quantum algorithm for Simon's problem
• Asynchronous Entanglement Routing for the Quantum Internet
• Quantum simulation of real-space dynamics
• A "thoughtful" Local Friendliness no-go theorem: a prospective experiment with new assumptions to suit
• Towards long-distance quantum networks with superconducting processors and optical links
• Scalable quantum memory nodes using nuclear spins in Silicon Carbide
• Hybrid quantum photonics based on artificial atoms placed inside one hole of a photonic crystal cavity
• Information Geometry Aspects of Minimum Entropy Production Paths from Quantum Mechanical Evolutions
• Quantum repeaters based on two species trapped ions
• Exponentially tighter bounds on limitations of quantum error mitigation
• Privacy-preserving quantum federated learning via gradient hiding
• Advantages and limitations of quantum routing
• Optimal local unitary encoding circuits for the surface code
• Landauer Principle and Thermodynamics of Computation
• Scalable repeater architectures for multi-party states
• A Hybrid Rydberg Quantum Gate for Quantum Network
• Hierarchical memories: Simulating quantum LDPC codes with local gates
• Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers
• Blind quantum machine learning with quantum bipartite correlator
• Optimizing Teleportation Cost in Distributed Quantum Circuits
• Multi-tree Quantum Routing in Realistic Topologies
• Distributed Quantum Computing with QMPI
• Parallel Quantum Algorithm for Hamiltonian Simulation
• Measurement-based Multipartite Entanglement Inflation
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
• Quantum Volume for Photonic Quantum Processors
• QRAM: A Survey and Critique
• Effective routing design for remote entanglement generation on quantum networks
• Multiplexed quantum state transfer in waveguides
• Quantum Compression of Tensor Network States
• Broadcasting single-qubit and multi-qubit-entangled states: authentication, cryptography, and distributed quantum computation
• Reference frame agreement in quantum networks
• Efficient quantum computation in a network with probabilistic gates and logical encoding
• Information Geometric Aspects of Probability Paths with Minimum Entropy Production for Quantum State Evolution
• Quantum Advantage in Cryptography with a Low-Connectivity Quantum Annealer
• Diagrammatic technique for simulation of large-scale quantum repeater networks with dissipating quantum memories
• Nearly optimal time-independent reversal of a spin chain
• A quantum walk control plane for distributed quantum computing in quantum networks
• Asynchronous reference frame agreement in a quantum network
• The Complexity of Being Entangled
• Methods for Classically Simulating Noisy Networked Quantum Architectures
• Faster Coherent Quantum Algorithms for Phase, Energy, and Amplitude Estimation
• The simulation of distributed quantum algorithms
• Straddling-gates problem in multipartite quantum systems
• The Min-Entropy of Classical-Quantum Combs for Measurement-Based Applications
• Accelerating variational quantum algorithms with multiple quantum processors
• Scalable Quantum Computational Science: A Perspective from Block-Encodings and Polynomial Transformations
• Tight Quantum Depth Lower Bound for Solving Systems of Linear Equations
• Optimal Coherent Quantum Phase Estimation via Tapering
• Recovery of resources through sequential noisy measurements
• An Evolutionary Approach to Optimizing Communication Cost in Distributed Quantum Computation
• Quantum repeaters based on individual electron spins and nuclear-spin-ensemble memories in quantum dots
• DPRQ: A Dynamic Programming-based Qubit Routing Algorithm for Collective Communication in Distributed Quantum Computing
• Distributed Exact Generalized Grover's Algorithm
• Noise robustness of a multiparty quantum summation protocol
• Block Encoding of Sparse Matrices via Coherent Permutation