4 citations · 7 across the 14 of their papers we have counts for
14 papers
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 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…
Optimal Circuit Size for Fixed-Hamming-Weight Quantum States Preparation
Jingquan Luo, Lvzhou Li
We study the problem of efficiently preparing fixed-Hamming-weight (HW-) quantum states, which are superpositions of -qubit computational basis states with exactly ones.…
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,…
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…
Succinct quantum testers for closeness and -wise uniformity of probability distributions
Jingquan Luo, Qisheng Wang, Lvzhou Li
We explore potential quantum speedups for the fundamental problem of testing the properties of closeness and -wise uniformity of probability distributions. Closeness testing is…
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…
Reliable optimization of arbitrary functions over quantum measurements
Jing Luo, Jiangwei Shang
As the connection between classical and quantum worlds, quantum measurements play a unique role in the era of quantum information processing. Given an arbitrary function of quantum…
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…
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…