Quantum Adiabatic Evolution for Pattern Recognition Problem

Quantum pattern recognition algorithm for two-qubit systems has been implemented by quantum adiabatic evolution. We will estimate required running time for this algorithm by means of an analytical solution of time-dependent Hamiltonian since the time complexity of adiabatic quantum evolution is a limitation on the quantum computing. These results can be useful for experimental implementation.