  Since simulating quantum computers requires exponentially more classical
resources, efficient algorithms are extremely helpful. We analyze algorithms
that create single qubit and specific controlled qubit matrix representations
of gates.
  Additionally, we use the simulator to investigate errors based on different
probability distributions and to investigate the robustness of different
2-qubit multiplier circuits in the presence of operational errors.
