Lecture

Distributed Quantum Computing

In course

Consequat eiusmod ullamco laboris velit ut culpa. Occaecat exercitation deserunt minim magna eiusmod excepteur amet consectetur duis sint. Ullamco elit pariatur magna aliqua cupidatat aliquip aliqua amet. Incididunt minim culpa anim exercitation.

Description

This lecture explores distributed quantum computing, focusing on the calculation of a function F depending on binary sequences X and Y. The goal is for Alice and Bob to compute F(X, Y) efficiently, with minimal classical communication complexity. The lecture delves into quantum algorithms, including the use of quantum channels and entangled states to optimize communication complexity. The instructor demonstrates how quantum protocols can outperform classical communication methods, showcasing the power of quantum computation in distributed settings.

Instructors (3)

ea cillum exercitation

Ut quis ea nisi ex amet amet ad nostrud ut voluptate culpa. Exercitation ut tempor nulla ut. Exercitation nisi officia sint sunt ad nisi magna id cupidatat. In exercitation duis commodo mollit elit in nulla ipsum ad. Exercitation dolor minim mollit duis consequat commodo enim quis adipisicing nisi ut nostrud. Cillum deserunt exercitation in aliqua culpa eiusmod incididunt dolore amet sunt proident occaecat fugiat ex.

minim laboris sint

Pariatur ut veniam mollit cupidatat nostrud do mollit dolore. Ex commodo pariatur fugiat sint ad aute minim elit laborum nostrud deserunt. Nisi non consequat magna nulla officia tempor incididunt. Sunt aute dolor enim sit pariatur eiusmod cillum nisi.

adipisicing esse eiusmod

Nostrud ea adipisicing ad exercitation id voluptate pariatur do commodo magna anim labore nostrud. Amet proident amet non do culpa amet proident consectetur et sunt sunt. Irure ea eu reprehenderit qui duis tempor eu.

Official source

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

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

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.