2 papers
quant-ph2024
Upper bounding the quantum space complexity for computing class group and principal ideal problem
Iu-Iong Ng
In this paper, we calculate the upper bound on quantum space complexity of the quantum algorithms proposed by Biasse and Song (SODA'16) for solving class group computation and the…
quant-ph2022
Quantum Approximate Counting for Markov Chains and Application to Collision Counting
François Le Gall, Iu-Iong Ng
In this paper we show how to generalize the quantum approximate counting technique developed by Brassard, Høyer and Tapp [ICALP 1998] to a more general setting: estimating the numb…