4 citations · 7 across the 4 of their papers we have counts for
6 papers · 1 filter
Deterministic Generation of Arbitrary Fock States via Resonant Subspace Engineering
Shan Jin, Ming Li, Weizhou Cai +10
Deterministic preparation of high-excitation Fock states is a central challenge in bosonic quantum information, with control complexity that generically explodes as the Hilbert spa…
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…
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…
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…
A universal duplication-free quantum neural network
Xiaokai Hou, Guanyu Zhou, Qingyu Li +2
Universality of neural networks describes the ability to approximate arbitrary function, and is a key ingredient to keep the method effective. The established models for universal…
Multi-layer quantum search and inclusion of NP into BQP
Shan Jin, Xiaoting Wang, Bo Li
In this work, we present a multi-layer quantum search method that generates an exponential speedup of the standard Grover's algorithm. As direct applications, any NP problems can b…