Lecture
Quantum computing: basics
Description
This lecture covers the fundamentals of quantum computing, starting with the birth of quantum physics in the 1920s and leading up to recent advancements like Google's quantum supremacy announcement in 2019. Topics include qubits, superposition, measurement mysteries, entanglement, quantum gates, and quantum algorithms such as Grover's, Deutsch-Josza, Bernstein-Vazirani, Simon's, and Shor's. The lecture also introduces quantum gates like Hadamard and the oracle gate, and discusses quantum algorithms for problem-solving, emphasizing the efficiency of quantum computing compared to classical methods.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related lectures (54)
Quantum Random Number Generation
Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.
Quantum Computation Delegation
Explores fully classical qubits, blind quantum computing, and verifiability in quantum delegation protocols.
Quantum Entanglement
Explores quantum entanglement, Bell inequalities, and self-testing in quantum systems.
Quantum Computation Delegation
Covers the concept of quantum computation delegation and the relationship between MIP and RE, addressing common FAQs and discussing helpful materials and interactions with quantum devices.
Linear Algebra in Dirac Notation
Covers linear algebra in Dirac notation, focusing on vector spaces and quantum bits.