4 problems

Quantum closest-vector approximation conjecture. There is no polynomial time quantum algorithm which can approximate the closest vector problem within a polynomial factor.

Let $N$ be a semiprime, and let a prime lattice be constructed together with a closest-vector-problem target dependent on $N$. A lattice point is close to the target when its dista…

Let $n$ be the dimension of a lattice, and let the error probability refer to the approximation produced by the Babai partition. The densest-lattice conjecture. The worst error pro…

Let $P_e$ denote the error probability of a Babai partition. Consider a three-dimensional lattice and a Babai partition constructed from the QR decomposition associated with an obt…