From the 1 of 7 linked papers with an AI index.
6 papers · 1 filter
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…
Space-Efficient Quantum Algorithm for Elliptic Curve Discrete Logarithms with Resource Estimation
Han Luo, Ziyi Yang, Ziruo Wang +2
Solving the Elliptic Curve Discrete Logarithm Problem (ECDLP) is critical for evaluating the quantum security of widely deployed elliptic-curve cryptosystems. Consequently, minimiz…
DQC1-completeness of normalized trace estimation for functions of log-local Hamiltonians
Zhengfeng Ji, Tongyang Li, Changpeng Shao +2
We study the computational complexity of estimating the normalized trace for a log-local Hamiltonian acting on qubits. This problem arises naturally in the…
Performance guarantees of light-cone variational quantum algorithms for the maximum cut problem
Xiaoyang Wang, Yuexin Su, Tongyang Li
Variational quantum algorithms (VQAs) are promising to demonstrate the advantage of near-term quantum computing over classical computing in practical applications, such as the maxi…
Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
Yuexin Su, Ziyi Yang, Peiyuan Huang +2
Bandits with knapsacks (BwK) constitute a fundamental model that combines aspects of stochastic integer programming with online learning. Classical algorithms for BwK with a time h…
Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
Tongyang Li, Yuexin Su, Ziyi Yang +1
Maximum cut (MaxCut) on graphs is a classic NP-hard problem. In quantum computing, Farhi, Gutmann, and Goldstone proposed the Quantum Approximate Optimization Algorithm (QAOA) for…