19 citations · 33 across the 18 of their papers we have counts for
18 papers
Quantum Approximate Counting with Bernoulli Oracles
Chengshen Gao, Yongzhen Xu, Lvzhou Li
Quantum counting is a fundamental quantum algorithm that estimates the fraction of marked elements using a membership oracle, achieving a quadratic speedup over classical sampling.…
Sparse Quantum State Preparation with Sublinear T-Count
Jingquan Luo, Lvzhou Li
We study the fault-tolerant cost of preparing sparse quantum states, measured by -count in the Clifford+ model. Here an -qubit state is called -sparse if it is supporte…
Quantum states supported by matroids
Xiaowei Huang, Fei Shi, Lijun Zhang +1
In this work, we establish a structural correspondence between quantum states and matroid theory. This connection demonstrates that key properties of quantum states, including enta…
Quantum Algorithm for Elliptic Curve Discrete Logarithms with Space-Efficient Point Addition
Han Luo, Ziyi Yang, Jingquan Luo +5
The Elliptic Curve Discrete Logarithm Problem (ECDLP) is a fundamental problem in cryptography, and reducing the resource requirements of quantum algorithms for solving ECDLP is an…
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,…
Tolerant Quantum Junta Testing
Zhaoyang Chen, Lvzhou Li, Jingquan Luo
Junta testing for Boolean functions has sparked a long line of work over recent decades in theoretical computer science, and recently has also been studied for unitary operators in…
Nearly Optimal Circuit Size for Sparse Quantum State Preparation
Lvzhou Li, Jingquan Luo
Quantum state preparation is a fundamental and significant subroutine in quantum computing. In this paper, we conduct a systematic investigation on the circuit size (the total coun…
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…
Quantum and classical query complexities for determining connectedness of matroids
Xiaowei Huang, Shiguang Feng, Lvzhou Li
Connectivity is a fundamental structural property of matroids, and has been studied algorithmically over 50 years. In 1974, Cunningham proposed a deterministic algorithm consuming…
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…
Concise and Efficient Quantum Algorithms for Distribution Closeness Testing
Lvzhou Li, Jingquan Luo
We study the impact of quantum computation on the fundamental problem of testing the property of distributions. In particular, we focus on testing whether two unknown classical dis…
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…
Playing Mastermind on quantum computers
Lvzhou Li, Jingquan Luo, Yongzhen Xu
From the 1970s up to now, Mastermind, a classic two-player game, has attracted plenty of attention, not only from the public as a popular game, but also from the academic community…
Quantum Speedup and Limitations on Matroid Property Problems
Xiaowei Huang, Jingquan Luo, Lvzhou Li
This paper initiates the study of quantum algorithms for matroid property problems. It is shown that quadratic quantum speedup is possible for the calculation problem of finding th…