Hypergraphic partitioning of quantum circuits for distributed quantum computing

• URL: http://arxiv.org/abs/2301.05759v1
• Date: Fri, 13 Jan 2023 21:12:33 GMT
• Title: Hypergraphic partitioning of quantum circuits for distributed quantum computing
• Authors: Waldemir Cambiucci, Regina Melo Silveira, Wilson Vicente Ruggiero
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the context of NISQ computers - Noise Intermediate Scale Quantum, it is a consensus that the distribution of circuits among processing agents is a viable approach to get greater scalability with small machines. This approach can increase the combined computational power at the cost of dedicating qubits to get the communication between partitions. Then comes the challenge of reducing this cost of communication-based on efficient circuit partitioning strategies. In this context, this work aims to reduce the consumption of communication qubits generated during the physical partitioning of quantum circuits in the distributed quantum computing scenario. We present a new method for partitioning quantum circuits in a hypergraphic representation, using a heuristic 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. The expectation is that future experiments with multiple partitions will continue with equal or better results than previous works, supporting distributed quantum computing with machines in heterogeneous processing and communication scenarios.

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 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)
• 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)
• 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)
• 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)
• Qurzon: A Prototype for a Divide and Conquer Based Quantum Compiler [2.8873930745906957]
  This paper introduces textbfQurzon, a proposed novel quantum compiler. It incorporates the marriage of techniques of divide and compute with the state-of-the-art algorithms of optimal qubit placement. A scheduling algorithm is also introduced within the compiler that can explore the power of distributed quantum computing.
  arXiv  Detail & Related papers  (2021-09-15T04:53:04Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• 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)
• 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)
• 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.