6 papers · 1 filter
Achieving double-logarithmic precision dependence in optimization-based quantum unstructured search
Zhijian Lai, Dong An, Jiang Hu +1
Grover's algorithm is a fundamental quantum algorithm that achieves a quadratic speedup for unstructured search problems of size . Recent studies have reformulated this task as…
A Grover-compatible manifold optimization algorithm for quantum search
Zhijian Lai, Dong An, Jiang Hu +1
Grover's algorithm is a fundamental quantum algorithm that offers a quadratic speedup for the unstructured search problem by alternately applying physically implementable oracle an…
Pauli-structured preconditioning for quantum linear system solvers
Hantao Nie, Zhijian Lai, Dong An
Preconditioning is a fundamental technique for accelerating classical linear system solvers, and understanding when its benefits persist in quantum linear system (QLS) solvers is i…
Quantum circuit design from a retraction-based Riemannian optimization framework
Zhijian Lai, Hantao Nie, Jiayuan Wu +1
Designing quantum circuits for ground state preparation is a fundamental task in quantum information science. However, standard Variational Quantum Algorithms (VQAs) are often cons…
Extended parameter shift rules with minimal derivative variance for parameterized quantum circuits
Zhijian Lai, Jiang Hu, Dong An +1
Parameter shift rules (PSRs) are useful methods for computing arbitrary-order derivatives of the cost function in parameterized quantum circuits. The basic idea of PSRs is to evalu…
Interpolation-based coordinate descent method for parameterized quantum circuits
Zhijian Lai, Jiang Hu, Taehee Ko +2
Parameterized quantum circuits (PQCs) are ubiquitous in the design of hybrid quantum-classical algorithms. In this work, we propose an interpolation-based coordinate descent (ICD)…