Assessment Proforma 2024–25
Key Information
|
Module Code
|
CMT304
|
|
Module Title
|
Programming Paradigms
|
|
Assessment Title
|
Quantum Computing
|
|
Assessment Number
|
Part 4 of the 4-part portfolio coursework
|
|
Assessment Weighting
|
25% of the portfolio coursework
|
|
Assessment Limits
|
Hand-out: 6th of March 2025
Hand-in: 10th of April 2025, 9:30am
Feedback expected by: 13th of May 2025
Limits are per task as set in the instructions
|
The Assessment Calendar can be found under ‘Assessment & Feedback’ in the COMSC–ORG– SCHOOL organisation on Learning Central. This is the single point of truth for (a) the hand out date and time, (b) the hand in date and time, and (c) the feedback return date for all assessments.
1 Learning Outcomes
The learning outcomes for this assessment are
• Explain the conceptual foundations, evaluate and apply various programming paradigms, such as logic, functional, scripting, filter-based programming, pattern matching and quantum com-puting, to solve practical problems.
• Discuss and contrast the issues, features, design and concepts of a range of programming paradigms and languages to be able to select a suitable programming paradigm to solve a problem.
2 Submission Instructions
The coversheet can be found under ‘Assessment & Feedback’ in the COMSC–ORG–SCHOOL or- ganisation on Learning Central.
All files should be submitted via Learning Central. The submission page can be found under ‘As- sessment & Feedback’ in the CMT304 module on Learning Central. Your submission should consist of these files:
|
Description
|
Type
|
Name
|
|
Coversheet
|
Compulsory
|
One PDF ( . pdf) file
|
coversheet. pdf
|
|
Task 1
|
Compulsory
|
One PDF ( . pdf) file
|
task1 . pdf
|
If you are unable to submit your work due to technical difficulties, please submit your work via e- mail to [email protected] and notify the module leader (and ideally the setter, if different).
Any code will be tested on a Linux system equivalent to COMSC’s Linux lab machines and must run there.
3 Assessment Description
Consider the following quantum circuit:
It consists of two CNOT gates in the middle of the circuit. The two-qubit input quantum register |x〉is an arbitrary quantum state and can be set by the user. The other two-qubit input quantum register |00〉is in the ground state and cannot be changed. The gate F is an unknown quantum operation (this means it is an arbitrary, but fixed gate on two qubits, but you do not know what it does). The gate F-1 computes the inverse operation of F.
Task 1:
1. Analyse the operation of the circuit to determine what the values of the two two-qubit output quantum registers |A〉and |B〉are, depending on the properties of F and the user-selectable input |x〉. Clearly justify your answer.
2. Explain how you could, if possible, determine the operation of the gate F from this circuit (you can execute the circuit as many times as you wish).
3. Furthermore, discuss what this means for the difference between quantum computing and a classical computing paradigm of your choice (working with bits instead of qubits).
Answers should be provided in a report of up to 500 words (formulae and code do not count towards this limit, but ensure you explain any formula and code included). The word limit is an upper limit, not a target length. Text longer than the word limit may be ignored.
The circuit operation has not been identified correctly and the justification is not correct. There is no discussion of how to identify F and the related difference between classical and quantum computing.
4 Assessment Criteria
Task 1 worth 25% of the coursework
|
High Distinction
80% - 100%
|
|
|
Distinction
70% - 79%
|
The circuit operation has been correctly identified, depending on F and |x〉, and the justification is complete. The report shows a clear understanding of the quantum operations and the underlying theory, considering all cases involved in the full operation. The approach to identify F, where possible, is suitable, fully explained. It clearly considers the related differences between classical and quantum computing.
|
|
Merit
60% - 69%
|
The circuit operation has been correctly identified, depending on F and |x〉, and the justification is complete. The report shows a clear understanding of the quantum operations, considering all cases involved in the full operation. The approach to identify F, where possible, is suitable, and relates to the differnces between classical and quantum computing.
|
|
Pass
50% - 59%
|
The circuit operation has been correctly identified, depending on F and |x〉, and the justification is suitable, even if there are minor mistakes or incom- plete arguments. The report shows a clear understanding of the quantum operations, even if not all cases have been considered. The approach to try to identify F is suitable and well explained, but it focuses mainly on either the quantum or the classical computing context.
|
|
Marginal Fail
40% - 49%
|
The circuit operation has been correctly identified, with some mistakes, and the justification shows some understanding of the involved quantum oper- ations. The approach of how to identify F points in the right direction, but incompletely considers related classical as well as quantum computing con- cepts.
|
|
Fail
0% - 39%
|
There is a discussion of the circuit operation that shows some insights, but the operation is not correctly identified and the justification is incomplete. The approach of how to identify F shows some insights, but is not suitable and failed to consider the related differences between classical and quantum computing.
|