19 citations · 33 across the 18 of their papers we have counts for
4 papers · 1 filter
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…