Optimal and efficient qubit routing for quantum simulation

• URL: http://arxiv.org/abs/2503.14592v1
• Date: Tue, 18 Mar 2025 18:00:04 GMT
• Title: Optimal and efficient qubit routing for quantum simulation
• Authors: Joris Kattemölle, Guido Burkard,
• Abstract summary: Quantum simulation promises new discoveries in physics, yet on most platforms its progress is limited by device connectivity constraints.<n>Although SWAP can be inserted, their use increases circuit depth, which cannot be tolerated on current quantum computers and increases computational cost on fault-tolerant devices.<n>We introduce and implement a method that leverages this framework to efficiently minimize SWAP overhead. It has a significant scaling advantage, outperforming leading general-purpose approaches by several orders of magnitude even for moderate system sizes.<n>Remarkably, we find solutions with no SWAP overhead, opening the door for current quantum computers to explore geometrically frustrated magnetism.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum simulation promises new discoveries in physics, yet on most platforms its progress is limited by device connectivity constraints. Although SWAP gates can be inserted, their use increases circuit depth, which cannot be tolerated on current quantum computers and increases computational cost on fault-tolerant devices. Therefore, minimizing SWAP overhead is crucial, which, however, leads to a computational problem that is itself intractable. We establish a framework for analyzing spatiotemporally periodic circuits, which naturally occur in the quantum simulation of condensed matter systems and lattice gauge theories. We introduce and implement a method that leverages this framework to efficiently minimize SWAP overhead. It has a significant scaling advantage, outperforming leading general-purpose approaches by several orders of magnitude even for moderate system sizes. Remarkably, we find solutions with no SWAP overhead, opening the door for current quantum computers to explore geometrically frustrated magnetism.

Related papers

• Parallelized Givens Ansatz for Molecular ground-states: Bridging Accuracy and Efficiency on NISQ Platforms [10.562278615096215]
  The utility of the Variational Quantum Eigensolver (VQE) is often hindered by the limitations of current quantum hardware. We propose a low-depth ansatz based on parallelized Givens rotations, which can recover substantial correlation energy. Noiseless simulations using the new ansatz yield ground-state energies comparable to those from the UCCSD ansatz.
  arXiv  Detail & Related papers  (2025-04-25T11:19:21Z)
• CutQAS: Topology-aware quantum circuit cutting via reinforcement learning [0.0]
  We propose CutQAS, a framework that integrates quantum circuit cutting with quantum architecture search (QAS) to enhance quantum chemistry simulations. First, an RL agent explores all possible topologies to identify an optimal circuit structure. Subsequently, a second RL agent refines the selected topology by determining optimal circuit cuts, ensuring efficient execution on constrained hardware.
  arXiv  Detail & Related papers  (2025-04-05T13:13:50Z)
• Solving the Traveling Salesman Problem via Different Quantum Computing Architectures [0.0]
  We study the application of emerging photonic and quantum computing architectures to the Traveling Salesman Problem (TSP)<n>Gate-based quantum computers demonstrated accurate results for small TSP instances in simulation.<n>Ising-based architectures show improved scalability for larger problem sizes.
  arXiv  Detail & Related papers  (2025-02-24T23:37:19Z)
• Error-mitigated Geometric Quantum Control over an Oscillator [2.7382619198694886]
  Quantum information is fragile to environmentally and operationally induced imperfections.<n>We propose a robust scheme based on quantum optimal control via functional theory.<n>Our scheme provides a promising alternative for fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2025-01-24T09:13:24Z)
• A Fast and Adaptable Algorithm for Optimal Multi-Qubit Pathfinding in Quantum Circuit Compilation [0.0]
  This work focuses on multi-qubit pathfinding as a critical subroutine within the quantum circuit compilation mapping problem. We introduce an algorithm, modelled using binary integer linear programming, that navigates qubits on quantum hardware optimally with respect to circuit SWAP-gate depth. We have benchmarked the algorithm across a variety of quantum hardware layouts, assessing properties such as computational runtimes, solution SWAP depths, and accumulated SWAP-gate error rates.
  arXiv  Detail & Related papers  (2024-05-29T05:59:15Z)
• 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)
• Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization [0.8121127831316319]
  We propose a method for constructing quantum circuits which greatly reduces inter-device communication costs. We show that we can construct tractable circuits nearly three times the size of previous QDCA methods while retaining a similar or greater level of quality.
  arXiv  Detail & Related papers  (2024-05-01T20:49:50Z)
• 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)
• 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)
• 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)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
  We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
  arXiv  Detail & Related papers  (2021-08-02T21:36:37Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.