Undergraduate Course: Quantum Computing Project (PHYS10110)
Course Outline
| School | School of Physics and Astronomy | 
College | College of Science and Engineering | 
 
| Credit level (Normal year taken) | SCQF Level 10 (Year 3 Undergraduate) | 
Availability | Available to all students | 
 
| SCQF Credits | 10 | 
ECTS Credits | 5 | 
 
 
| Summary | This course complements the Quantum Mechanics and Principles of Quantum Mechanics courses by demonstrating an application in computation. Implemented as a project, it also provides a place for students to develop team programming skills of the type routinely employed in a professional setting, and exposure to the associated tools. | 
 
| Course description | 
    
    Students will form groups of about six members, who will collaborate to design, implement, and test a program to simulate a quantum computer. They will run Grover's algorithm to search an unordered list on their simulator. They may also implement other quantum algorithms, such as Shor's method for factorization.
    
    
 | 
 
 
Entry Requirements (not applicable to Visiting Students)
| Pre-requisites | 
 | 
Co-requisites |  It is RECOMMENDED that students also take    
Numerical Recipes (PHYS10090)  
  | 
 
| Prohibited Combinations |  | 
Other requirements |  None | 
 
 
Information for Visiting Students 
| Pre-requisites | None | 
 
		| High Demand Course? | 
		Yes | 
     
 
Course Delivery Information
 |  
| Academic year 2024/25, Available to all students (SV1) 
  
 | 
Quota:  60 | 
 
| Course Start | 
Semester 2 | 
 
Timetable  | 
	
Timetable | 
| Learning and Teaching activities (Further Info) | 
 
 Total Hours:
100
(
 Lecture Hours 4,
 Summative Assessment Hours 1,
 Programme Level Learning and Teaching Hours 2,
Directed Learning and Independent Learning Hours
93 )
 | 
 
| Assessment (Further Info) | 
 
  Written Exam
0 %,
Coursework
100 %,
Practical Exam
0 %
 | 
 
 
| Additional Information (Assessment) | 
100% coursework | 
 
| Feedback | 
Feedback will be given during lectures/meetings, as well as written feedback on the report and verbal feedback on the presentation. | 
 
| No Exam Information | 
 
Learning Outcomes 
    On completion of this course, the student will be able to:
    
        - Distinguish problems of different computational complexity and explain why certain problems are rendered tractable by quantum computation with reference to the relevant concepts in quantum theory.
 - Demonstrate an understanding of a quantum computing algorithm by simulating it on a classical computer, and state some of the practical challenges in building a quantum computer.
 - Contribute to a medium-scale application program as part of a co-operative team, making use of appropriate collaborative development tools (such as version control systems).
 - Produce code and documentation that is comprehensible to a group of different programmers and present the theoretical background and results of a project in written and verbal form.
 - Apply knowledge, skills, and understanding in executing a defined project of research, development, or investigation and in identifying and implementing relevant outcomes.
 
     
 | 
 
 
Reading List 
Artur Ekert, Patrick Hayden, and Hitoshi Inamori, Basic concepts in quantum computation, arXiv:quant-ph/0011013. 
Michael Nielsen and Isaac Chuang, Quantum Computation and Quantum Information, ISBN: 9780521635035, QA401 Nie. 
David Mermin, Quantum Computer Science, ISBN: 9780521876582, QA76.889 Mer. |   
 
Additional Information
| Graduate Attributes and Skills | 
Not entered | 
 
| Keywords | QCPrj | 
 
 
Contacts 
| Course organiser | Prof Anthony Kennedy 
Tel: (0131 6)50 5272 
Email:  | 
Course secretary | Ms Lucy Davis-Jenkins 
Tel:  
Email:  | 
   
 
 |    
 
  
  
  
  
 |