MLQM: Machine Learning Approach for Accelerating Optimal Qubit Mapping

• URL: http://arxiv.org/abs/2412.03249v1
• Date: Wed, 04 Dec 2024 11:49:09 GMT
• Title: MLQM: Machine Learning Approach for Accelerating Optimal Qubit Mapping
• Authors: Wenjie Sun, Xiaoyu Li, Lianhui Yu, Zhigang Wang, Geng Chen, Guowu Yang,
• Abstract summary: We propose a machine learning approach for accelerating optimal qubit mapping (MLQM)<n>First, the method proposes a global search space pruning scheme based on prior knowledge and machine learning.<n>Second, to address the limited availability of effective samples in the learning task, MLQM introduces a novel data augmentation and refinement scheme.
• Score: 13.958125071955742
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum circuit mapping is a critical process in quantum computing that involves adapting logical quantum circuits to adhere to hardware constraints, thereby generating physically executable quantum circuits. Current quantum circuit mapping techniques, such as solver-based methods, often encounter challenges related to slow solving speeds due to factors like redundant search iterations. Regarding this issue, we propose a machine learning approach for accelerating optimal qubit mapping (MLQM). First, the method proposes a global search space pruning scheme based on prior knowledge and machine learning, which in turn improves the solution efficiency. Second, to address the limited availability of effective samples in the learning task, MLQM introduces a novel data augmentation and refinement scheme, this scheme enhances the size and diversity of the quantum circuit dataset by exploiting gate allocation and qubit rearrangement. Finally, MLQM also further improves the solution efficiency by pruning the local search space, which is achieved through an adaptive dynamic adjustment mechanism of the solver variables. Compared to state-of-the-art qubit mapping approaches, MLQM achieves optimal qubit mapping with an average solving speed-up ratio of 1.79 and demonstrates an average advantage of 22% in terms of space complexity.

Related papers

• HAQA: A Hardware-Guided and Fidelity-Aware Strategy for Efficient Qubit Mapping Optimization [13.658067843596733]
  Existing mapping methods overlook intractable quantum hardware fidelity characteristics, reducing circuit execution quality. We propose a novel qubit mapping method HAQA, which integrates hardware fidelity information into the mapping process, enabling fidelity qubit allocation. When applied to state-of-the-art quantum mapping techniques, HAQA achieves acceleration ratios of 632.76 and 286.87 respectively, while improving fidelity by up to 52.69% and 238.28%.
  arXiv  Detail & Related papers  (2025-04-23T07:27:27Z)
• Advancing quantum process tomography through universal compilation [0.0]
  Quantum process tomography (QPT) is crucial for characterizing operations in quantum gates and circuits. Here, we propose a QPT approach based on universal compilation, which systematically decomposes quantum processes into optimized Kraus operators and Choi matrices. We benchmark our approach through numerical simulations of random unitary gates, demonstrating highly accurate quantum process characterization.
  arXiv  Detail & Related papers  (2025-04-21T08:34:33Z)
• 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)
• Scalable quantum dynamics compilation via quantum machine learning [7.31922231703204]
  variational quantum compilation (VQC) methods employ variational optimization to reduce gate costs while maintaining high accuracy. We show that our approach exceeds state-of-the-art compilation results in both system size and accuracy in one dimension ($1$D) For the first time, we extend VQC to systems on two-dimensional (2D) strips with a quasi-1D treatment, demonstrating a significant resource advantage over standard Trotterization methods.
  arXiv  Detail & Related papers  (2024-09-24T18:00:00Z)
• Quantum Circuit Optimization using Differentiable Programming of Tensor Network States [0.0]
  The said algorithm runs on classical hardware and finds shallow, accurate quantum circuits. All circuits achieve high state fidelities within reasonable CPU time and modest memory requirements.
  arXiv  Detail & Related papers  (2024-08-22T17:48:53Z)
• Distributed Quantum Approximate Optimization Algorithm on a Quantum-Centric Supercomputing Architecture [1.953969470387522]
  Quantum approximate optimization algorithm (QAOA) has shown promise in solving optimization problems by providing quantum speedup on gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits. We present a distributed QAOA (DQAOA) which decomposes a large computational workload into smaller tasks that require fewer qubits and shallower circuits.
  arXiv  Detail & Related papers  (2024-07-29T17:42:25Z)
• 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)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Algorithm-Oriented Qubit Mapping for Variational Quantum Algorithms [3.990724104767043]
  Quantum algorithms implemented on near-term devices require qubit mapping due to noise and limited qubit connectivity. We propose a strategy called algorithm-oriented qubit mapping (AOQMAP) that aims to bridge the gap between exact and scalable mapping methods.
  arXiv  Detail & Related papers  (2023-10-15T13:18:06Z)
• 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)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• 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)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• 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.