Quantum neural networks

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



Duration: 30:34
120 views
0


Kerstin Beer (Macquarie University)
https://simons.berkeley.edu/talks/kerstin-beer-macquarie-university-2024-04-26
Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms

Machine learning, particularly as applied to deep neural networks via the back-propagation algorithm, has brought enormous technological and societal change. With the advent of quantum technology it is a crucial challenge to design quantum neural networks for fully quantum learning tasks. In my talk I will introduce you to dissipative quantum neural networks. Functioning in a feed-forward manner, they embody a true quantum equivalent to classical neural networks and are capable of universal quantum computation. For training these networks we use the fidelity as a cost function and benchmark the proposal for the quantum task of learning an unknown unitary operation.




Other Videos By Simons Institute for the Theory of Computing


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
2024-04-30Halving the cost of surface codes by running error correction at the logical level
2024-04-30A NASA Perspective on Quantum Computing, with Emphasis on Recent Results in Distributed Computing
2024-04-30Quantum neural networks
2024-04-30Classical algorithm for simulating experimental Gaussian boson sampling
2024-04-30Dawn in the age of quantum fault tolerance
2024-04-25Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
2024-04-24Parameterized Inapproximability of the Minimum Distance Problem over all Fields...
2024-04-24List-decoding random codes ensembles
2024-04-24Tree codes
2024-04-24An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes
2024-04-24Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
2024-04-24Asymptotically-Good RLCCs with (log n)^{2+o(1)} Queries
2024-04-24Relaxed Local Correctability from Local Testing



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
Kerstin Beer