← Back to all lectures

Algorithms & Theory

12 lectures in this category

58 | Variational Quantum Semi-definite Programming

58 | Variational Quantum Semi-definite Programming

Solving optimization problems is a key task for which quantum computers could possibly provide a speedup over the best known classical algorithms.

41 | The Nonequilibrium Cost of Accuracy
Algorithms & Theory Giulio Chiribella

41 | The Nonequilibrium Cost of Accuracy

Accurate information processing is crucial both in technology and in nature.

40 | Parameter Setting in Quantum Approximate Optimization of Weighted Problems
Algorithms & Theory Ruslan Shaydulin

40 | Parameter Setting in Quantum Approximate Optimization of Weighted Problems

Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate algorithm for solving combinatorial optimization problems on quantum computers.

33 | Quantum Graphical Calculi: Tutorial and Applications

33 | Quantum Graphical Calculi: Tutorial and Applications

Quantum computing and quantum communication provide potential speed-up and enhanced security compared with their classical counterparts.

30 | Efficient Hamiltonian Reduction for Scalable Quantum Computing on Clique Cover/Graph Coloring Problems in SatCom

30 | Efficient Hamiltonian Reduction for Scalable Quantum Computing on Clique Cover/Graph Coloring Problems in SatCom

Clique cover and graph coloring are complementary problems which have many applications in wireless communications, especially in satellite communications (SatCom).

29 | Rethinking Most-significant Digit-first Arithmetic for Quantum Computing in NISQ Era

29 | Rethinking Most-significant Digit-first Arithmetic for Quantum Computing in NISQ Era

In recent years, quantum computers have attracted extensive research interest due to their potential capability of solving problems which are not easily solvable using classical computers.

27 | Understanding Quantum Supremacy Conditions for Gaussian Boson Sampling with High Performance Computing

27 | Understanding Quantum Supremacy Conditions for Gaussian Boson Sampling with High Performance Computing

Recent quantum supremacy experiments demonstrated with boson sampling garnered significant attention, while efforts to perfect approximate classical simulation techniques challenge supremacy claims on different fronts.

19 | Classical Verification of Quantum Depth

19 | Classical Verification of Quantum Depth

Verifying if a remote server has sufficient quantum resources to demonstrate quantum advantage is a fascinating question in complexity theory as well as a practical challenge.

10 | Solving Nonlinear Partial Differential Equations using Variational Quantum Algorithms on Noisy Quantum Computers

10 | Solving Nonlinear Partial Differential Equations using Variational Quantum Algorithms on Noisy Quantum Computers

Partial differential equations (PDEs) have long been the center of interest to system modeling in many disciplines of science and engineering, such as computational physics, fluid mechanics, and quantitative finance.

4 | Enabling Parallel Circuit Execution on NISQ Hardware

4 | Enabling Parallel Circuit Execution on NISQ Hardware

Today’s quantum computers are in the Noisy Intermediate-Scale Quantum era and prone to errors.

3 | Introduction to Variational Quantum Algorithms
Algorithms & Theory Jinglei Cheng

3 | Introduction to Variational Quantum Algorithms

A lecture by Jinglei Cheng on quantum computing.