On the quantum complexity of the continuous hidden subgroup problem
From MaRDI portal
Recommendations
- The quantum query complexity of the abelian hidden subgroup problem
- The quantum query complexity of the hidden subgroup problem is polynomial
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
- scientific article; zbMATH DE number 1406124
- Quantum measurements for hidden subgroup problems with optimal sample complexity
- On quantum algorithms for noncommutative hidden subgroups
- scientific article; zbMATH DE number 1304334
- Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
- Qubit complexity of continuous problems
- EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
Cites work
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- An LLL algorithm with quadratic complexity
- An LLL-reduction algorithm with quasi-linear time complexity, extended abstract
- Another Note on the Inclusion L p (μ) ⊂L q (μ)
- Approx-SVP in ideal lattices with pre-processing
- Computing a lattice basis from a system of generating vectors
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Fast quantum algorithms for computing the unit group and class group of a number field
- Functional analysis
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1406124 (Why is no real title available?)
- scientific article; zbMATH DE number 2219854 (Why is no real title available?)
- 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
- Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction
- Polynomial time quantum algorithm for the computation of the unit group of a number field
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- Principles of harmonic analysis
- Quantum Computation and Lattice Problems
- Recovering short generators of principal ideals in cyclotomic rings
- Short Stickelberger class relations and application to Ideal-SVP
- The multidimensional Jackson theorem
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(7)- The hidden subgroup problem and post-quantum group-based cryptography
- The quantum query complexity of the abelian hidden subgroup problem
- Algebraic cryptanalysis of a quantum money scheme: the noise-free case
- scientific article; zbMATH DE number 5320411 (Why is no real title available?)
- scientific article; zbMATH DE number 1406124 (Why is no real title available?)
- The special case of cyclotomic fields in quantum algorithms for unit groups
- Extending Regev's quantum algorithm to elliptic curves
This page was built for publication: On the quantum complexity of the continuous hidden subgroup problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2119017)
