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 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…
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…