From a642983a4220fb4b95d46fde50c8eaabc604b150 Mon Sep 17 00:00:00 2001 From: Shmuel Goldfarb Date: Sat, 27 Oct 2018 11:08:14 +0300 Subject: [PATCH] Update CS 4812 @ Cornell to 2018 version --- README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 311f04c..f68b25d 100644 --- a/README.md +++ b/README.md @@ -909,10 +909,10 @@ and anti-analysis techniques. - [Syllabus](http://www.cs.cornell.edu/courses/CS4154/2014fa/about/faq.php) - [Lectures](http://www.cs.cornell.edu/courses/CS4154/2014fa/lectures/index.php) - [Assignments](http://www.cs.cornell.edu/courses/CS4154/2014fa/assignments/index.php) -- [CS 4812](https://courses.cit.cornell.edu/physics4481-7681_2014sp/) **Quantum Information Processing** *Cornell University* Lecture Notes Readings +- [CS 4812](https://courses.cit.cornell.edu/physics4481-7681_2018fa/) **Quantum Information Processing** *Cornell University* Lecture Notes Readings - Hardware that exploits quantum phenomena can dramatically alter the nature of computation. Though constructing a working quantum computer is a formidable technological challenge, there has been much recent experimental progress. In addition, the theory of quantum computation is of interest in itself, offering strikingly different perspectives on the nature of computation and information, as well as providing novel insights into the conceptual puzzles posed by the quantum theory. The course is intended both for physicists, unfamiliar with computational complexity theory or cryptography, and also for computer scientists and mathematicians, unfamiliar with quantum mechanics. The prerequisites are familiarity (and comfort) with finite dimensional vector spaces over the complex numbers, some standard group theory, and ability to count in binary. - - [Syllabus](http://www.cs.cornell.edu/~ginsparg/physics/P4481-P7681-CS4812/Fa12.html) - - [Lectures](https://courses.cit.cornell.edu/physics4481-7681_2014sp/) + - [Syllabus](https://courses.cit.cornell.edu/physics4481-7681_2018fa/) + - [Lectures](https://courses.cit.cornell.edu/physics4481-7681_2018fa/) - [CS 4860](http://www.cs.cornell.edu/courses/CS4860/2012fa/) **Applied Logic** *Cornell University* Assignments Lecture Notes - In addition to basic first-order logic, when taught by Computer Science this course involves elements of Formal Methods and Automated Reasoning. Formal Methods is concerned with proving properties of algorithms, specifying programming tasks and synthesizing programs from proofs. We will use formal methods tools such as interactive proof assistants (see [www.nuprl.org](http://www.nuprl.org)). We will also spend two weeks on constructive type theory, the language used by the Coq and Nuprl proof assistants. - [Syllabus](http://www.cs.cornell.edu/courses/CS4860/2012fa/schedule.php)