CMSC 491 Introduction to Quantum Computation and Information

CMSC491
IntroductiontoQuantumComputationandInformation
Syllabus
Cataloglisting:
CMSC491
CourseLevel:
Undergraduate
Prerequisites:
MATH310withaCorbetter,AND
atleastoneofCMSC303orCMSC401withaCorbetter
Instructor: Dr.SevagGharibian
Office:
E4240
Phone:
804‐828‐0407
Email:
sgharibian@vcu.edu
Classroom: E1232
Classwebsite:
TBD
OfficeHours:
TR9:30‐10:30
1.0 –Overview(CatalogCourseDescription):
Semestercourse;3lecturehours.3credits.Prerequisites:CMSC401witha
gradeofCorbetterandMATH310withagradeofCorbetter.Introductionto
quantummechanics;statevectors,densitymatrices,distancemeasures,no‐
cloningtheorem.Quantumkeydistribution;BB84.Quantumentanglementand
non‐locality.Quantumalgorithms;teleportation,superdensecoding,Shor’s
factoringalgorithm,Grover’ssearchalgorithm.Quantumerrorcorrection.
Quantumcomplexitytheory;QuantumMerlinArthur,localHamiltonians.
2.0 –CourseStructure:
Lecturehours/week–
3
3.0 –CourseGoals
Uponsuccessfulcompletionofthiscourse,thestudentwillbeableto:
 Describeandapplythefourpostulatesofquantummechanics.
 Designandanalyzebasictoadvancedquantumalgorithms.
 Applythetheoryoferror‐correctingcodes,bothclassicalandquantum.

Distinguishbetweentypesofquantumcorrelations,suchasentanglement
andnon‐locality.
 Provethatcertainproblemsarehardforquantumcomplexityclasses.
4.0 –ABETCriteriaAddressed:
a.
Anabilitytoapplyknowledgeofcomputingandmathematicsappropriate
totheprogram’sstudentoutcomesandtothediscipline.
b.
Anabilitytoanalyzeaproblem,andidentifyanddefinethecomputing
requirementsappropriatetoitssolution.
c.
Anunderstandingofprofessional,ethical,legal,securityandsocialissues
andresponsibilities.
5.0 –MajorTopicsCovered:
 Quantummechanics;statevectors,densitymatrices,distancemeasures,no‐
cloningtheorem.
 Quantumentanglementandnon‐locality;purestateversusmixedstate
separability,CHSHinequality,WernerStates.
 Quantumalgorithms;teleportation,superdensecoding,factoring,
unstructuredsearch.
 Quantumerror‐correctingcodes;stabilizercodes.
 Quantumcomplexitytheory;QuantumMerlin‐Arthur,localHamiltonians.
6.0 –Textbook(s):
QuantumComputationandQuantumInformation,NielsenandChuang
7.0 –ClassSchedule:
 Lecture:
TR12:30pm–1:45pm,EngineeringEastHall,RoomE1232
8.0 –Evaluation:
GeneralInstructions:
Finalexampolicy:
Youmustpassthefinalexaminordertopassthecourse.
Attendancepolicy:
Idonotplantoassociategradeswithwhetherornotyouattendclass,
unlessaseriousproblemwithattendancedevelops.
Thegradingschemeisbelow:
Grading:
Category
Problemsets
Midterm
Finalexam
Gradingscheme:
A:
>=85%
B:
>=75%and<85%
C:
>=65%and<75%
D:
>=50%and<65%
F:
<50%
%weight
50%
20%
30%