Evolutionary-Based Circuit Optimization for Distributed Quantum Computing

• URL: http://arxiv.org/abs/2509.08074v1
• Date: Tue, 09 Sep 2025 18:23:26 GMT
• Title: Evolutionary-Based Circuit Optimization for Distributed Quantum Computing
• Authors: Leo Sünkel, Jonas Stein, Gerhard Stenzel, Michael Kölle, Thomas Gabor, Claudia Linnhoff-Popien,
• Abstract summary: We evaluate an evolutionary algorithm (EA) to optimize a given circuit in such a way that it reduces the required communication.<n>We show that it is able to reduce the required global gates by more than 89% while still achieving high fidelity.
• Score: 3.5852827516109564
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we evaluate an evolutionary algorithm (EA) to optimize a given circuit in such a way that it reduces the required communication when executed in the Distributed Quantum Computing (DQC) paradigm. We evaluate our approach for a state preparation task using Grover circuits and show that it is able to reduce the required global gates by more than 89% while still achieving high fidelity as well as the ability to extract the correct solution to the given problem. We also apply the approach to reduce circuit depth and number of CX gates. Additionally, we run experiments in which a circuit is optimized for a given network topology after each qubit has been assigned to specific nodes in the network. In these experiments, the algorithm is able to reduce the communication cost (i.e., number of hops between QPUs) by up to 19%.

Related papers

• Optimized Compilation for Distributed Quantum Computing [1.4190701053683015]
  In many practical applications, quantum algorithms require several qubits, significantly more than those available with current noisy intermediate-scale quantum processors.<n> Distributed quantum computing (DQC) is considered a scalable approach to increasing the number of available qubits for computational tasks.<n>In this work, the focus is on minimizing the use of EPR pairs when the circuit structure allows for multiple non-local gates to utilize a single TeleGate operation.<n>This is achieved by using a greedy algorithm that explores the circuit and groups together the gates that could share an EPR pair while also changing the order of commutative gates when necessary.
  arXiv  Detail & Related papers  (2026-02-27T14:50:59Z)
• Fast and Robust Remote Two-Qubit Gates on Distributed Qubits [13.099136824902303]
  This article proposes and demonstrates a remote quantum geometric gate scheme via parametric modulation.<n>We experimentally realize the rapid remote SWAP and $sqrttextSWAP$ gates with high fidelity, completing operation in about 30 ns.
  arXiv  Detail & Related papers  (2025-11-03T10:12:16Z)
• Neural Guided Sampling for Quantum Circuit Optimization [26.90377134346014]
  Translating a quantum circuit on a specific hardware topology with a reduced set of available gates, also known as transpilation, comes with a substantial increase in the length of the equivalent circuit.<n>One method to address efficient transpilation is based on approaches known from optimization, e.g. by using random sampling and token replacement strategies.<n>Here, we propose in this work 2D neural guided sampling. Thus, given a 2D representation of a quantum circuit, a neural network predicts groups of gates in the quantum circuit, which are likely reducible.
  arXiv  Detail & Related papers  (2025-10-14T12:09:05Z)
• Optimization and Synthesis of Quantum Circuits with Global Gates [44.99833362998488]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• SSR: A Swapping-Sweeping-and-Rewriting Optimizer for Quantum Circuit Transformation [6.585746777304379]
  We propose a Swapping-Sweeping-and-Rewriting algorithm to minimize the depth of QCT circuits.<n>The experimental results demonstrate that our algorithm can significantly reduce the depth of QCT circuits, 26.68% at most and 12.18% on average, across all benchmark circuits.
  arXiv  Detail & Related papers  (2025-03-05T06:52:14Z)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus [0.0]
  We propose a novel Reinforcement Learning (RL) method for optimizing quantum circuits using graph-theoretic simplification rules of ZX-diagrams.<n>We demonstrate the capacity of our approach by comparing it against the best performing ZX-Calculus-based algorithm for the problem in hand.
  arXiv  Detail & Related papers  (2023-12-18T17:59:43Z)
• Evaluating the Practicality of Quantum Optimization Algorithms for Prototypical Industrial Applications [44.88678858860675]
  We investigate the application of the quantum approximate optimization algorithm (QAOA) and the quantum adiabatic algorithm (QAA) to the solution of a prototypical model in this field. We compare the performance of these two algorithms in terms of solution quality, using selected evaluation metrics.
  arXiv  Detail & Related papers  (2023-11-20T09:09:55Z)
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization [41.94295877935867]
  We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-08-29T17:53:08Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Optimized fermionic SWAP networks with equivalent circuit averaging for QAOA [2.3362993651992863]
  We optimize the execution of fermionic SWAP networks for Quantum Approximate Optimization Algorithm (QAOA) We introduce Equivalent Circuit Averaging, which randomizes over degrees of freedom in the quantum circuit compilation. We observe a 60% average reduction in error (total variation distance) for QAOA of depth p = 1 on four transmon qubits on a superconducting quantum processor.
  arXiv  Detail & Related papers  (2021-11-08T15:32:05Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Channel Assignment in Uplink Wireless Communication using Machine Learning Approach [54.012791474906514]
  This letter investigates a channel assignment problem in uplink wireless communication systems. Our goal is to maximize the sum rate of all users subject to integer channel assignment constraints. Due to high computational complexity, machine learning approaches are employed to obtain computational efficient solutions.
  arXiv  Detail & Related papers  (2020-01-12T15:54:20Z)

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.