Simulating Quantum Computation - Classical Data Requirements and Efficiency
Centre for Quantum Technologies via YouTube
Master AI and Machine Learning: From Neural Networks to Applications
The Most Addictive Python and SQL Courses
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
Explore a technical colloquium talk from the Centre for Quantum Technologies where Dr. Robert Raussendorf from Leibniz University Hannover discusses a novel classical simulation method for universal quantum computation with magic states. Delve into the analysis of a sampling-based approach that operates through probability functions, contrasting it with Wigner function-based sampling methods. Learn about the key distinction where negativity in probability functions, typically a marker for quantum advantage, is absent in this simulation model. Discover how the classical data requirements for this simulation method remain surprisingly modest, requiring only 2n^2+O(n) bits to describe the quantum system for n magic states, as detailed in the research paper arXiv:2305.17287.
Syllabus
Simulating quantum computation: how many "bits" for "it"?
Taught by
Centre for Quantum Technologies