1 citations · 1 across the 5 of their papers we have counts for
Showing 2026 · quant-phShow all
3 papers · 2 filters
quant-ph2026
Quantum Query Complexity of Finding a Tarski Fixed Point on a High-Dimensional Grid
Tongyang Li, Weiran Ma, Ziyi Yang +1
The Knaster-Tarski fixed-point theorem states that every monotone function over a complete lattice has a fixed point. Beyond its fundamental role in order theory, the theorem and i…
quant-ph2026
Quantum Algorithm for Elliptic Curve Discrete Logarithms with Space-Efficient Point Addition
Han Luo, Ziyi Yang, Jingquan Luo +5
The Elliptic Curve Discrete Logarithm Problem (ECDLP) is a fundamental problem in cryptography, and reducing the resource requirements of quantum algorithms for solving ECDLP is an…
quant-ph2026
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…