We study the robust testability of the tensor product line codes. It is shown that the product of two random linear codes are almost always robustly testable. This result has applications in the field of quantum codes and can be used for constructing efficiently decodable quantum LDPC codes.
