3 papers
quant-ph2025
Enhancing the reachability of variational quantum algorithms via input-state design
Shaojun Wu, Shan Jin, Abolfazl Bayat +1
Variational quantum algorithms (VQAs) face an inherent trade-off between expressivity and trainability: deeper circuits can represent richer states but suffer from noise accumulati…
quant-ph2025
An effcient variational quantum Korkin-Zolotarev algorithm for solving shortest vector problems
Xiaokai Hou, Guoqing Zhou, Shan Jin +5
Noisy intermediate-scale quantum cryptanalysis focuses on the capability of near-term quantum devices to solve the mathematical problems underlying cryptography, and serves as a co…
quant-ph2025
Fixed-point quantum continuous search algorithm with optimal query complexity
Shan Jin, Yuhan Huang, Shaojun Wu +4
Continuous search problems (CSPs), which involve finding solutions within a continuous domain, frequently arise in fields such as optimization, physics, and engineering. Unlike dis…