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