A Converse for Fault-tolerant Quantum Computation - Fundamentals and Lower Bounds
Centre for Networked Intelligence, IISc via YouTube
Build with Azure OpenAI, Copilot Studio & Agentic Frameworks — Microsoft Certified
The Fastest Way to Become a Backend Developer Online
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Watch a 56-minute lecture exploring fundamental lower bounds on redundancy in fault-tolerant quantum computation, delivered by Prof. Avhishek Chatterjee from IIT Madras at the Centre for Networked Intelligence, IISc. Delve into the analysis of redundancy requirements for ε-accurate implementation of operations including unitary operators, particularly focusing on sub-exponential depth and sub-linear gate size scenarios. Learn how fault-tolerant computation connects with finite blocklength quantum communication problems and understand the implications for noise thresholds in non-degradable noise conditions. Progress through topics including classical versus quantum output comparisons, computational models, noise and decoherence of qubits, and practical implications of fault-tolerant quantum computing. No prior knowledge of quantum computation and communication is required for this accessible presentation by an expert whose research spans stochastic and information networks in both classical and quantum domains.
Syllabus
Intro
Summary
A slight detail on classical vs quantum output
Computational models
Use of quantum computational model for classical o
Noise and decoherence of qubits
Fault-tolerant quantum computing
Existing results
Practical implications
Proof approach
When the intended output is classical
Conclusion
Taught by
Centre for Networked Intelligence, IISc