22 citations · 49 across the 7 of their papers we have counts for
7 papers
Deterministic Algorithms for the Hidden Subgroup Problem
Zekun Ye, Lvzhou Li
We consider deterministic algorithms for the well-known hidden subgroup problem (): for a finite group and a finite set , given a function and the…
Sample complexity of hidden subgroup problem
Zekun Ye, Lvzhou Li
The hidden subgroup problem () has been attracting much attention in quantum computing, since several well-known quantum algorithms including Shor algorithm can be de…
Characterization of exact one-query quantum algorithms (ii): for partial functions
Zekun Ye, Lvzhou Li
The query model (or black-box model) has attracted much attention from the communities of both classical and quantum computing. Usually, quantum advantages are revealed by presenti…
Characterization of exact one-query quantum algorithms
Weijiang Chen, Zekun Ye, Lvzhou Li
The quantum query models is one of the most important models in quantum computing. Several well-known quantum algorithms are captured by this model, including the Deutsch-Jozsa alg…
Query complexity of generalized Simon's problem
Zekun Ye, Yunqi Huang, Lvzhou Li +1
Simon's problem plays an important role in the history of quantum algorithms, as it inspired Shor to discover the celebrated quantum algorithm solving integer factorization in poly…
Quantum speedup for twin support vector machines
Zekun Ye, Lvzhou Li, Haozhen Situ +1
We devise new quantum algorithms that exponentially speeds up the training and prediction procedures of twin support vector machines (TSVM). To train TSVMs using quantum methods, w…
A Note on "Quantum Algorithm for Linear Systems of Equations"
Yong-Zhen Xu, Yifan Huang, Zekun Ye +1
Recently, an efficient quantum algorithm for linear systems of equations introduced by Harrow, Hassidim, and Lloyd, has received great concern from the academic community. However,…