Before revision:  This improves over an algorithm of [CCL18] that has the same space complexity  .
After revision:  This improves over an algorithm of [CCL18] that has the same space complexity . The time complexity of our classical and quantum algorithms are obtained using a known upper bound of the kissing number which is 2^{0.402n .