QA-101 · Foundation course
Explain how interference, oracles and measurement are used in algorithm design, and state what a claimed speedup compares.
Enquire about this courseBasic quantum circuits, linear algebra and introductory programming.
Explain how interference, oracles and measurement are used in algorithm design, and state what a claimed speedup compares.
The practical task asks you to apply the concepts, justify your choices and communicate the assumptions and limits of your result.
MODULE 01
MODULE 02
MODULE 03
The outline defines this course’s intended scope. The detailed teaching sequence and preparation materials will be confirmed for the agreed delivery.
A worked algorithm example with a clearly specified oracle and a fair classical comparison.
Technical work is based on simulation, calculation or protocol analysis. Hardware access and laboratory sessions require a separately confirmed arrangement.
The proposed review criteria are conceptual accuracy, a defensible method, clear evidence and appropriate treatment of assumptions and uncertainty.
Assessment format and feedback arrangements will be agreed before booking. No accreditation or external certification is claimed.
This is a course outline available for enquiry. Instructor, dates, duration, delivery format, fees and any hardware requirements will be confirmed in a written proposal before a booking is made.
Tell us whether you are learning independently, developing a team or planning research training. Submitting this form does not create a booking or payment obligation.
Explore Quantum Algorithms and Applications All training areas