On the estimate of time complexity of adiabatic calculations on a class of integer lattices

A quantum adiabatic algorithm for solving bounded distance decoding problem (BDD) in special class of integer lattices is investigated. Estimates for the number of qubits required to run this algorithm are obtained. Also we obtain asymptotic running time estimate for this algorithm depending on the bit length of one of the lattice generation parameters.