Quantum Information Science let you know that information science depends on quantum effects in physics. With the help of prior knowledge of quantum mechanics and this [course_title] will give you a proper understanding of quantum computation and quantum information. From this very [course_title] you will also have a clear concept of protocols and communication complexity, properties of quantum entanglement, fault tolerance, quantum algorithms etc.
Assessment
This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.
Certification
Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.
Having an Official Edukite Certification is a great way to celebrate and share your success. You can:
- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success
Course Credit: MIT
Course Curriculum
| Quantum Operations; Operator Sum Representation; System-Environment Model | 00:10:00 | ||
| Quantum Error Correction – Criteria and Examples | 00:15:00 | ||
| Calderbank Shor Steane Codes | 00:10:00 | ||
| Stabilizers; Stabilizer Quantum Codes | 00:10:00 | ||
| Topological Quantum Codes; Kitaev’s Anyon Model | 00:05:00 | ||
| Stabilizers II; Computing on Quantum Codes | 00:10:00 | ||
| Concatenated Codes; The Threshold Theorem | 00:15:00 | ||
| Cluster State Quantum Computation | 00:15:00 | ||
| Measurement and Teleportation Based Quantum Computation | 00:05:00 | ||
| Adiabatic Quantum Computation | 00:05:00 | ||
| Quantum Algorithms on Graphs; Quantum Random Walks | 00:05:00 | ||
| Quantum Algorithms The Abelian Hidden Subgroup Problem; QFT Over Sn | 00:15:00 | ||
| The Nonabelian HSP; Hidden Dihedral Group; Positive and Negative Results | 00:10:00 | ||
| Quantum Data Compression; Entanglement Concentration; Typical Subspaces | 00:15:00 | ||
| Holevo’s Theorem; HSW Theorem; Entanglement Assisted Channel Capacity | 00:10:00 | ||
| Quantum-Quantum Channels, Mother Father Protocol; Distillable Entanglement | 00:10:00 | ||
| Entanglement as a Physical Resource | 00:10:00 | ||
| Quantum Protocols – Quantum Communication Complexity; Distributed Algorithms | 00:10:00 | ||
| Quantum Games | 00:10:00 | ||
| Quantum Cryptography | 00:10:00 | ||
| Assessment | |||
| Submit Your Assignment | 00:00:00 | ||
| Certification | 00:00:00 | ||
Course Reviews
No Reviews found for this course.
Related Courses
