Optimized Quantum Circuit Partitioning
- URL: http://arxiv.org/abs/2005.11614v1
- Date: Sat, 23 May 2020 22:35:18 GMT
- Title: Optimized Quantum Circuit Partitioning
- Authors: Omid Daei, Keivan Navi, Mariam Zomorodi-Moghadam
- Abstract summary: We present a method for generating distributed quantum circuits from monolithic quantum circuits.
Our approach can effectively map a quantum circuit into an appropriate number of distributed components.
- Score: 2.0779403190197843
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The main objective of this paper is to improve the communication costs in
distributed quantum circuits. To this end, we present a method for generating
distributed quantum circuits from monolithic quantum circuits in such a way
that communication between partitions of a distributed quantum circuit is
minimized. Thus, the communication between distributed components is performed
at a lower cost. Compared to existing works, our approach can effectively map a
quantum circuit into an appropriate number of distributed components. Since
teleportation is usually the protocol used to connect components in a
distributed quantum circuit, our approach ultimately reduces the number of
teleportations. The results of applying our approach to the benchmark quantum
circuits determine its effectiveness and show that partitioning is a necessary
step in constructing distributed quantum circuit.
Related papers
- Circuit Partitioning and Transmission Cost Optimization in Distributed Quantum Computing [10.192933940653713]
This paper focuses on the issue of excessive communication complexity in distributed quantum computing.
A circuit partitioning method based on the QUBO model is proposed, coupled with the lookahead method for transmission cost optimization.
arXiv Detail & Related papers (2024-07-08T13:51:27Z) - 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) - Distributed quantum architecture search [0.0]
Variational quantum algorithms, inspired by neural networks, have become a novel approach in quantum computing.
Quantum architecture search tackles this by adjusting circuit structures along with gate parameters to automatically discover high-performance circuit structures.
We propose an end-to-end distributed quantum architecture search framework, where we aim to automatically design distributed quantum circuit structures for interconnected quantum processing units with specific qubit connectivity.
arXiv Detail & Related papers (2024-03-10T13:28:56Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - 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) - Hypergraphic partitioning of quantum circuits for distributed quantum
computing [0.0]
We present a new method for partitioning quantum circuits in a hypergraphic representation, using a partitioning algorithm for this, reducing the number of communication qubits between the partitions.
With this approach, we obtained partial results with a more than 50% reduction in the communication cost generated for the bipartite partitioning against a process done randomly on benchmark circuits.
arXiv Detail & Related papers (2023-01-13T21:12:33Z) - Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
We propose that quantum circuits can be modeled as queuing networks.
Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
arXiv Detail & Related papers (2021-06-26T10:55:52Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - Representation matching for delegated quantum computing [64.67104066707309]
representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network.
We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
arXiv Detail & Related papers (2020-09-14T18:07:43Z) - 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) - A dynamic programming approach for distributing quantum circuits by
bipartite graphs [1.3249509346606656]
Near-term large quantum computers are not able to operate as a single processing unit.
It is required to partition a quantum circuit into smaller parts, and then each part is executed on a small unit.
In this study, a dynamic programming algorithm is proposed to minimize the number of communications in a distributed quantum circuit.
arXiv Detail & Related papers (2020-05-03T11:08:37Z)
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.