Quantum computations are typically performed as a sequence of basic operations, called quantum gates. Different gate sequences, circuits, can implement the same overall computation. Since every additional takes time and introduces noise into system, it is important to find smallest possible circuit that implements given computation, especially for near-term devices execute only limited number g...

In this paper, we discuss five problems which can be solved by using bit-parallel approach in constant time. And, these five problems often occur in many problems such as exact string matching problems and approximation string matching problems. According to the approaches for these five problems, we can solve exact string matching problems and approximation string matching problems more effici...