Mooc AtlasUniversity-level self-study
All paths
Physics & maths · 31Intermediate

Quantum Computing Engineer

Physicists or computer scientists drawn to quantum computing.

Linear algebra, engineering mathematics, modern physics and quantum mechanics, then advanced algorithms up to quantum algorithms.

443hours of coursework
45weeks at 10 h
5steps
19courses
3universities

Target skills

GeometryLinear AlgebraMechanicsPhysicsAlgebraApplied MathematicsCalculusDifferential EquationsMathematical ModelingMarkov ModelNumerical AnalysisScripting

Skill labels as listed on Coursera.

Target jobs

  • Quantum computing engineer
  • Quantum physics PhD student
  • R&D engineer

Progression

  1. 1
    Johns Hopkins UniversityBeginner

    Stated prerequisites: Basic algebra (no calculus)

    Show the 3 courses
  2. 2
    The Hong Kong University of Science and TechnologyBeginnerMATLAB

    Stated prerequisites: Single variable calculus and some computer programming ability

    Show the 5 courses
    CourseLevelLengthRating (reviews)
    Matrix Algebra for EngineersBeginner20 h4.9 (4,726)
    Differential Equations for EngineersBeginner27 h4.9 (2,251)
    Vector Calculus for EngineersBeginner30 h4.8 (1,425)
    Numerical Methods for EngineersIntermediate40 h4.8 (451)
    Mathematics for Engineers: The Capstone CourseIntermediate10 h5.0 (45)
  3. 3
    The Hong Kong University of Science and TechnologyBeginner

    Stated prerequisites: Basic classical physics and calculus (highly recommended)

    Show the 3 courses
  4. 4
    University of Colorado BoulderIntermediate

    Stated prerequisites: Undergraduate calculus, differential equations and linear algebra

    Show the 3 courses
    CourseLevelLengthRating (reviews)
    Foundations of Quantum MechanicsIntermediate27 h4.5 (94)
    Theory of Angular MomentumIntermediate13 h4.0 (20)
    Approximation MethodsIntermediate14 h4.4 (14)
  5. 5
    University of Colorado BoulderAdvancedPythonacademic credit

    Stated prerequisites: Some background in calculus, probability theory and Python programming

    Show the 5 courses
    CourseLevelLengthRating (reviews)
    Algorithms for Searching, Sorting, and IndexingIntermediate36 h4.7 (544)
    Trees and Graphs: BasicsAdvanced34 h4.6 (194)
    Dynamic Programming, Greedy AlgorithmsAdvanced38 h4.7 (282)
    Approximation Algorithms and Linear ProgrammingAdvanced46 h4.8 (67)
    Advanced Data Structures, RSA and Quantum AlgorithmsAdvanced45 h4.6 (70)

With Coursera Plus

This path takes 443 hours, about 10 months at 10 hours a week. A Coursera Plus subscription gives access to most of its courses during that time.

Discover Coursera Plus

Projects to build

After step 1

Quantum gates as matrices

Represent qubits and the Hadamard, Pauli and CNOT gates as matrices and check their properties in NumPy.

After step 4

Circuit simulator

Write a small two- or three-qubit circuit simulator and prepare an entangled state.

After step 5

Grover’s algorithm

Implement Grover’s search on the simulator and compare the number of iterations with a classical search.

Free textbooks

More paths in this family