Gate teleportation-assisted routing for quantum algorithms

• URL: http://arxiv.org/abs/2502.04138v1
• Date: Thu, 06 Feb 2025 15:18:13 GMT
• Title: Gate teleportation-assisted routing for quantum algorithms
• Authors: Aravind Plathanam Babu, Oskari Kerppo, Andrés Muñoz Moller, Majid Haghparast, Matti Silveri,
• Abstract summary: This work explores the potential of teleported gates to improve qubit routing efficiency. We propose a routing method that is assisted by gate teleportation. We demonstrate depth reduction with gate teleportation-assisted routing in various benchmark algorithms.
• Score: 0.0
• License:
• Abstract: The limited qubit connectivity of quantum processors poses a significant challenge in deploying practical algorithms and logical gates, necessitating efficient qubit mapping and routing strategies. When implementing a gate that requires additional connectivity beyond the native connectivity, the qubit state must be moved to a nearby connected qubit to execute the desired gate locally. This is typically achieved using a series of SWAP gates creating a SWAP path. However, routing methods relying on SWAP gates often lead to increased circuit depth and gate count, motivating the need for alternative approaches. This work explores the potential of teleported gates to improve qubit routing efficiency, focusing on implementation within specific hardware topologies and benchmark quantum algorithms. We propose a routing method that is assisted by gate teleportation. It establishes additional connectivity using gate teleportation paths through available unused qubits, termed auxiliary qubits, within the topology. To optimize this approach, we have developed an algorithm to identify the best gate teleportation connections, considering their potential to reduce the depth of the circuit and address possible errors that may arise from the teleportation paths. Finally, we demonstrate depth reduction with gate teleportation-assisted routing in various benchmark algorithms, including case studies on the compilation of the Deutsch-Jozsa algorithm and the Quantum Approximation Optimization Algorithm (QAOA) for heavy-hexagon topology used in IBM 127-qubit Eagle r3 processors. Our benchmark results show a 10-20 $\%$ depth reduction in the routing of selected algorithms compared to regular routing without using the teleported gate.

Related papers

• Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures [41.39072840772559]
  Route-Forcing is a quantum circuit mapping algorithm that shows an average speedup of $3.7times$. We present a quantum circuit mapping algorithm that shows an average speedup of $3.7times$ compared to the state-of-the-art scalable techniques.
  arXiv  Detail & Related papers  (2024-07-24T14:21:41Z)
• 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)
• High-fidelity parallel entangling gates on a neutral atom quantum computer [41.74498230885008]
  We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel. These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
  arXiv  Detail & Related papers  (2023-04-11T18:00:04Z)
• Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum Computers [45.66259474547513]
  We design quantum circuits by using the standard cell approach borrowed from classical circuit design. We present evidence that, when compared with automatic routing methods, our layout-aware routers are significantly faster and achieve shallower 3D circuits.
  arXiv  Detail & Related papers  (2022-06-10T10:54:46Z)
• Not All SWAPs Have the Same Cost: A Case for Optimization-Aware Qubit Routing [15.018468499770242]
  Near-term NISQ quantum computers and relatively long-term scalable quantum architectures do not offer full connectivity. A quantum compiler needs to perform qubit routing to make the circuit compatible with device layout. In this paper, we observe that the aforementioned qubit routing is not optimal, and qubit routing should textitnot be independent on subsequent gate optimizations.
  arXiv  Detail & Related papers  (2022-05-21T13:36:44Z)
• Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
  Entanglement routing establishes remote entanglement connection between two arbitrary nodes. We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
  arXiv  Detail & Related papers  (2021-11-15T14:07:22Z)
• Qubit Routing using Graph Neural Network aided Monte Carlo Tree Search [0.0]
  Near-term quantum hardware can support two-qubit operations only on the qubits that can interact with each other. We propose a procedure for qubit routing that is architecture agnostic and that outperforms other available routing implementations on various circuit benchmarks.
  arXiv  Detail & Related papers  (2021-04-01T17:08:28Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers [0.0]
  We propose a qubit routing procedure that uses a modified version of the deep Q-learning paradigm. The system is able to outperform the qubit routing procedures from two of the most advanced quantum compilers currently available.
  arXiv  Detail & Related papers  (2020-07-31T10:57:24Z)
• 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)

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.