Quantum Algorithms for Approximating Partition Functions

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


Duration: 1:05:31
371 views
6

Yassine Hamoudi (Simons Institute)
https://simons.berkeley.edu/talks/yassine-hamoudi-simons-institute-2023-07-11
Quantum Summer Cluster Workshop



Other Videos By Simons Institute for the Theory of Computing


2023-07-14Improved Machine Learning Algorithm for Predicting Ground State Properties
2023-07-14Learning Beyond Stabilizer States
2023-07-14Quantum Commitments and Black Hole Radiation Decoding
2023-07-14Geometry, Entropy and Complexity in Quantum Gravity (Part II)
2023-07-14Geometry, Entropy and Complexity in Quantum Gravity (Part I)
2023-07-13Dissipative State Preparation and the Dissipative Quantum Eigensolver
2023-07-13QMA and the Power of “Positivity”
2023-07-13Compiled Nonlocal Games: From CHSH to BQP Verification
2023-07-12Making the Leap to Quantum PCPs
2023-07-12How Simulating Balls and Springs Captures the Power of Quantum Computing
2023-07-12Quantum Algorithms for Approximating Partition Functions
2023-07-12Quantum Gibbs Sampling
2023-07-11Quantum Advantage with Shallow Clifford Circuits
2023-07-11Utility, Computational Cost, and Effective Quantum Volume of NISQ Experiments
2023-07-11A Phase Transition in Linear Cross-Entropy Benchmarking
2023-07-11Validated Quantum Advantage via Bell Sampling
2023-07-11Verifiable Quantum Supremacy: What I Hope Will Be Done
2023-07-01Representation Theory in TCS and Extremal Combinatorics
2023-07-01On Perfectly Friendly Bisections of Random Graphs
2023-07-01Localization Schemes
2023-07-01Linearity Testing over the Biased Cube


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Quantum Summer Cluster Workshop
Yassine Hamoudi