Work

Upper bounding the quantum space complexity for computing class group and principal ideal problem

Year: 2024

Type: article

Abstract: 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 principal ideal problem using the reductions to $S$-unit group computation. We follow the approach of Barbulescu and Poulalion (AFRICACRYPT'23) and the framework given by de Boer, Ducas, and Fehr (EUROCRYPT'20) and Eisentr\"{a}ger, Hallgren, Kitaev, and Song (STOC'14).

Source: Quantum Information and Computation

DOI: 10.26421/qic24.15-16-3

Author: I.-I. Ng

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4407729336

FWCI: 0.149

Cites:

Cited by: 1

Related to: 10