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
Density Operator Formalism
Graph Chatbot
Related lectures (29)
Previous
Page 2 of 3
Next
Correctness and Soundness of the Qubit Test
Explores the correctness and soundness of the Qubit Test, emphasizing probabilistic algorithms, trapdoors, and function inversion.
Theory of Computation: NP Problems Examples
Examines NP problems, graph coloring, path optimization, and computational complexity distinctions in P and NP classes.
Quantum Approximate Optimization Algorithm
Covers the Quantum Approximate Optimization Algorithm, physically inspired unitary coupled cluster ansatz, hardware-efficient ansatz, and variational quantum eigensolver.
Complexity of Algorithms: Big-O Notation
Explores algorithm complexity, big-O notation, induction, recursion, and analysis of running times, covering NP problems and complexity classes.
Theory of Computation: NP Complexity
Delves into oracles, certificates, and the NP complexity class, raising the fundamental P versus NP question.
Shor Algorithm: Circuit Details II
Explores the Shor algorithm circuit details for efficient number factoring using quantum computing.
Quantum Approximate Optimization Algorithm
Covers the Quantum Approximate Optimization Algorithm (QAOA) for solving combinatorial optimization problems using quantum computers and its application to Boolean Satisfiability (SAT) problems.
Max-Flow Min-Cut
Explores the Ford Fulkerson algorithm, Max-Flow Min-Cut theorem, Incidence matrix, and network optimization complexity.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Understanding Complexity: Tractable Problems and NP-Complete
Covers complexity classes, effect on computer time, tractable problems, class NP, and NP-complete problems.
