YoVDO

Quantum Algorithms - From Far to Near Future

Offered By: Fields Institute via YouTube

Tags

Quantum Computing Courses Quantum Information Processing Courses Hamiltonian Simulation Courses Quantum Field Theory Courses

Course Description

Overview

Explore a comprehensive lecture on quantum algorithms and their applications from near-term to long-term prospects. Delve into quantum field theory simulations, classical vs. quantum approaches, and key concepts like Hamiltonian simulation and ground-state generation. Examine innovative techniques for state preparation and information extraction from quantum states. Investigate empirical hardness models and their methodology, with a focus on the Hamiltonian Cycle Problem. Gain insights into the future vision for quantum computing and its potential impact on algorithmic problem-solving.

Syllabus

Intro
Quantum Field Theory
Why to simulate a QFT?
Classical Simulations
It's all about preparing and measuring quantum states
Kingdome of Q Algorithms: Hamiltonian Simulati
Simulating a QFT on Q computer
Ground-State Generation
State preparation by inequality testing
Beyond ground state and translational symmetries
Extracting information from quantum states
Empirical Hardness Models (EHMs)
Empirical Hardness Methodology
EHM for Hamiltonian Cycle Problem
Vision for Quantum Case


Taught by

Fields Institute

Related Courses

Quantum Computing
Indian Institute of Technology Kanpur via Swayam
Квантовые вычисления (Quantum computing)
Saint Petersburg State University via Coursera
Quantum Technology: Computing
Purdue University via edX
Superposition, Entanglement, and Raising Schroedinger's Cat
APS Physics via YouTube
Quantum Technology - Concepts and Prospects
International Centre for Theoretical Sciences via YouTube