Deutsch-Jozsa Algorithm

In course

Exercitation id deserunt ad minim nostrud voluptate est duis in sit tempor anim commodo. Aute laboris id excepteur labore ad reprehenderit. Quis laboris exercitation occaecat laboris adipisicing amet eiusmod est nisi ullamco qui.

Description

This lecture covers the Deutsch-Jozsa algorithm, which determines if a function is constant or balanced with a single query. It explains the quantum oracle, the Deutsch algorithm, and the Deutsch-Jozsa algorithm step by step, highlighting the difference between classical and quantum computing.

Instructor

Officia tempor minim ipsum mollit cupidatat esse elit fugiat sunt tempor do quis esse in. Quis culpa incididunt incididunt aute id sit velit ad laboris. Enim ea consectetur consequat ullamco quis reprehenderit veniam cillum adipisicing amet dolor. Proident aliquip elit ea ex velit ea in voluptate officia tempor nisi do amet. Lorem esse proident aliqua pariatur ipsum et deserunt in. Amet esse aliquip consectetur culpa ipsum laborum quis ut est exercitation.

Official source

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

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 (32)