activity
20182021
most citedCharacterization of exact one-query quantum algorithms

15 citations · 26 across the 3 of their papers we have counts for

collaborators

6 papers

cs.DB202111 cited

Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Canned Pattern Selection for Large Networks

Zifeng Yuan, Huey Eng Chua, Sourav S Bhowmick +3

Canned patterns (i.e. small subgraph patterns) in visual graph query interfaces (a.k.a GUI) facilitate efficient query formulation by enabling pattern-at-a-time construction mode.…

cs.CC2021

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…

quant-ph2020

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…

quant-ph201915 cited

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…

quant-ph2019

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…

quant-ph2018

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,…