From the 1 of 9 linked papers with an AI index.
9 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 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 paper presents a quantum algorithm for solving the elliptic curve discrete logarithm problem that uses significantly fewer logical qubits by introducing a space‑efficient rever…
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…
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…
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…