Quantum Algorithms
Quantum algorithms are special sets of instructions designed for quantum computers, which work in a completely different way than regular classical computers. These algorithms can solve certain problems much faster by exploiting fundamental principles of quantum mechanics such as superposition principle and entanglement. They hold promise for speeding up tasks like breaking codes, searching huge databases, and simulating complex molecules, which could lead to breakthroughs in fields like cryptography, drug discovery, and materials science.
At the Center, we explore the development of quantum algorithms for solving real-world optimisation problems such as scheduling tasks, optimizing routes, portfolio management; all of which fall under the complexity category of NP-hard, which are a class of problems that are extremely difficult to solve efficiently with classical approaches.
Principal Investigator: Rick Mukherjee
Fig.1: Quantum algorithm for integer programming taken from [7] in Publications.
Fig.2: Quantum algorithm for travelling salesman problem taken from [10] in Publications.