Quantum computation gained attention when Peter Shor published a (quantum) method for factorizing a product of two large prime numbers in expected polynomial time. Factorizing a product of two large prime numbers provides the means to decrypt RSA encoded messages, which is used by many secure internet protocols.
CSET hosted a seminar which introduced classical computing based on bitwise operations and circuits. Professor Willi-Hans Steeb from the Department of Applied Mathematics at the University of Johannesburg presented a seminar entitled “Classical Computing, Quantum Computing, Circuits and Algorithms”, which he was previously also invited to present at the Swiss Federal Institute of Technology Zurich (ETHZ).
He progressed to quantum computations and their representation as quantum circuits, including the quantum Fourier transform. Some famous quantum algorithms, namely the solution to Deutsch’s problem and a brief introduction to Shor’s algorithm, were also presented. Finally Prof. Steeb also demonstrated the (linear) embedding of nonlinear dynamical systems in a Hilbert space by using Bose operators and coherent states.
Professor Willi-Hans Steeb, Department of Applied Mathematics at University of Johannesburg
Prof Yorick Hardy, Professor Willi-Hans Steeb and Prof Seithuti Moshokoa
