6 citations · 12 across the 4 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
quant-ph2021★ 6 cited
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…
cs.LG2021
Efficiently Training On-Policy Actor-Critic Networks in Robotic Deep Reinforcement Learning with Demonstration-like Sampled Exploration
Zhaorun Chen, Binhao Chen, Shenghan Xie +4
In complex environments with high dimension, training a reinforcement learning (RL) model from scratch often suffers from lengthy and tedious collection of agent-environment intera…