14 citations · 15 across the 4 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
quant-ph2021
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…
cond-mat.quant-gas2021★ 1 cited
Quantum Adiabatic Doping for Atomic Fermi-Hubbard Quantum Simulations
Jue Nan, Jian Lin, Yuchen Luo +2
There have been considerable research efforts devoted to quantum simulations of Fermi-Hubbard model with ultracold atoms loaded in optical lattices. In such experiments, the antife…