Distribution of Quantum Circuits Over General Quantum Networks
- URL: http://arxiv.org/abs/2206.06437v1
- Date: Mon, 13 Jun 2022 19:30:48 GMT
- Title: Distribution of Quantum Circuits Over General Quantum Networks
- Authors: Ranjani G Sundaram, Himanshu Gupta, C. R. Ramakrishnan
- Abstract summary: 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.
- Score: 3.7344608362649505
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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. In this work, we consider the problem of distributing
quantum programs represented as quantum circuits across a quantum network of
heterogeneous quantum computers, in a way that minimizes the overall
communication cost required to execute the distributed circuit. We consider two
ways of communicating: cat-entanglement that creates linked copies of qubits
across pairs of computers, and teleportation. The heterogeneous computers
impose constraints on cat-entanglement and teleportation operations that can be
chosen by an algorithm. We first focus on a special case that only allows
cat-entanglements and not teleportations for communication. We provide a
two-step heuristic for solving this specialized setting: (i) finding an
assignment of qubits to computers using Tabu search, and (ii) using an
iterative greedy algorithm designed for a constrained version of the set cover
problem to determine cat-entanglement operations required to execute gates
locally.
For the general case, which allows both forms of communication, we propose
two algorithms that subdivide the quantum circuit into several portions and
apply the heuristic for the specialized setting on each portion. Teleportations
are then used to stitch together the solutions for each portion. Finally, we
simulate our algorithms on a wide range of randomly generated quantum networks
and circuits, and study the properties of their results with respect to several
varying parameters.
Related papers
- A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity [1.0360348400670518]
We show that a minimal SWAP-gate count for executing a quantum circuit on a device emerges via the minimization of the distance between quantum states.
This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing.
arXiv Detail & Related papers (2024-02-01T10:32:05Z) - 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) - Realization of quantum algorithms with qudits [0.7892577704654171]
We review several ideas indicating how multilevel quantum systems, also known as qudits, can be used for efficient realization of quantum algorithms.
We focus on techniques of leveraging qudits for simplifying decomposition of multiqubit gates, and for compressing quantum information by encoding multiple qubits in a single qudit.
These theoretical schemes can be implemented with quantum computing platforms of various nature, such as trapped ions, neutral atoms, superconducting junctions, and quantum light.
arXiv Detail & Related papers (2023-11-20T18:34:19Z) - 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) - Distributing Quantum Circuits Using Teleportations [4.4117707680626514]
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.
arXiv Detail & Related papers (2023-05-31T21:21:37Z) - 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) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z)
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.