Hard instance learning for quantum adiabatic prime factorization

Jian Lin, Zhengfeng Zhang, Junping Zhang +1

Prime factorization is a difficult problem with classical computing, whose exponential hardness is the foundation of Rivest-Shamir-Adleman (RSA) cryptography. With programmable qua…