The quantum GapSVP hardness conjecture
Statement
Let be a lattice of dimension , and let denote the -norm of its shortest nonzero vector. In the promise problem , given a lattice and , one must distinguish from .
Quantum GapSVP hardness conjecture. There is no polynomial-time quantum algorithm that solves to within polynomial factors.
This conjectured hardness is used as a cryptographic and algorithmic-theory basis for the paper's learning hardness results. The source attributes the conjecture to the belief that no polynomial-factor quantum algorithm for GapSVP exists, while noting that known algorithms such as LLL achieve only an exponential approximation factor.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.