Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers classic circuits in quantum computing, including Boolean functions, cell models, and the concept of reversible gates. The slides discuss the definition of classic circuits, Boolean functions, and the representation of functions in quantum circuits. The instructor explains the concept of reversible gates and their role in quantum computing. The lecture also delves into examples of functions and circuits, logical gates, and the mathematical equivalence of circuits. The presentation concludes with a focus on the implementation of reversible gates in quantum circuits.