  The superactivation of zero-capacity quantum channels makes it possible to
use two zero-capacity quantum channels with a positive joint capacity for their
output. Currently, we have no theoretical background to describe all possible
combinations of superactive zero-capacity channels; hence, there may be many
other possible combinations. In practice, to discover such superactive
zero-capacity channel-pairs, we must analyze an extremely large set of possible
quantum states, channel models, and channel probabilities. There is still no
extremely efficient algorithmic tool for this purpose. This paper shows an
efficient algorithmical method of finding such combinations. Our method can be
a very valuable tool for improving the results of fault-tolerant quantum
computation and possible communication techniques over very noisy quantum
channels.
