Quantum algorithms provide a recipe for efficiently solving practical problems on a quantum computer. Well-known examples include Shor's algorithm, which allows us to find the prime factors of a large integer efficiently, and Grover's algorithm, which outperforms a classical search algorithm.
Going hand in hand with computational complexity, the study of quantum algorithms allows us to understand the possibilities of quantum computation. Of particular interest are problems which are difficult to solve on a classical computer, but which can be solved efficiently on a quantum machine. Can we construct efficient algorithms for such problems?
- CQT hosts international conference on quantum communication, measurement and computing
- Presenting CQT's Annual Report for 2015
- Computing with time travel
- "Breakthrough" research in query complexity
- Meet a CQTian: Aarthi Sundaram
- Scheme checks answers to quantum computation
- Double SODA showing from CQT computer scientists
- World's first demonstration of bit commitment performed at CQT
- CQT announces the Quantum Shorts 2012 film competition
- Principal Investigator Rahul Jain awarded University prize