To increase the probability of obtaining the correct answer in BQP (Bounded-error Quantum Polynomial time) algorithms, several techniques and strategies can be employed. BQP is a class of problems that can be efficiently solved on a quantum computer with a bounded error probability. In this field of quantum complexity theory, it is important to understand