An Overview of Quantum Algorithms

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=68yAT1XzYrA


Duration: 55:53
969 views
30

Ashley Montanaro (Phasecraft and University of Bristol)
https://simons.berkeley.edu/talks/ashley-montanaro-phasecraft-university-bristol-2024-04-24
Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms

Quantum computers are designed to outperform their classical counterparts by running quantum algorithms. In this talk I will give a brief general overview of quantum algorithms and their applications in fields including cryptography, search and optimisation, and simulation of quantum systems. I will discuss quantum algorithms designed for large-scale, fault-tolerant quantum computers, as well as algorithms designed for near-term devices.



Other Videos By Simons Institute for the Theory of Computing


2024-05-29Graph Algorithms in the MPC Model
2024-05-29An Introduction to Distributed, Massively Parallel, and Local Computation Algorithms
2024-05-29Sampling Big Ideas in Sublinear Algorithms
2024-05-29Counting Subgraphs in Sublinear Time
2024-05-29Testing Boolean Functions
2024-05-29Property Testing for Graphs
2024-04-30Using chaos to characterize a programmable analog quantum simulator
2024-04-30Fundamental limits to quantum computation
2024-04-30Evidence for the utility of quantum computing before fault tolerance
2024-04-30High-fidelity and Fault-tolerant Teleportation of a Logical Qubit on a Trapped-ion Quantum Computer
2024-04-30An Overview of Quantum Algorithms
2024-04-30Certifying almost all quantum states with few single-qubit measurements
2024-04-30Learning Shallow Quantum Circuits and Quantum States Prepared by Shallow Circuits in Polynomial Time
2024-04-30A Quantum Speed-Up for Approximating the Top Eigenvector of aMatrix via Improved Tomography
2024-04-30The Virtues of the Quantum Approximate Optimization Algorithm
2024-04-30Continuous-time quantum walks for MAX-CUT are hot
2024-04-30Circuit Conspiracies
2024-04-30Analog quantum machine learning for near-term hardware
2024-04-30Hardware-efficient quantum computing using qudits
2024-04-30Probing the limits of classical computing with arbitrarily connected quantum circuits
2024-04-30Emergence of Universal Randomness in Quantum Many-body Dynamics


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms
Ashley Montanaro