A course on computing and quantum computing emphasizing the theory and foundations. The course begins with advanced topics in the theory of computing (Turing Machines, undecidability, complexity and Boolean circuits, NP-completeness). The course then covers the foundations of Quantum Computing addressing the fundamental questions of “What is quantum computing and how do we do it?” before moving on to exploring quantum algorithm design by covering standard design techniques as well as the quantum algorithms for gatekeeper problems (quantum search, quantum counting, quantum approximate optimization, quantum machine learning, etc.). Students cannot receive credit for both CSCI 4610 and CSCI 6610.
| Spring | Summer | Fall | ||
|---|---|---|---|---|
| (Session 1) | (Session 2) | |||
| 2025 | ||||
| 2024 | ||||
| 2023 | ||||
| 2022 | ||||
| 2021 | ||||
| 2020 | ||||
| 2019 | ||||
| 2018 | ||||
| 2017 | ||||
| 2016 | ||||
| 2015 | ||||
| 2014 | ||||
| 2013 | ||||
| 2012 | ||||
| 2011 | ||||
| 2010 | ||||
| 2009 | ||||
| 2008 | ||||
| 2007 | ||||
| 2006 | ||||
| 2005 | ||||
| 2004 | ||||
| 2003 | ||||
| 2002 | ||||
| 2001 | ||||
| 2000 | ||||
| 1999 | ||||
| 1998 | ||||