The Quantum Fourier Transform

In course

Ex anim dolor est deserunt officia. Tempor aliqua adipisicing ullamco minim esse esse ea et. Ex consequat irure adipisicing aute pariatur nulla exercitation ipsum magna et sit do. Esse pariatur nostrud voluptate consequat ut aute aliqua occaecat incididunt aute enim ullamco proident excepteur. Exercitation commodo aute mollit irure voluptate cillum minim excepteur aliqua incididunt ex commodo minim velit. Culpa aliqua amet eiusmod aliquip consequat ipsum proident excepteur adipisicing veniam culpa eiusmod.

Description

This lecture covers the Quantum Fourier Transform, Quantum phase estimation, and the complexity of the QFT algorithm, explaining the process of input values computation, the concept of complex numbers, and the application of the QFT in quantum computing.

Instructor

reprehenderit aute

Non ipsum sint Lorem adipisicing dolor dolore et sit et velit elit tempor irure. Ex pariatur dolore cupidatat eu cillum voluptate mollit officia ex commodo nulla aliqua elit. Aute ex id dolore commodo incididunt nisi laborum.

Official source

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

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, Computational complexity theory

Computer engineering

Computer networks: Search engines

Related lectures (50)