Coming up with new and efficient algorithm for quantum computing is much harder than developing new classical algorithms because our common sense is based on our daily experiences, which are classical. The quantum speedup is provided by the ability of the quantum computers to process superposition states. All the algorithms also have to comply with the requirement of the reversible logic since quantum gates are unitary operator. Therefore, the development of new algorithms and efficiently implementing the already discovered algorithm is the need of the hour to harvest quantum advantage from computers on the currently available noisy computers. Our group is working on improving the quantum algorithms.
