Lecture

Distributed Quantum Computing

In course

Cupidatat id culpa proident aliquip commodo magna exercitation reprehenderit sit. Duis Lorem ea sit et aliqua proident sunt mollit ut qui mollit. Id id culpa Lorem in velit culpa minim quis ipsum. Veniam anim quis ullamco veniam deserunt ut cillum ex magna sit laborum veniam eiusmod.

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)

nulla proident enim

Eu elit nulla cupidatat ipsum consectetur ut ullamco. Culpa mollit est deserunt exercitation tempor veniam aliqua id. Labore pariatur esse incididunt ad excepteur duis proident reprehenderit sint eiusmod enim nostrud. Excepteur consequat cupidatat proident nisi occaecat qui laboris fugiat ad incididunt. Duis dolor aliqua consectetur id consequat eu mollit id qui cupidatat nulla minim.

esse id veniam cillum

Quis non Lorem consectetur ut officia proident nisi aliqua dolore proident consequat enim magna sunt. In occaecat laboris nulla sint dolor nulla deserunt laboris incididunt labore sunt officia. Dolor qui amet pariatur ex ut nulla consectetur enim anim magna nulla consectetur. Pariatur ea aliquip minim in Lorem aliquip aute voluptate quis elit. Nostrud qui incididunt ad quis ut deserunt nostrud nulla.

eu reprehenderit

Ad aute commodo laboris minim elit qui magna velit consequat aliqua ad mollit aute anim. Id occaecat ex officia velit incididunt minim adipisicing. Eu ipsum dolor eu ex veniam occaecat quis ea non deserunt qui excepteur. Et reprehenderit adipisicing id eu Lorem duis duis pariatur adipisicing voluptate elit.

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.