On the quantum complexity of the continuous hidden subgroup problem
From MaRDI portal
Publication:2119017
DOI10.1007/978-3-030-45724-2_12OpenAlexW2964363198MaRDI QIDQ2119017
Serge Fehr, Léo Ducas, Koen de Boer
Publication date: 23 March 2022
Full work available at URL: https://ir.cwi.nl/pub/30234
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multidimensional Jackson theorem
- New bounds in some transference theorems in the geometry of numbers
- On the shortness of vectors to be found by the ideal-SVP quantum algorithm
- Approx-SVP in ideal lattices with pre-processing
- Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction
- An LLL Algorithm with Quadratic Complexity
- Fast quantum algorithms for computing the unit group and class group of a number field
- Polynomial time quantum algorithm for the computation of the unit group of a number field
- Another Note on the Inclusion L p (μ) ⊂L q (μ)
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Quantum Computation and Lattice Problems
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- Computing a lattice basis from a system of generating vectors
- An LLL-reduction algorithm with quasi-linear time complexity
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Short Stickelberger Class Relations and Application to Ideal-SVP
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Principles of harmonic analysis
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- Functional analysis
This page was built for publication: On the quantum complexity of the continuous hidden subgroup problem
