CS 682: Quantum Computing
Project topics
Topic | Students | Presentation slot |
Non local games | Ayush, Gurbaaz and Niket | Friday 2:30 |
Characterization of binary constraint system games | Puja and Supriya | Friday 2:55 |
Lower bound for random access codes | Arpit, Aryan and Soham | Thursday 4:35 |
SuperGrover separation for query complexity | Arka and Subhrojyoti | Thursday 2:55 |
HHL: Solving linear system of equations | Harshit and Saurabh | Thursday 3:20 |
Algorithms for solvable groups | Arpit, Avi and Satyam | Thursday 3:45 |
LWE problem | Anindya and Tufan | Friday 3:20 |
Universal quantum circuits with 3 CNOTs | Ankit and Vipul | Thursday 4:10 |
Quantum PCP conjecture | Kuldeep and Preet | Friday 3:45 |
Subexponential time algorithm for dihedral HSP | Madhavan | Thursday 2:30 |
Quantum Machine Learning | Gourav | Friday 4:10 |
Quantum reinforcement learning | Shiven and Somya | Friday 4:35 |