ECE 523/ PHY 627

Quantum Information Science

Spring 2017
Instructor: Jungsang Kim
Course Objective

Quantum Information Science will focus on the fundamental and key novel concepts in the field as a solid introduction to this research area. The course will cover important novel concepts in utilizing quantum resources for information processing, and the novel application they enable. The course will also attempt to cover some engineering aspect of quantum information science, an area where little attention has been paid from educational perspective at other academic institutions. The course should set up a strong basis for future researchers in this field to conduct their research.


Class Location and Hours


Time: Monday and Wednesday at 10:05 am -11:20 am, Possible make-up class on Fridays at 10:05-11:20am

Location: Hudson 216

Contacting the Instructor outside Classroom

If you need to contact the professor outside the class, please email him or come to his office hours:

Professor Jungsang Kim

Office: 2519 FCIEMAS

Office Hours:  Mondays and Wednesdays 11:20am-12:00pm, Tuesdays 1-2pm

Email: jungsang at duke.edu

Teaching Assistant

The class TA: Tripp Spivey
FCIEMAS 2523
robert.spivey@duke.edu
Office Hours: Thursdays 2-3pm, Fridays 3-4pm, FCIEMAS 3431

Required Textbook
M. A. Nielsen and I. L. Chuang, Quantnm Computation and Quantum Information, Cambridge University Press, 2000.

Assignments and Grading
This course will require reading from the textbook, homework assignments, and two mid-term exams and one final project.

The grades will be based on:

Homework assignments are required to get familiar with the mathematical tools used for the remainder of the coursework. You will not be effective in following the course if you do not do your homeworks in time.
Make sure you work on your homework assignments by the due date: otherwise you will have trouble understanding the material that follow!!
Mid-Term exams will be either in-class or take-home exams (I will decide as we go).
Final project will be a topic chosen from physical implementation of quantum computers (or, logic gates), or on an advanced topic related to quantum information science.

Academic Misconduct:  The goal of this course is to learn exciting topic, and academic misconduct will not get us there. The course is designed to have little room for academically dishonest behavior. I will not tolerate any academically dishonest behavior: you will be directly reported to the judiciary committee. If you are not sure about what is an acceptable academic behavior, please do not hesitate to come and talk to me!!

Topics, Lecture Notes, and Reading Assignments

I will post lecture notes (in PDF format) shortly before I cover them in class for your reference.

Date
Topic Reading Assignments
Jan 11, 2017
Course Introduction
Lecture Notes #1
Chapter , Section 1.1 and Section 1.2
Jan 18, 2017
Introduction to Quantum Information Science
Chapter 1, Section 1.3, 1.4, 1.5 and 1.6
Jan 23, 2017
Review of Quantum Mechanics
Lecture Notes #2
Chapter 2
Section 2.1 Linear Algebra
Jan 25, 2017
Review of Quantum Mechanics
In-Class Exercise #1
Distinguishability and No Cloning Theorem
Chapter 2
Section 2.2 Postulates of Quantum Mechanics
Jan 30, 2017
Review of Quantum Mechanics Section 2.3 Applications
Section 2.4 Density Operator
Section 2.5 The Schmidt Decomposition and Purifications
Section 2.6 EPR and Bell Inequality
Feb 1, 2017
Review of Quantum Mechanics
Chapter 3
Feb 3, 2017
**FRIDAY**
*Make-Up Class* at 3-4:15pm, Hudson Room 212
Review of Topics in Computer Science
Lecture Notes #3
Introduction to Quantum Circuits
Lecture Notes #4
Chapter 4
Section 4.1 Quantum Algorithms
Section 4.2 Single Qubit Operations
Feb 6, 2017 Quantum Circuits Section 4.3 Controlled Operations
Section 4.4 Measurement
Feb 8, 2017
No Class - Instructor at a Program Review

Feb 13, 2017
Quantum Circuits
Universal Quantum Gates
Section 4.5 Universal Quantum Gates
Feb 15, 2017
Quantum Circuits
*Class will start at 9:50am and end at 11:00am!!*
Section 4.6 Summary of the Quantum Circuit Model of Computation
Section 4.7 Simulation of Quantum Systems
Feb 20, 2017
In-Class Mid-Term Exam

Feb 22, 2017
Quantum Algorithms: Quantum Fourier Transform
Lecture Notes #5
Chapter 5
Feb 27, 2017
Quantum Fourier Transform and Phase Estimation Algorithms
Chapter 5
Mar 1, 2017
Order Finding and Factoring Algorithms
Chapter 5
Mar 6, 2017
Quantum Search Algorithms
Lecture Notes #6
Chapter 6
Mar 8, 2017
Quantum Search and Other Quantum Algorithms
Chapter 6
Quantum Algorithms: an Overview, A. Montanaro, npj Quantum Information 2, 15023 (2016)
Mar 20, 2017
Physical Systems
Lecture Notes #7
Chapter 7.1 Guiding Principles
Chapter 7.2 Conditions for Quantum Computation
Chapter 7.3 Harmonic Oscillator Quantum Computer
Mar 22, 2017
Physical Systems
Chapter 7.5 Optical Cavity Quantum Electrodynamics
Chapter 7.6 Ion Traps
Chapter 7.8 Other Implementation Schemes
Mar 27, 2017
Physical Systems

Mar 29, 2017
Distance Measures and Quantum Algorithms
Lecture Notes #8
Chapter 9
April 3, 2017
System Level Implementation of Quantum Computing
Guest Lecturer: Dr. Stephen Crain

April 5, 2017
System Level Implementation of Quantum Computing
Guest Lecturer: Dr. Stephen Crain

April 10, 2017
In-Class Mid-Term Exam

April 12, 2017
Quantum Cryptography
Lecture Notes #9
Chapter 12
April 17, 2017
Quantum Cryptography

April 19, 2017
Using the IBM Quantum Experience
Lab Notes #1

Homework Assignments
Homework #1-Rev: Due In Class 1/30/2017 (Revised 1/23/2017) : Get yourself familiar with linear algebra and vector spaces!!
Homework #2: Due In Class Monday 2/13/2017 : Working with entangled states and density operators. Basic topics in computer science.
Homework #3: Due In Class Wednesday 2/22/2017 : Quantum circuits and circuit identities. You need to know this stuff quite well!!
Homework #4: Due In Class Monday 3/20/2017
Homework #5: Due In Class Wednesday 4/5/2017
Tentative Schedule

This is a tentative topics we intend to cover in class. This will be updated as the changes arise.

Week starting

Monday

Wednesday

Jan 9

No Class

Introduction to Quantum Information Science (Chapter 1)

Jan 16
No Class Introduction to Quantum Information Science (Chapter 1)
Jan 23
Review of Quantum Mechanics (Chapter 2) Review of Quantum Mechanics (Chapter 2)
Jan 30
Review of Quantum Mechanics (Chapter 2) Review of topics in Computer Science (Chapter 3)
Feb 6
Introduction to Quantum Circuits (Chapter 4) Quantum Circuits (Chapter 4)
Feb 13
Quantum Circuits & Universality Theorem (Chapter 4)

Universality Theorem (Chapter 4)

Feb 20

Mid-Term #1 (In-Class Exam)

Quantum Algorithms: Quantum Fourier Transform (Chapter 5)

Feb 27

Quantum Fourier Transform (Chapter 5)

Quantum Fourier Transform and Factoring (Chapter 5)
Mar 6
Quantum Algorithms: Quantum Search (Chapter 6) Quantum Search Algorithm (Chapter 6)
Mar 13
Spring Break
Mar 20
Physical Systems (Chapter 7)
Physical Systems (Chapter 7)
Mar 27
Distance Measures in Quantum Mechanics (Chapter 9) System Level Implementations and Quantum Computer Science
Apr 3
System Level Implementations and Quantum Computer Science
System Level Implementations and Quantum Computer Science
Apr 10
Mid-Term #2 (In-Class Exam) Quantum Cryptography (Chapter 12)
Apr 17
Quantum Cryptography (Chapter 12) Tutorial on using IBM Quantum Experience
Apr 24
Final Projects Final Projects
May 1

Final Project Presentation TBD


Mid-Term Exam #1
The first mid-term exam will be an in-class exam given on Monday 2/20. The exam will start promptly at 10:05am in Hudson 216, so please make sure you are there on time. The test will be administered by the TA (Tripp Spivey), and will last for 75 minutes until 11:20am. Here are some rules for the exam.

1.     The exam will be an open-book test, but that does not mean you are given access to anything under the sun (or on the web, for a more relevant quantifier). You are only allowed to refer to the following documents: the main textbook (Nielsen and Chuang, electronic version is allowed), classroom material provided through the course website, any notes you have taken in the classroom, and the homework problems. No other documents or materials, whether in paper or electronic form, are allowed during the exam. Needless to say, you are to work on the problems by yourself, and cannot not discuss the problems with anyone else other than the exam proctor for clarification questions.
  You must sign the cover page of the exam before you turn it in. Good luck!!

Average: 69.0
Standard Deviation: 17.1
Mid-Term Exam #2
The second mid-term exam will be an in-class exam given on Monday 4/10. The exam will start promptly at 10:05am in Hudson 216, so please make sure you are there on time. The test will be administered by the TA (Tripp Spivey), and will last for 75 minutes until 11:20am. Here are some rules for the exam, which is identical to the first exam given on 2/20/2017.

1.     The exam will be an open-book test, but that does not mean you are given access to anything under the sun (or on the web, for a more relevant quantifier). You are only allowed to refer to the following documents: the main textbook (Nielsen and Chuang, electronic version is allowed), classroom material provided through the course website, any notes you have taken in the classroom, and the homework problems. No other documents or materials, whether in paper or electronic form, are allowed during the exam. Needless to say, you are to work on the problems by yourself, and cannot not discuss the problems with anyone else other than the exam proctor for clarification questions.
  You must sign the cover page of the exam before you turn it in. Good luck!!

Average: 62.7
Standard Deviation: 12.6

Final Project: Format, Topic Selection and Guidelines
The final presentation has been scheduled on Monday 5/1/2017, from 9am to 12pm. It will be held in our regular classroom, Hudson 216.  We have a lot of teams to go through, so please be there on time so we can start promptly.

Each team will be given 20 minutes to discuss their project, which will be made up of a 15 minute presentation followed by ~5 min Q&A session. Each team will also be turning in a no-more-than 5 page report (single space, font size of 12pts).

The key content of the presentation/report should include (1) brief description of how your algorithm works, (2) your implementation of a 10+ qubit version of the algorithm, and a 5-qubit version of the algorithm, and (3) implementation results of both algorithms (the larger version on the IBM simulator, and the 5-qubit version on the actual quantum computer). You are welcome to discuss any interesting insights you have gained while working on your final project.

The grading criteria for the final project will be (1) Description of your algorithm, (2) novelty and quality of your circuit implementation, (3) quality of the presentation, (4) evaluation of the written report, and (5) participation in the presentation session.


This is the teaming arrangement for the class, and the topics you have chosen for the final project.
Team 1
Sarah Brandsen, Yuhi Aikyo
Solutions to Linear Equations
Team 2
Andrew Boyce, Zhetao Jia
Quantum Search (Grover) Algorithm
Team 3
Dean Hazineh, Kamali Jones, Cathy Li
Deutsch-Josza Algorithm
Team 4
Taimur Islam, Aaron Mahler
Quantum Fourier Transform
Team 5
Tamra Nebabu, Wei Tang
Quantum Chemistry Simulation
Team 6
Xiaoyang Liu, Zhe Wang
Simon's Algorithm
Team 7
Xinmeng Tong, Weiyao Wang
Hidden Shift Problem
Team 8
Ming-Tso Wei, Yuqi Yun
Element Distinctness Problem


Here are some examples of quantum algorithms and the corresponding references: one can also find a quick summary of similar algorithms in this Wikipedia page:

Quantum Algorithm
What does it do?
References
Deutsch-Jozsa Algorithm
Identifies if a boolean function is constant or balanced
D. Deutsch and R. Josza, Rapid Solution of Problems by Quantum Computation
https://en.wikipedia.org/wiki/Deutsch%E2%80%93Jozsa_algorithm
Simon's Algorithm
Solves a "black box" problem exponentially faster than any classical algorithm
D. R. Simon, On the Power of Quantum Computation
https://en.wikipedia.org/wiki/Simon%27s_problem
Bernstein-Vazirani Algorithm

D. Bacon, The Recursive and Nonrecursive Bernstein-Vazirani Algorithm
Quantum Fourier Transform
Finds period of a function
Textbook Chapter 5
Grover Algorithm
Provides speedup in a search problem
Textbook Chapter 6
Quantum Chemistry Simulation
Simulates the electronic configuration in a molecule (simple one like hydrogen)
P. J. J. O'Malley et al., Scalable Quantum Simulation of Molecular Energies
Hidden Shift Problem
Finds the value of the shift in a boolean function
D. Gavinsky, M. Roetteler, and J. Roland, Quantum Algorithm for the Boolean Hidden Shift Problem
Solution to set of linear equations
Generic benefit of solving a set of linear equations
A. Harrow, A. Hassidim and S. Lloyd, Quantum Algorithms for Linear Systems of Equations
Element distinctness problem
Determines whether all the elements of a list are distinct
A. Ambainis, Quantum Walk Algorithm for Element Distinctness
https://en.wikipedia.org/wiki/Element_distinctness_problem