Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Shor Algorithm: Circuit Details II
Graph Chatbot
Related lectures (30)
Previous
Page 2 of 3
Next
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 and nanocomputing
Covers the basics of number theory, RSA encryption, and Shor's period finding algorithm.
Shor's Factoring Algorithm
Covers Shor's factoring algorithm, which efficiently factors large numbers using quantum computers.
Optimization Algorithms
Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.
Algorithmic Complexity: Travel Time Analysis
Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.
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 and nanocomputing
Covers quantum and nanocomputing, discussing quantum algorithms, nanoscale devices, and computational complexity.
Deutsch and Josza Problem
Covers the Deutsch and Josza problem in quantum computation, focusing on boolean functions and oracles.
Quick Sort Analysis: Finding k Smallest
Covers the analysis of quick sort, including time complexity and randomization for finding the k-th smallest number.
Quantum Computational Advantage: Recent Progress and Next Steps
Explores recent progress in quantum computational advantage and discusses the challenges in achieving quantum supremacy.
