Lectures related to Quantum and nanocomputing

Covers classical and quantum computational complexity concepts and implications.

Covers quantum computing basics, quantum algorithms, error correction, and quantum bit manipulation.

Quantum Computation: Mechanisms and Advantages of Restricted Models

Covers the mechanisms behind quantum computation and explores the advantages of restricted computational models.

Explains Grover's Quantum Search Algorithm, which outperforms classical algorithms in searching unstructured databases using O(√N) queries.

Quantum Algorithms: Complexity and Learning Insights

Explores quantum algorithms, their complexity, and applications in learning, highlighting key concepts and recent research findings.

Groups and Numbers: Hidden Subgroup Problem

Explores groups and numbers, emphasizing the hidden subgroup problem and its complexities in classic and quantum algorithms.

Simon 1 Problem: Quantum Symmetry and Oracle Queries

Explores the Simon 1 problem in quantum computing, emphasizing symmetry, oracle queries, and quantum measurements.

The Deutsch and Deutsch-Jozsa Algorithms

Covers the Deutsch and Deutsch-Jozsa algorithms in quantum computing, explaining the principles behind them and their implications.

Quantum Phase Estimation

Explains the Quantum Phase Estimation (QPE) algorithm and its complexity using two registers and SWAP gates.

Deutsch and Josza Problem

Covers the Deutsch and Josza problem in quantum computation, focusing on boolean functions and oracles.

Quantum Computing: NISQ and Grover's Algorithm

Covers NISQ computing, error correction, quantum algorithm complexity, and Grover's search algorithm.

Quantum Computational Advantage: Recent Progress and Next Steps

Explores recent progress in quantum computational advantage and discusses the challenges in achieving quantum supremacy.

Shor's factoring algorithm: Quantum Phase Estimation

Covers Shor's factoring algorithm and the link between order finding and factoring.

Shor Algorithm: Circuit Details II

Explores the Shor algorithm circuit details for efficient number factoring using quantum computing.

Quantum and nanocomputing: Exercise session 2

Covers quantum computing, nanocomputing, energy calculations, and computational complexity.

Shor's Factoring Algorithm

Covers Shor's factoring algorithm, which efficiently factors large numbers using quantum computers.

Quantum and nanocomputing

Explores Grover's algorithm, Bernstein-Vazirani problem, quantum arithmetic, and Fourier transform in quantum computing.

Quantum Computing: Fundamentals and Applications

Covers the fundamentals of quantum computing, including qubit realization, scalable quantum computers, quantum communication, and quantum algorithms.

Quantum Information and Computing

Covers quantum information, computing, algorithms, error correction, and challenges in the field.

The Quantum Fourier Transform

Covers the Quantum Fourier Transform and its application in quantum computing, explaining the process of input values computation and the concept of complex numbers.