19 citations · 35 across the 10 of their papers we have counts for
10 papers
Deterministic quantum search on all Laplacian integral graphs
Guanzhong Li, Jingquan Luo, Shiguang Feng +1
Searching for an unknown marked vertex on a given graph (also known as spatial search) is an extensively discussed topic in the area of quantum algorithms, with a plethora of resul…
Space-time tradeoff for sparse quantum state preparation
Jingquan Luo, Guanzhong Li, Lvzhou Li
In this work, we investigate the trade-off between the circuit depth and the number of ancillary qubits for preparing sparse quantum states. We prove that any -qubit -spare q…
Quantum phase discrimination with applications to quantum search on graphs
Guanzhong Li, Lvzhou Li, Jingquan Luo
We study the phase discrimination problem, in which we want to decide whether the eigenphase of a given eigenstate with eigenvalue is zero or not,…
Implementation of Continuous-Time Quantum Walk on Sparse Graph
Zhaoyang Chen, Guanzhong Li, Lvzhou Li
Continuous-time quantum walks (CTQWs) play a crucial role in quantum computing, especially for designing quantum algorithms. However, how to efficiently implement CTQWs is a challe…
Revisiting fixed-point quantum search: proof of the quasi-Chebyshev lemma
Guanzhong Li, Shiguang Feng, Lvzhou Li
The original Grover's algorithm suffers from the souffle problem, which means that the success probability of quantum search decreases dramatically if the iteration time is too sma…
Unbounded quantum-classical separation in sample complexity for sphere center finding
Guanzhong Li, Lvzhou Li
Fast quantum algorithms can solve important computational problems more efficiently than classical algorithms. However, little is known about whether quantum computing can speed up…
Derandomization of quantum algorithm for triangle finding
Guanzhong Li, Lvzhou Li
Derandomization is the process of taking a randomized algorithm and turning it into a deterministic algorithm, which has attracted great attention in classical computing. In quantu…
Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problem
Guanzhong Li, Lvzhou Li, Jingquan Luo
This work revisits quantum algorithms for the well-known welded tree problem, proposing a very succinct quantum algorithm based on the simplest coined quantum walks. It simply iter…
Optimal exact quantum algorithm for the promised element distinctness problem
Guanzhong Li, Lvzhou Li
The element distinctness problem is to determine whether a string of elements contains two elements of the same value (a.k.a colliding pair), for which Amb…
Deterministic quantum search with adjustable parameters: implementations and applications
Guanzhong Li, Lvzhou Li
Grover's algorithm provides a quadratic speedup over classical algorithms to search for marked elements in an unstructured database. The original algorithm is probabilistic, return…