Quantumcomputing, Quantum Security, Blockchain Security, Abelian, Lattice.
address GapSVP and SIVP for all n-dimensional lattices within approximation factors of Õ(n⁴.5). There exist poly(n) time quantum algorithms that solve SIVP_γ and GapSVP_γ for all n-dimensional lattices for γ ∈ ˜O(n⁴.5).” This corollary presents the establishment of polynomial-time quantum