Explore the computational gap between classical and quantum computers in this 46-minute lecture by Michael Foss Feig from the University of Maryland. Delve into empirical evidence from experiments sampling two-dimensional quantum circuit outputs and examine classical simulation attempts using tensor network techniques. Analyze the limitations of current quantum hardware, focusing on gate fidelity and connectivity issues in 50+ qubit systems. Investigate how these factors impact the generation of highly-entangled states and classical simulability. Discover numerical evidence highlighting the challenges of random circuit sampling in highly connected geometries, shedding light on the future of quantum computing advancements.
Probing the Limits of Classical Computing with Arbitrarily Connected Quantum Circuits
Overview
Syllabus
Probing the limits of classical computing with arbitrarily connected quantum circuits
Taught by
Simons Institute
Related Courses
-
Shallow Quantum Circuits: Unconditional Separations Between Quantum and Classical Computing
-
Quantum Computing on Classical Machines with Tensor Networks
-
Dynamic Circuits and Classical Processing in Quantum Computing - Episode 5
-
Random Quantum Circuits, Phase Transitions and Complexity - Aram Harrow
-
Theory of Near-Term Quantum Advantage - Part 1
-
Phase Transitions in the Complexity of Simulating Random Shallow Quantum Circuits
