Improving and benchmarking NISQ qubit routers

• URL: http://arxiv.org/abs/2502.03908v1
• Date: Thu, 06 Feb 2025 09:31:51 GMT
• Title: Improving and benchmarking NISQ qubit routers
• Authors: Vicente Pina-Canelles, Adrian Auer, Inés de Vega,
• Abstract summary: We benchmark various routing techniques considering random quantum circuits on one-dimensional and square lattice connectivities. We introduce circuit fidelity as a comprehensive metric that captures the effects of SWAP and circuit depth overheads.
• Score: 0.0
• License:
• Abstract: Quantum computers with a limited qubit connectivity require inserting SWAP gates for qubit routing, which increases gate execution errors and the impact of environmental noise due to an overhead in circuit depth. In this work, we benchmark various routing techniques considering random quantum circuits on one-dimensional and square lattice connectivities, employing both analytical and numerical methods. We introduce circuit fidelity as a comprehensive metric that captures the effects of SWAP and circuit depth overheads. Leveraging a novel approach based on the SABRE algorithm, we achieve up to $84\%$ higher average circuit fidelity for large devices within the NISQ range, compared to previously existing methods. Additionally, our results highlight that the optimal routing choice critically depends on the qubit count and the hardware characteristics, including gate fidelities and coherence times.

Related papers

• 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)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• 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)
• 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)
• A Variation-Aware Quantum Circuit Mapping Approach Based on Multi-agent Cooperation [8.239525962555586]
  We propose a quantum circuit mapping method based on multi-agent cooperation. It consists of two core components: the qubit placement algorithm and the qubit routing method. Compared with the stateof-the-art method, our method can improve the success rate by 25.86% on average and 95.42% at maximum.
  arXiv  Detail & Related papers  (2021-11-17T11:00:02Z)
• 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)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• 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)
• Efficient Qubit Routing for a Globally Connected Trapped Ion Quantum Computer [0.5599792629509227]
  We create a qubit routing algorithm which enables efficient global connectivity in a previously proposed trapped ion quantum computing architecture. We find that for the shuttling parameters used, the trapped ion design has a substantially lower cost associated with connectivity.
  arXiv  Detail & Related papers  (2020-02-28T15:15:35Z)

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.