A dynamic programming approach for distributing quantum circuits by
bipartite graphs
- URL: http://arxiv.org/abs/2005.01052v1
- Date: Sun, 3 May 2020 11:08:37 GMT
- Title: A dynamic programming approach for distributing quantum circuits by
bipartite graphs
- Authors: Zohreh Davarzani, Mariam Zomorodi-Moghadam, Mahboobeh Houshmand,
Mostafa Nouri-baygi
- Abstract summary: 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.
- Score: 1.3249509346606656
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Near-term large quantum computers are not able to operate as a single
processing unit. It is therefore required to partition a quantum circuit into
smaller parts, and then each part is executed on a small unit. This approach is
known as distributed quantum computation. In this study, a dynamic programming
algorithm is proposed to minimize the number of communications in a distributed
quantum circuit (DQC). This algorithm consists of two steps: first, the quantum
circuit is converted into a bipartite graph model, and then a dynamic
programming approach (DP) is proposed to partition the model into low-capacity
quantum circuits. The proposed approach is evaluated on some benchmark quantum
circuits with remarkable reduction in the number of required teleportations.
Related papers
- Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Resource Bounds for Quantum Circuit Mapping via Quantum Circuit
Complexity [1.0879875537360844]
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) - Dynamic quantum circuit compilation [11.550577505893367]
Recent advancements in quantum hardware have introduced mid-circuit measurements and resets, enabling the reuse of measured qubits.
We present a systematic study of dynamic quantum circuit compilation, a process that transforms static quantum circuits into their dynamic equivalents.
arXiv Detail & Related papers (2023-10-17T06:26:30Z) - 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) - Optimal Partitioning of Quantum Circuits using Gate Cuts and Wire Cuts [1.0507729375838437]
A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations.
Quantum circuit partitioning divides a quantum computation into a set of computations that include smaller-scale quantum (sub)circuits and classical postprocessing steps.
We develop an optimal partitioning method based on recent advances in quantum circuit knitting.
arXiv Detail & Related papers (2023-08-18T13:59:55Z) - 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) - 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) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - Optimized Quantum Circuit Partitioning [2.0779403190197843]
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.
arXiv Detail & Related papers (2020-05-23T22:35:18Z)
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.