Lecture

Simon 1 Problem: Quantum Symmetry and Oracle Queries

Related lectures (30)

Elements of computational complexity

Covers classical and quantum computational complexity concepts and implications.

Quantum Computing: Introduction

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

Shor Algorithm: Circuit Details II

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

Groups and Numbers: Hidden Subgroup Problem

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

Deutsch and Josza Problem

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

Quantum Computation: Mechanisms and Advantages of Restricted Models

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

Grover's Quantum Search Algorithm

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

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.

Quantum Algorithms: Complexity and Learning Insights

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

Shor's factoring algorithm: Quantum Phase Estimation

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

Elements of Computational Complexity

Covers quantum algorithms, complexity classes, Grover's algorithm, and quantum information in computational complexity.

Quantum and nanocomputing

Covers quantum and nanocomputing, discussing quantum algorithms, nanoscale devices, and computational complexity.

Quantum Computational Advantage: Recent Progress and Next Steps

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

Quantum Computing: NISQ and Grover's Algorithm

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

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.

Quantum Circuits: Model and Computation

Covers quantum circuits, computation model, unitary inclusion, simulation, precision, qubits, and global aspects.

Quantum and nanocomputing: Exercise session 2

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

Quantum and nanocomputing

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

Quantum and Nanocomputing

Explores quantum computing fundamentals, including qubits, gates, and entanglement, as well as the impact of quantum computing on society.