Quantum Algorithms for Hamiltonian Simulation with Unbounded Operators

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


Duration: 13:20
316 views
11

Di Fang (University of California, Berkeley)
https://simons.berkeley.edu/talks/quantum-algorithms-hamiltonian-simulation-unbounded-operators
Meet the Fellows Welcome Event Fall 2022



Other Videos By Simons Institute for the Theory of Computing


2022-09-10Simplicity and Optimality in Algorithmic Economics
2022-09-10Algorithms Using Local Graph Features to Predict Epidemics
2022-09-10Beyond Worst Case Analysis in ML
2022-09-09Pseudorandom Generators and Small-Space Derandomization
2022-09-09Competitive Control
2022-09-09Machine Learning on Large-Scale Graphs
2022-09-09Adaptive Online Learning without Prior Knowledge
2022-09-09Incentive-Aware Machine Learning
2022-09-09How Robust Is the Gittins Index? A Queueing Case Study
2022-09-09Quantum Scientific Computation
2022-09-09Quantum Algorithms for Hamiltonian Simulation with Unbounded Operators
2022-09-09Recent Trends in Minimum Cut Algorithms
2022-09-09The Power of Two Matrices in Spectral Algorithms
2022-09-09Approximately Efficient Bilateral Trade
2022-09-09Exploration for Algorithmic Fairness
2022-09-09On universal portfolios with continuous side information
2022-09-09Estimation of Games under No Regret
2022-09-09Misinformation, Persuasion, and News Media on Social Networks
2022-09-08Transmission Neural Networks: From Virus Spread Models to Neural Networks
2022-09-08Understanding the Geometry of Graph Neural Networks
2022-09-08Diversity and inequality in social networks


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Meet the Fellows Welcome Event Fall 2022
Di Fang