Quantum circuit optimization for multiple QPUs using local structure

• URL: http://arxiv.org/abs/2206.09938v2
• Date: Thu, 8 Sep 2022 14:05:44 GMT
• Title: Quantum circuit optimization for multiple QPUs using local structure
• Authors: Edwin Tham, Ilia Khait, Aharon Brodutch
• Abstract summary: Interconnecting clusters of qubits will be an essential element of scaling up future quantum computers. We consider a simple strategy of using EPR-mediated remote gates and teleporting qubits between clusters as necessary. We find significant improvements in circuit depth and interconnect usage.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Interconnecting clusters of qubits will be an essential element of scaling up future quantum computers. Operations between quantum processing units (QPUs) are usually significantly slower and costlier than those within a single QPU, so usage of the interconnect must be carefully managed. This is loosely analogous to the need to manage shared caches or memory in classical multi-CPU machines. Unlike classical clusters, however, quantum data is subject to the no-cloning theorem, which necessitates a rethinking of cache coherency strategies. Here, we consider a simple strategy of using EPR-mediated remote gates and teleporting qubits between clusters as necessary. Crucially, we develop optimizations at compile-time that leverage local structure in a quantum circuit, so as to minimize inter-cluster operations at runtime. We benchmark our approach against existing quantum compilation and optimization routines, and find significant improvements in circuit depth and interconnect usage.

Related papers

• ECDQC: Efficient Compilation for Distributed Quantum Computing with Linear Layout [6.382954852270525]
  We propose an efficient compilation method for distributed quantum computing (DQC) using the Linear Nearest Neighbor (LNN) architecture. Our approach significantly decreases compilation time, gate count, and circuit depth, improving robustness for large-scale quantum computations.
  arXiv  Detail & Related papers  (2024-10-31T12:07:46Z)
• Attention-Based Deep Reinforcement Learning for Qubit Allocation in Modular Quantum Architectures [1.8781124875646162]
  This research contributes to the advancement of scalable quantum computing systems by introducing a novel learning-based approach for efficient quantum circuit compilation and mapping. In this work, we propose a novel approach employing Deep Reinforcement Learning (DRL) methods to learn theses for a specific multi-core architecture.
  arXiv  Detail & Related papers  (2024-06-17T12:09:11Z)
• 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)
• A Modular Quantum Compilation Framework for Distributed Quantum Computing [0.0]
  Distributed Quantum Computing is a scalable approach for increasing the number of available qubits for computational tasks. We present a modular quantum compilation framework for DQC that takes into account both network and device constraints. We also devised a strategy for remote scheduling that can exploit both TeleGate and TeleData operations.
  arXiv  Detail & Related papers  (2023-05-04T16:13:23Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• ScaleQC: A Scalable Framework for Hybrid Computation on Quantum and Classical Processors [25.18520278107402]
  Quantum processing unit (QPU) has to satisfy highly demanding quantity and quality requirements on its qubits. Quantum circuit cutting techniques cut and distribute a large quantum circuit into multiple smaller subcircuits feasible for less powerful QPUs. Our tool, called ScaleQC, addresses the bottlenecks by developing novel algorithmic techniques.
  arXiv  Detail & Related papers  (2022-07-03T01:44:31Z)
• 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)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• 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)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)

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.