Digital Annealer-Assisted Accuracy-First Quantum Circuit Transpilation with Integrated QUBO Mapping and Routing

• URL: http://arxiv.org/abs/2605.11500v1
• Date: Tue, 12 May 2026 04:19:51 GMT
• Title: Digital Annealer-Assisted Accuracy-First Quantum Circuit Transpilation with Integrated QUBO Mapping and Routing
• Abstract summary: In the Noisy Intermediate-Scale Quantum (NISQ) era, limited error rates directly constrain circuit fidelity.<n>We propose a framework the Digital Annealer (DA) via two strategies: (1) Hybrid, which uses DA-driven global initial mapping combined with high qu-speed routing by Qiskit, and (2) Full DA, which solves subproblems within an iterative workflow.<n>Our results indicate that for high-precision where gate noise is the primary bottleneck, DA-assisted global initial placement provides a practical "time-for-" tradeoff for enhancing the utility of near-term quantum hardware.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the Noisy Intermediate-Scale Quantum (NISQ) era, limited qubit counts and high gate error rates directly constrain circuit fidelity, making the minimization of CNOT gate counts crucial. While conventional compilers prioritize heuristic efficiency, there is a compelling need for "accuracy-first" transpilation that prioritizes gate reduction over compilation latency. We propose a framework leveraging the Digital Annealer (DA) via two complementary strategies: (1) Hybrid, which uses DA-driven global initial mapping combined with high-speed heuristic routing by Qiskit, and (2) Full DA, which solves mapping and routing as separate DA-assisted QUBO subproblems within an iterative workflow. Benchmarks demonstrate that our Hybrid approach achieves an average CNOT reduction of 13.7 % (up to 57.4 %) compared to Qiskit's highest optimization level, with the largest gains on structured circuits such as GHZ and ASP where the initial layout is decisive. The Full DA approach matches Hybrid on structured circuits and outperforms ISAAQ by 23.1 % on average (maximum 90.8 %), but degrades on circuits with random or concentrated connectivity - exposing a trade-off between QUBO size and solution quality when the entire circuit is encoded in a single annealing pass. Although these global optimizations incur higher computational overhead than pure heuristics, our results indicate that for high-precision workflows where gate noise is the primary bottleneck, DA-assisted global initial placement provides a practical "time-for-quality" trade-off for enhancing the utility of near-term quantum hardware.

Related papers

• Accelerating Unified Multimodal Models with Core-Expansion Routing and Unified Computation Scheduling [61.28599393707943]
  Unified multimodal models jointly support understanding and generation, but incur substantial redundant computation across tokens, layers, and generation timesteps.<n>We propose a task-shared core scorer and progress-conditioned generation expansions, optimized through generation decomposition and cross-task core alignment.<n> Experiments on two representative UMM architectures demonstrate consistent quality--efficiency improvements across both tasks, retaining 98.03% of dense understanding performance with a 1.93times$ end-to-end inference speedup.
  arXiv  Detail & Related papers  (2026-08-29T14:27:55Z)
• Q-GARS: Quantum-inspired Robust Microservice Chaining Scheduling [0.42970700836450487]
  We propose Q-GARS, a hybrid framework that integrates the QUBO model with Simulated Quantum Annealing (SQA) based search and online rescheduling mechanisms.<n> Simulation results show that Q-GARS achieves an average weighted completion time improvement of 2.1% relative to a greedy baseline of the remaining shortest processing-time.<n>In addition, Q-GARS achieves a mean node resource utilization rate of 0.817, which is 1.1 percentage points above the robust baseline.
  arXiv  Detail & Related papers  (2026-03-24T12:24:51Z)
• AdaFuse: Accelerating Dynamic Adapter Inference via Token-Level Pre-Gating and Fused Kernel Optimization [84.25316984309725]
  Integration of dynamic, sparse structures with parameter-efficient adapters (e.g., LoRA) is a powerful technique for enhancing Large Language Models (LLMs)<n>Despite minimal increases in computational load, the computation latency often skyrockets, leading to decoding speeds slowing by over 2.5 times.<n>AdaFuse is a framework built on a tight co-design between the algorithm and the underlying hardware system to enable efficient dynamic adapter execution.
  arXiv  Detail & Related papers  (2026-03-12T12:46:42Z)
• Scalable Preparation of Matrix Product States with Sequential and Brick Wall Quantum Circuits [0.0]
  Matrix Product States (MPS) admit more efficient constructions when accuracy is traded for circuit complexity.<n>This work introduces an end-to-end MPS preparation framework that combines the strengths of both strategies within a single pipeline.
  arXiv  Detail & Related papers  (2026-02-12T15:07:11Z)
• GANGR: GAN-Assisted Scalable and Efficient Global Routing Parallelization [0.6117371161379208]
  Global routing is a critical stage in electronic design automation (EDA)<n>This paper introduces Wasserstein generative networks (WGANs) to enable more effective parallelization.<n>The proposed algorithm is tested on the latest ISPD'24 contest benchmarks, demonstrating up to 40% reduction with only 0.002% degradation in routing quality as compared to state-of-the-art routers.
  arXiv  Detail & Related papers  (2025-11-21T00:32:33Z)
• Joint Channel Estimation and Computation Offloading in Fluid Antenna-assisted MEC Networks [81.36647816787713]
  We propose an FA-assisted offloading framework to minimize the delay of channel estimation.<n>We show that the proposed system significantly reduces the accuracy under efficient communication.
  arXiv  Detail & Related papers  (2025-09-16T08:48:44Z)
• Optimizing QAOA circuit transpilation with parity twine and SWAP network encodings [0.3495246564946556]
  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.
  arXiv  Detail & Related papers  (2025-05-23T14:20:40Z)
• 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)
• Joint Transmit and Pinching Beamforming for Pinching Antenna Systems (PASS): Optimization-Based or Learning-Based? [89.05848771674773]
  A novel antenna system ()-enabled downlink multi-user multiple-input single-output (MISO) framework is proposed.<n>It consists of multiple waveguides, which equip numerous low-cost antennas, named (PAs)<n>The positions of PAs can be reconfigured to both spanning large-scale path and space.
  arXiv  Detail & Related papers  (2025-02-12T18:54:10Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning [63.83425382922157]
  Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting.
  arXiv  Detail & Related papers  (2022-03-26T20:37:14Z)
• Distributed stochastic optimization with large delays [59.95552973784946]
  One of the most widely used methods for solving large-scale optimization problems is distributed asynchronous gradient descent (DASGD) We show that DASGD converges to a global optimal implementation model under same delay assumptions.
  arXiv  Detail & Related papers  (2021-07-06T21:59:49Z)

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.