Foothill CollegeApproved Course Outlines

Physical Sciences, Mathematics & Engineering Division | |||||

C S 83C | THEORY OF QUANTUM COMPUTING III | Summer 2014 | |||

5 hours lecture. | 5 Units | ||||

Total Quarter Learning Hours: 60
(Total of All Lecture, Lecture/Lab, and Lab hours X 12) | |||||

Lecture Hours: 5 |
Lab Hours: | Lecture/Lab: | |||

Note: If Lab hours are specified, see item 10. Lab Content below. | |||||

Repeatability - | |||||

Statement: | Not Repeatable. | ||||

Status - | |||||

Course Status: Active | Grading: Letter Grade with P/NP option | ||||

Degree Status: Applicable | Credit Status: Credit | ||||

Degree or Certificate Requirement: AS Degree | |||||

GE Status: Non-GE | |||||

Articulation Office Information - | |||||

Transferability: CSU | Validation: 11/7/13 | ||||

1. Description - | ||

This course presents classical and quantum information theory as applied to the encoding and error correction of quantum data. The third in a sequence, it begins by presenting quantum entanglement and non-orthogonal measurement. Key results of classical information theory are stated in terms of the complexity classes P and NP, and Shannon entropy is defined and extended to include quantum information. Students receive instruction in different distance measures and bounds for comparing fidelity. Several error correction and stabilizer codes are presented and analyzed. | ||

Prerequisite: None | ||

Co-requisite: None | ||

Advisory: C S 83B. | ||

2. Course Objectives - | ||

The student will be able to: - Use the mathematical tools of linear algebra, tensor products and probability to calculate and analyze a number of systems that model quantum behavior.
- Describe the difference between the density matrix and state-vector formulation of quantum mechanics and demonstrate the strengths of each.
- State what it means for a problem to be NP-complete, and explain the primary conjecture of information theory regarding the complexity classes P and NP.
- Define information entropy and compute the minimum entropy gained by the environment for each bit of information lost (erased) by a computer.
- Define the distance measures “fidelity”, “entanglement fidelity” and “trace” and, given a description of an encoding algorithm, compute the value of each.
- Write an algorithm for some basic error correction schemes utilizing “flip” and Shore codes.
- Explain the difference between classical linear error-correcting codes and quantum error-correcting codes.
- Test whether a given error-correction code satisfies certain bounds defined by an associated inequality.
- Write the formal description of a stabilizer code and give three examples of a stabilizer code, stating the strengths and limitations of each.
| ||

3. Special Facilities and/or Equipment - | ||

- access to a networked computer laboratory which can access quantum computer simulators and tools either via the Web or loaded onto lab computers.
- a website or course management system with an assignment posting component, a forum component. This applies to all sections, including on-campus (i.e., face-to-face) offerings.
- When taught via Foothill Global Access on the Internet, course management system through which the instructor and students can interact.
- When taught via Foothill Global Access on the Internet, students must have currently existing e-mail accounts and ongoing access to computers with internet capabilities.
| ||

4. Course Content (Body of knowledge) - | ||

- Mathematical Tools
- 2-D Hilbert space
- Hermitian operators
- Eigenvectors and eigenvalues
- Tensor product spaces
- Fundamental results from probability and statistics
- Quantum Mechanical Tools
- State vector and density matrix formulations of quantum axioms
- Orthogonal and non-orthogonal measurements
- Positive operator valued measures (POVMs)
- Spin-1/2 Hilbert Space and Bloch sphere representation
- Purifications survey and Schmidt number
- GHJW theorem
- Superoperators and their operator sum representations
- Complexity Classes P and NP
- Decision Problems
- Classes P and NP
- NP-complete problems
- The “P not-equal NP” problem
- Examples in number factoring and graph theory
- Classical Information Theory
- Random variables and probabilities
- Shannon entropy
- Mutual information
- Data compression and code words
- Data transmission over noiseless channels
- Data transmission over noisy channels
- Distance
- Trace
- Fidelity
- Entanglement fidelity
- Basic Error Correction Examples
- 3-qubit bit flip code
- 3- qubit phase flip code
- The Shor code
- Fundamental Quantum Error Codes
- Classical linear codes
- CSS Codes
- 7-Qubit code
- Constraints on Code Parameters
- Quantum Hamming bound
- No-cloning bound
- Quantum Singleton bound
- Stabilizer Codes
- Formalism
- Unitary gates in the stabilizer formalism
- Measurement in the stabilizer formalism
- 5-qubit code
- 3 qubit bit-flip code revisited
- 9-qubit Shor code
| ||

5. Repeatability - Moved to header area. | ||

6. Methods of Evaluation - | ||

- Tests and quizzes
- Written assignments which include algorithms, mathematical derivations, logical circuits, and essay questions.
- Final examination
| ||

7. Representative Text(s) - | ||

Nielsen, M. and Chuang, I.: Quantum Computation and Quantum Information, Cambridge University Press, 2010. Kaye, P., Laflamme, R. and Mosca, M.: An Introduction to Quantum Computing, Oxford University Press, 2007. | ||

8. Disciplines - | ||

Computer Science | ||

9. Method of Instruction - | ||

- Lectures which include mathematical foundations, theoretical motivation and coding implementation of quantum mechanical algorithms.
- Detailed review of assignments which includes model solutions and specific comments on the student submissions.
- In person or on-line discussion which engages students and instructor in an ongoing dialog pertaining to all aspects of designing, implementing and analyzing programs.
- When course is taught fully on-line:
- Instructor-authored lecture materials, handouts, syllabus, assignments, tests, and other relevant course material will be delivered through a college hosted course management system or other department-approved Internet environment.
- Additional instructional guidelines for this course are listed in the attached addendum of CS department on-line practices.
| ||

10. Lab Content - | ||

Not applicable. | ||

11. Honors Description - No longer used. Integrated into main description section. | ||

12. Types and/or Examples of Required Reading, Writing and Outside of Class Assignments - | ||

- Reading
- Textbook assigned reading averaging 30 pages per week.
- Reading the supplied handouts and modules averaging 10 pages per week.
- Reading on-line resources as directed by instructor though links pertinent to programming.
- Reading library and reference material directed by instructor through course handouts.
- Writing
- Writing technical prose documentation that supports and describes the programs that are submitted for grades.
| ||

13. Need/Justification - | ||

This course is a restricted support course for the AS degree in Computer Science. |

Course status: | Active | |

Last updated: | 2014-06-19 12:48:00 |

Foothill CollegeApproved Course Outlines

Schedule & Course Information

Class Schedule

Currently Available Classes

Course Catalog

Course Outline of Record

Green Sheets

Online Classes

Dates & Deadlines

Final Exam Schedule

Currently Available Classes

Course Catalog

Course Outline of Record

Green Sheets

Online Classes

Dates & Deadlines

Final Exam Schedule

Learning Outcomes Initiatives

Student Learning Outcomes

Service Area Outcomes

Administrative Area Outcomes

Program Learning Outcomes

Institutional Learning Outcomes

Service Area Outcomes

Administrative Area Outcomes

Program Learning Outcomes

Institutional Learning Outcomes

Academics