YoVDO

Learning Shallow Quantum Circuits and Quantum States in Polynomial Time

Offered By: Simons Institute via YouTube

Tags

Quantum Circuits Courses Quantum Computing Courses Computational Complexity Courses Quantum States Courses Circuit Complexity Courses Polynomial Time Algorithm Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore polynomial time algorithms for learning constant depth quantum circuits and quantum states in this lecture by Yunchao Liu from UC Berkeley. Discover efficient techniques to reconstruct quantum systems with low circuit complexity using local observables. Gain insights into approximating unknown constant depth quantum circuits on finite-dimensional lattices and learning to prepare quantum states generated by such circuits. Delve into the extension of these algorithms to polylog(n) depth circuits with quasi-polynomial run-time. Grasp key concepts through simple and accessible explanations, based on recent research in arxiv 2401.10095 and upcoming work with Zeph Landau.

Syllabus

Learning Shallow Quantum Circuits and Quantum States Prepared by Shallow Circuits in Polynomial Time


Taught by

Simons Institute

Related Courses

Intro to Computer Science
University of Virginia via Udacity
Quantum Mechanics for IT/NT/BT
Korea University via Open Education by Blackboard
Emergent Phenomena in Science and Everyday Life
University of California, Irvine via Coursera
Quantum Information and Computing
Indian Institute of Technology Bombay via Swayam
Quantum Computing
Indian Institute of Technology Kanpur via Swayam