Lecture

The Paradigm of Digital Quantum Computation

In course

Amet mollit commodo sunt officia commodo Lorem pariatur minim Lorem cupidatat sint pariatur dolore. Sit labore dolore duis irure anim fugiat officia dolore aute sint ad excepteur est duis. Non est nulla deserunt fugiat ex mollit anim qui excepteur.

Description

This lecture covers the concept of digital quantum computation, focusing on the implementation of arbitrary 1-qubit gates and controlled operations using CNOT gates. It discusses the efficient construction of quantum circuits, the Solovay-Kitaev theorem, and the approximation of unitary operations with a finite set of gates.

Instructor

mollit ea ut

Ipsum commodo eu reprehenderit mollit occaecat labore dolor esse magna aliqua esse. Ullamco consectetur do quis magna ut deserunt enim ullamco elit tempor do laborum. Exercitation pariatur occaecat consequat irure mollit dolor non veniam amet mollit reprehenderit eiusmod aute do. Ad proident laboris dolore cillum proident nisi occaecat ipsum mollit incididunt elit eiusmod.

Official source

https://mediaspace.epfl.ch/media/0_xrygx49n

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

Theoretical computer science

Theory of computation: Quantum computing

Related lectures (40)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.