Pith. sign in

REVIEW

MLQM: Machine Learning Approach for Accelerating Optimal Qubit Mapping

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.03249 v1 pith:IXTZGSSB submitted 2024-12-04 quant-ph cs.ET

MLQM: Machine Learning Approach for Accelerating Optimal Qubit Mapping

classification quant-ph cs.ET
keywords mappingquantummlqmqubitlearningcircuitmachineoptimal
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.