Optimizing QAOA circuit transpilation with parity twine and SWAP network encodings

• URL: http://arxiv.org/abs/2505.17944v1
• Date: Fri, 23 May 2025 14:20:40 GMT
• Title: Optimizing QAOA circuit transpilation with parity twine and SWAP network encodings
• Authors: J. A. Montanez-Barrera, Yanjun Ji, Michael R. von Spakovsky, David E. Bernal Neira, Kristel Michielsen,
• Abstract summary: This work introduces a method that reduces the two-qubit gate count and depth needed to represent fully connected circuits.<n>For a 120-qubit QAOA instance with 25% connectivity, our method achieves an 85% reduction in depth and a 28% reduction in two-qubit gates.
• Score: 0.3495246564946556
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Mapping quantum approximate optimization algorithm (QAOA) circuits with non-trivial connectivity in fixed-layout quantum platforms such as superconducting-based quantum processing units (QPUs) requires a process of transpilation to match the quantum circuit on the given layout. This step is critical for reducing error rates when running on noisy QPUs. Two methodologies that improve the resource required to do such transpilation are the SWAP network and parity twine chains (PTC). These approaches reduce the two-qubit gate count and depth needed to represent fully connected circuits. In this work, a simulated annealing-based method is introduced that reduces the PTC and SWAP network encoding requirements in QAOA circuits with non-fully connected two-qubit gates. This method is benchmarked against various transpilers and demonstrates that, beyond specific connectivity thresholds, it achieves significant reductions in both two-qubit gate count and circuit depth, surpassing the performance of Qiskit transpiler at its highest optimization level. For example, for a 120-qubit QAOA instance with 25% connectivity, our method achieves an 85% reduction in depth and a 28% reduction in two-qubit gates. Finally, the practical impact of PTC encoding is validated by benchmarking QAOA on the ibm_fez device, showing improved performance up to 20 qubits, compared to a 15-qubit limit when using SWAP networks.

Related papers

• 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)
• TANGO: A Robust Qubit Mapping Algorithm via Two-Stage Search and Bidirectional Look [7.064817742048067]
  Current quantum devices lack full qubit connectivity, making it difficult to directly execute logical circuits on quantum devices.<n>We propose the TANGO algorithm, which balances the impact of qubit mapping on both mapped and unmapped nodes.<n>We show that the algorithm achieves multi-objective co-optimization of gate count and circuit depth across various benchmarks and quantum devices.
  arXiv  Detail & Related papers  (2025-03-10T13:44:16Z)
• An Efficient Iterative Algorithm for Qubit Mapping via Layer-Weight Assignment and Search Space Reduction [7.698997402561804]
  Current quantum devices support interactions only between physically adjacent qubits, preventing quantum circuits from being directly executed on these devices.<n>To minimize the insertion of additional SWAP gates, we propose HAIL, an efficient iterative qubit mapping algorithm.<n>We show that HAIL-3 reduces the number of additional gates inserted in the $mathcalB_23$ by 20.62% compared to state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2025-02-11T13:21:33Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• SPARQ: Efficient Entanglement Distribution and Routing in Space-Air-Ground Quantum Networks [50.91365514137301]
  Space-air-ground quantum (SPARQ) network is developed as a means for providing a seamless on-demand entanglement distribution. Deep reinforcement learning framework is proposed and trained using deep Q-network (DQN) on multiple graphs of SPARQ. Third-party entanglement distribution policy is proposed to establish entanglement between communication parties.
  arXiv  Detail & Related papers  (2024-09-19T16:31:37Z)
• LightSABRE: A Lightweight and Enhanced SABRE Algorithm [39.814077130655505]
  We introduce LightSABRE, a significant enhancement of the SABRE algorithm that advances both runtime efficiency and circuit quality. We have achieved a version of the algorithm in Qiskit 1.2.0 that is approximately 200 times faster than the implementation in Qiskit 0.20.1.
  arXiv  Detail & Related papers  (2024-09-12T19:19:59Z)
• SWAP-less Implementation of Quantum Algorithms [0.0]
  We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity. We leverage the fact that entangling gates not only manipulate quantum states but can also be exploited to transport quantum information.
  arXiv  Detail & Related papers  (2024-08-20T14:51:00Z)
• 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 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)
• 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)
• Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors [48.68474702382697]
  Vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables.
  arXiv  Detail & Related papers  (2023-06-14T13:44:35Z)
• 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)
• 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.