We first introduce a method called quantum path verification, where we search for a break in a quantum network. After explaining these capabilities, we address gate internal faults. We present new fault models to represent crosstalk and unwanted nearest neighbor entanglement. When witnessed, these errors are probabilistic, but there is a set of tests that has the highest probability of detecting a fault. We introduce a method of probabilistic set covering to identify this set of tests. A large part of our work consisted of writing a software package that allows us to compare various fault models and test strategies.