Distributing Quantum Circuits Using Teleportations
- URL: http://arxiv.org/abs/2306.00195v1
- Date: Wed, 31 May 2023 21:21:37 GMT
- Title: Distributing Quantum Circuits Using Teleportations
- Authors: Ranjani G Sundaram, Himanshu Gupta
- Abstract summary: Scalability is one of the most sought-after objectives in the field of quantum computing.
Distributing a quantum circuit across a quantum network is one way to facilitate large computations using current quantum computers.
We consider the problem of distributing a quantum circuit across a network of heterogeneous quantum computers, while minimizing the number of teleportations needed to implement gates spanning multiple computers.
- Score: 4.4117707680626514
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Scalability is currently one of the most sought-after objectives in the field
of quantum computing. Distributing a quantum circuit across a quantum network
is one way to facilitate large computations using current quantum computers. In
this paper, we consider the problem of distributing a quantum circuit across a
network of heterogeneous quantum computers, while minimizing the number of
teleportations (the communication cost) needed to implement gates spanning
multiple computers. We design two algorithms for this problem. The first,
called Local- Best, initially distributes the qubits across the network, then
tries to teleport qubits only when necessary, with teleportations being
influenced by gates in the near future. The second, called Zero- Stitching,
divides the given circuit into sub-circuits such that each sub-circuit can be
executed using zero teleportations and the teleportation cost incurred at the
borders of the sub-circuits is minimal. We evaluate our algorithms over a wide
range of randomly-generated circuits as well as known benchmarks, and compare
their performance to prior work. We observe that our techniques outperform the
prior approach by a significant margin (up to 50%).
Related papers
- Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Distributed Quantum Computation with Minimum Circuit Execution Time over Quantum Networks [3.6949615573696395]
We consider the problem of distributing quantum circuits across a quantum network to minimize the execution time.
The problem entails mapping the circuit qubits to network memories, including within each computer.
We design an efficient algorithm based on an approximation algorithm for the max-quadratic-assignment problem.
arXiv Detail & Related papers (2024-05-13T06:35:51Z) - A Genetic Approach to Minimising Gate and Qubit Teleportations for Multi-Processor Quantum Circuit Distribution [6.207327488572861]
Distributed Quantum Computing (DQC) provides a means for scaling available quantum computation by interconnecting multiple quantum processor units (QPUs)
A key challenge in this domain is efficiently allocating logical qubits from quantum circuits to the physical qubits within QPUs, a task known to be NP-hard.
Traditional approaches have sought to reduce the number of required Bell pairs for executing non-local CNOT operations, a form of gate teleportation.
We introduce a novel meta-heuristic algorithm to minimise the network cost of executing a quantum circuit.
arXiv Detail & Related papers (2024-05-09T16:03:41Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Applying an Evolutionary Algorithm to Minimize Teleportation Costs in Distributed Quantum Computing [3.0846297887400977]
A quantum communication network can be formed by connecting multiple quantum computers (QCs) through classical and quantum channels.
In distributed quantum computing, QCs collectively perform a quantum computation.
In this paper, we propose an evolutionary algorithm for this problem.
arXiv Detail & Related papers (2023-11-30T13:10:28Z) - Towards Distributed Quantum Computing by Qubit and Gate Graph
Partitioning Techniques [1.211184870567714]
We propose two techniques for partitioning large quantum circuits and for distribution to small quantum computers.
Our techniques map a quantum circuit to a graph representation.
We use the SeQUeNCe quantum communication simulator to measure the time required for generating all the entanglements required to execute the distributed circuit.
arXiv Detail & Related papers (2023-10-05T23:21:18Z) - Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices.
circuit cutting techniques enable the distribution of quantum computations through classical communication.
Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots.
We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
arXiv Detail & Related papers (2023-06-21T08:03:34Z) - Oblivious Quantum Computation and Delegated Multiparty Quantum
Computation [61.12008553173672]
We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required.
Exploiting quantum teleportation, we propose a two-server protocol for this task.
Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
arXiv Detail & Related papers (2022-11-02T09:01:33Z) - Distribution of Quantum Circuits Over General Quantum Networks [3.7344608362649505]
Near-term quantum computers can hold only a small number of qubits.
One way to facilitate large-scale quantum computations is through a distributed network of quantum computers.
We consider the problem of distributing quantum programs across a quantum network of heterogeneous quantum computers.
arXiv Detail & Related papers (2022-06-13T19:30:48Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.