JIE SUN

Dr. JIE SUN

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 July 2024 in EPJ Quantum Technology
Verified
Journal Article
Open access
PDF file
JSJIE SUN
JIE SUN
DCDunbo Cai
Dunbo Cai
SLSongfeng Lu
Songfeng Lu
LQLing Qian
Ling Qian
RZRunqing Zhang
Runqing Zhang
In this paper, we further verify the validity of the quantum partial adiabatic search algorithm which was initialized in the previous related works by revisiting its quantum circuit model. The main results got here are as follows. When considering implementing quantum partial adiabatic evolution on a quantum circuit, a correction is given for the time slice estimation for the first stage during this approximation in the previous related works, new evidence is provided for a time complexity cost $O(\sqrt{N}/M)$ O ( N / M ) of quantum partial adiabatic algorithm is impossible, and the correct time complexity $O(\sqrt{N/M})$ O ( N / M ) of it is emphasized once more according to its circuit correspondence, in which N is the total number of elements in the search problem of which M of them are the marked ones. The findings exposed are hopeful for revisiting quantum partial adiabatic evolution and its connection with the quantum circuit model.

18 May 2019 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
JSJIE SUN
JIE SUN
SLSongfeng Lu
Songfeng Lu

6 August 2025 in EPJ Quantum Technology
Verified
Journal Article
Open access
PDF file
JSJIE SUN
JIE SUN
HZHui Zheng
Hui Zheng
In this note, we clarify a small problem concerning our recent work “On validity of quantum partial adiabatic search”. The conclusion here is that, the success probability of the quantum partial adiabatic search algorithm in the paper indeed can be bounded by the same quantity as that of early work of Kay’s, even though the Hamiltonian settings in those works are different. This fact is not mentioned in our prior paper, so the purpose here is to explicitly point it out for clarity.

20 May 2024 in International Journal of Quantum Information
Verified
Journal Article
Closed access
JSJIE SUN
JIE SUN

26 March 2026 in Quantum Reports
Verified
Journal Article
Open access
PDF file
JSJIE SUN
JIE SUN
ZZZhimin Zhang
Zhimin Zhang
SLSongfeng Lu
Songfeng Lu
In this paper, we study two aspects of quantum adiabatic evolution for a prototypical search problem: the optimality of the corresponding algorithm and its relation to the quantum circuit model. Firstly, we propose a general framework for proving the square-root speedup of the quantum adiabatic algorithm to be optimal over classical computation, which is readily applicable to the case of multiple targets. Through this framework, we also find that it is possible to further reduce the time complexity by increasing the physical energy of the system, encompassing results from previous works. Secondly, we find that, on the one hand, when the quantum adiabatic algorithm that achieves quadratic speedup is implemented on a quantum circuit, the time slice needed is always consistent with its time complexity, which also encompasses previous results; on the other hand, however, if a further algorithmic improvement is considered, the time slice always remains invariant. This phenomenon represents a significant observation with potential applications. We anticipate that the main results of this paper will interest the quantum adiabatic computation community and may help us to design efficient quantum algorithms for practical problems in the future.

8 January 2026 in Frontiers in Physics
Verified
Journal Article
Open access
PDF file
JSJIE SUN
JIE SUN
HZHui Zheng
Hui Zheng
SLSongfeng Lu
Songfeng Lu
This paper presents a framework for quantum partial adiabatic evolution and applies it to re-examine the well-known quantum search problem. We particularly focus on a detailed analysis of the algorithm’s success probability, which serves as a clear criterion for differentiating valid implementations from invalid ones. Specifically, when the time complexity aligns with the optimal quantum computation, the algorithm achieves a substantially high success probability. Conversely, so-called “improved” versions that exceed the quadratic speedup characteristic of quantum computing exhibit a negligibly low success probability with the increase of target elements. These findings underscore the critical importance of selecting the appropriate evolution interval and the correct method for calculating the success probability in studies of quantum partial adiabatic evolution.