SEMESTER-II
COURSE 4: Numerical Methods for Quantum Computing
Theory Credits: 3 3 hrs/week
Course Objectives:
1. To understand the foundations of numerical computation and approximation.
2. To analyze different types and sources of numerical errors.
3. To apply numerical methods for solving algebraic and linear systems.
4. To compute numerical differentiation and integration using appropriate algorithms.
5. To solve ordinary differential equations using iterative and Runge-Kutta methods.
Course Learning Outcomes
After completing this course, students will be able to:
1. Explain the significance and limitations of numerical methods in solving engineering problems.
2. Identify and minimize different sources of numerical errors in computation.
3. Apply root-finding and linear system solving methods to practical problems.
4. Perform numerical differentiation and integration accurately.
5. Implement numerical algorithms to solve ordinary differential equations with controlled error.
Unit–I: Introduction to Numerical Methods and Errors (9 Periods)
Aim of Numerical Methods, Concept of Numerical Approximation,Measuring Errors: Absolute, Relative,
and Percentage Errors, Important Definitions and Theorems Related to Numerical Methods, Round-off and
Truncation Errors, Error Propagation and Machine Epsilon, Trade-off between Round-off and Truncation
Errors
Unit–II: Solution of Algebraic and Transcendental Equations (9 Periods)
Classification of Equations, Bracketing Methods: Bisection and False Position Methods, Open Methods:
Fixed-Point Iteration, Newton-Raphson Method, Convergence Analysis and Order of Convergence,
Estimation of Errors and Convergence Rate, Backward and Forward Error Analysis
Unit–III: Systems of Linear Equations (9 Periods)
Matrix Representation of Linear Systems, Gaussian Elimination and Gauss-Jordan Methods, LU
Decomposition and Pivoting, Iterative Methods: Jacobi and Gauss-Seidel Methods, Convergence Criteria
and Error Estimation
Unit–IV: Numerical Differentiation and Integration (9 Periods)
Numerical Differentiation using Finite Differences, Polynomial Interpolation and Lagrange Interpolation,
Newton-Cotes Quadrature Formulas (Trapezoidal, Simpson’s Rules), Romberg Integration and Richardson
Extrapolation, Gauss Quadrature Methods and Error Estimation
Unit–V: Numerical Solutions of Differential Equations (9 Periods)
Initial Value Problems (IVPs), Euler’s Method – Stability and Convergence, Runge-Kutta Methods (Second
and Fourth Order), Adaptive Methods for IVPs, Systems and Higher-Order Differential Equations, Global
and Local Truncation Errors
Text Books:
1. Numerical Methods for Engineering and Data Science (Wuthrich & El Ayoubi, CRC Press, 2025
2. Numerical Methods Fundamentals by [Link]
SEMESTER-II
COURSE 4: Numerical Methods for Quantum Computing
Practical Credits: 1 2 hrs/week
List of Experiments:
Exp. Title of Major Tasks /
Objective Software / Tools
No. Experiment Activities
To understand
Perform
the effect of
Study of Round- addition/subtraction of
finite precision
off and small & large numbers, Octave / Python
1 and floating-
Truncation observe round-off (sys.float_info.epsilon)
point arithmetic
Errors errors, compute
on numerical
machine epsilon (eps).
results.
To study how Evaluate propagation of
Error
input data input errors using
Propagation and
2 errors propagate addition/subtraction; Octave / Python
Significant
through demonstrate loss of
Digits
calculations. significance.
To find the root
Bisection Implement Bisection
of a nonlinear
Method for Method for ( f(x)=x^3 -
3 equation using Octave / Python
Nonlinear 4x + 1 ); plot error
a bracketing
Equations reduction per iteration.
method.
To solve Apply Newton-Raphson
Newton- nonlinear and Fixed-Point
Raphson and equations and Iteration to ( f(x)=e^{-
4 Octave / Python
Fixed Point compare x}-x ); compare
Iteration convergence iteration count and
speed. error.
To solve a Input 3×3 system;
Solving Linear
linear system perform forward
Systems using Octave / Python
5 using the direct elimination and back
Gaussian ([Link]())
elimination substitution; verify with
Elimination
approach. built-in solver.
To solve linear
Decompose matrix ( A
LU systems
= LU ); solve for ( X ) Octave (lu()), Python
6 Decomposition efficiently using
given ( B ); compare ([Link]())
Method LU
with direct methods.
factorization.
Input (x, y) values;
To approximate generate interpolation
Polynomial and Octave / Python
a function from polynomial; plot
7 Lagrange ([Link],
discrete data interpolated curve and
Interpolation matplotlib)
points. compare with true
function.
Exp. Title of Major Tasks /
Objective Software / Tools
No. Experiment Activities
To compute
Numerical definite Implement both rules
Integration using
integrals for ( f(x)=\sin(x) ) on Octave / Python
8
Trapezoidal and numerically and [0, π]; compare with ([Link])
Simpson’s Rules compare analytical result.
accuracy.
To solve an
Solve (
initial value
Euler’s Method \frac{dy}{dx}=y-x^2+1
problem
9 for Solving ); compare results for Octave / Python
numerically
First-Order ODE step sizes h=0.1, 0.05;
using Euler’s
plot error vs. iteration.
method.
Solve (
To apply the
\frac{dy}{dx}=x+y,
4th order
Runge-Kutta y(0)=1 ); compute RK4
Runge-Kutta
10 (RK4) Method solution; compare Octave / Python
method and
for IVPs accuracy &
compare with
convergence with
Euler’s.
Euler’s method.