Analog quantum machine learning for near-term hardware

Published on ● Video Link: https://www.youtube.com/watch?v=i-B4fng9o4w



Category:
Vlog
Duration: 48:02
162 views
5


Susanne Yelin (Harvard University)
https://simons.berkeley.edu/talks/susanne-yelin-harvard-university-2024-04-25
Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms

Analog quantum machine learning leverages the natural dynamics of quantum systems to perform computations, making it uniquely suited for operation on current, noisy quantum hardware. In this context, we explore how a modern programmable quantum simulator embodies the necessary capabilities for executing diverse cognitive tasks, including multitasking, decision-making, and memory enhancement. A crucial advancement is the introduction of a foundational component for various learning architectures. I will illustrate the versatility of this approach by applying it to tasks such as calculating energy measurements and enhancements in quantum metrology and highlight how a hybrid quantum-classical approach can enhance the present-day applicability of quantum algorithms.




Other Videos By Simons Institute for the Theory of Computing


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
2024-04-30Exploring the quantum computing frontier with reconfigurable atom arrays
2024-04-30On Scrambling Times of Quantum Systems, Including Black Holes
2024-04-30From randomized benchmarking to cycle error reconstruction
2024-04-30How to fault-tolerantly realize any quantum circuit with local operations
2024-04-30Quantum Lego: Quantum Codes and their Enumerators from Tensor Networks
2024-04-30QEC demonstrations leveraging dynamic circuits
2024-04-30Scheduling syndrome measurement circuits



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
Susanne Yelin