Explore a 34-minute conference talk by Jens Eisert from Freie Universität Berlin, delivered at the Fields Institute as part of the Conference on Quantum Information and Quantum Control IX. Delve into the intriguing topic of how a single T-gate can significantly impact the complexity of distribution learning in quantum computing. Gain insights into the challenges and implications of this phenomenon for quantum information processing and computational complexity theory. Examine the speaker's research findings and their potential consequences for the development of quantum algorithms and quantum machine learning techniques.
A Single T-Gate Makes Distribution Learning Hard
Overview
Syllabus
A Single T-Gate Makes Distribution Learning Hard
Taught by
Fields Institute
Related Courses
-
Practical Quantum Computing with IBM Qiskit for Beginners
-
Do Quantum Computers Have Applications in Machine Learning and Combinatorial Optimization
-
Optimal Hadamard Gate Count for Clifford+T Synthesis of Pauli Rotations Sequences
-
Random Approximate t-Designs in Quantum Information - Lecture
-
Understanding Quantum Machine Learning Also Requires Rethinking Generalization
-
The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation
