Hard instance learning for quantum adiabatic prime factorization
Jian Lin, Zhengfeng Zhang, Junping Zhang, Xiaopeng Li

TL;DR
This paper uses deep reinforcement learning to optimize adiabatic quantum computing configurations, significantly improving success rates on hard prime factorization instances and demonstrating scalability across problem sizes.
Contribution
It introduces a novel RL-based framework for automating the configuration of AQC for prime factorization, enhancing performance and stability on hard instances.
Findings
RL configuration dramatically improves AQC success probability on hard instances
The optimized AQC configuration yields more stable performance across diverse problems
Transfer learning enables scalable AQC configuration from five to nine qubits
Abstract
Prime factorization is a difficult problem with classical computing, whose exponential hardness is the foundation of Rivest-Shamir-Adleman (RSA) cryptography. With programmable quantum devices, adiabatic quantum computing has been proposed as a plausible approach to solve prime factorization, having promising advantage over classical computing. Here, we find there are certain hard instances that are consistently intractable for both classical simulated annealing and un-configured adiabatic quantum computing (AQC). Aiming at an automated architecture for optimal configuration of quantum adiabatic factorization, we apply a deep reinforcement learning (RL) method to configure the AQC algorithm. By setting the success probability of the worst-case problem instances as the reward to RL, we show the AQC performance on the hard instances is dramatically improved by RL configuration. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
