BEGIN:VCALENDAR
VERSION:2.0
X-WR-CALNAME;VALUE=TEXT:Online: Seminar, Matthias Christandl (University of Copenhagen), Fault-Tolerant Coding for Quantum Communication
PRODID:-//Harvard events data//EN
BEGIN:VEVENT
UID:event_1563866_0
SUMMARY:Online: Seminar, Matthias Christandl (University of Copenhagen), Fault-Tolerant Coding for Quantum Communication
DESCRIPTION:<p>	<drupal-media data-entity-type="media" data-entity-uuid="f9a07be2-854d-4bb5-b5a8-04ab58b76b9f" alt="Christiandl" data-view-mode="hwp_large"></drupal-media></p><p>	<strong>Location: </strong>Zoom <a href="https://harvard.zoom.us/j/779283357?pwd=MitXVm1pYUlJVzZqT3lwV2pCT1ZUQT09" title="">https://harvard.zoom.us/j/779283357?pwd=MitXVm1pYUlJVzZqT3lwV2pCT1ZUQT09</a></p><p>	<strong>Time: </strong>Tuesday, January 26, 2021, 10:00 AM (Eastern US), 15:00 (UK/Eire), 16:00 (Central Europe), 23:00 (China)</p><p>	<strong>Title:</strong> Fault-Tolerant Coding for Quantum Communication</p><p>	<strong>Abstract: </strong><span><span style="background:white"><span style="color:#000000"><span style="font-style:normal"><span style="font-variant-ligatures:normal"><span style="font-variant-caps:normal"><span style="font-weight:400"><span style="letter-spacing:normal"><span style="orphans:2"><span style="text-transform:none"><span style="white-space:normal"><span style="widows:2"><span style="word-spacing:0px"><span style="text-decoration-thickness:initial"><span style="text-decoration-style:initial"><span style="text-decoration-color:initial"><span style="sans-serif"><span><span style='UI",sans-serif'><span style="color:#201f1e">Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error it is usually assumed that these circuits can be implemented using noise-free gates. While this assumption is satisfied for classical machines in many scenarios, it is not expected to be satisfied in the near term future for quantum machines where decoherence leads to faults in the quantum gates. As a result, fundamental questions regarding the practical relevance of quantum channel coding remain open. By combining techniques from fault-tolerant quantum computation with techniques from quantum communication, we initiate the study of these questions. As our main result, we prove threshold theorems for quantum communication, i.e. we show that coding near the (standard noiseless) classical or quantum capacity is possible when the gate error is below a threshold. </span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></p><p style="margin:0in;text-align:start;-webkit-text-stroke-width:0px">	<span><span style="background:white"><span style="color:#000000"><span style="font-style:normal"><span style="font-variant-ligatures:normal"><span style="font-variant-caps:normal"><span style="font-weight:400"><span style="letter-spacing:normal"><span style="orphans:2"><span style="text-transform:none"><span style="white-space:normal"><span style="widows:2"><span style="word-spacing:0px"><span style="text-decoration-thickness:initial"><span style="text-decoration-style:initial"><span style="text-decoration-color:initial"><span style="sans-serif"><span><span style='UI",sans-serif'><span style="color:#201f1e">(Joint work with Alexander Müller-Hermes, </span></span></span><span style="color:black"><a data-saferedirecturl="https://www.google.com/url?q=https://urldefense.proofpoint.com/v2/url?u%3Dhttps-3A__arxiv.org_abs_2009.07161%26d%3DDwMGaQ%26c%3DWO-RGvefibhHBZq3fL85hQ%26r%3DnlqvXX6Jmbu52yOuosGBtKKs0OQ7eTClhH721mPk7Mc%26m%3DJQLWf-h69iDMiGLYI78CR17IE7y24yZPwKfrTIBAOfo%26s%3DOdQhNWKeFgJTA5r-Hw2pXT28UzUi7vrEK_NRzIZsg_A%26e%3D&amp;source=gmail&amp;ust=1610546554226000&amp;usg=AFQjCNFjyyX6fsCjyKix6_vYLK7sTxJo3g" href="https://urldefense.proofpoint.com/v2/url?u=https-3A__arxiv.org_abs_2009.07161&amp;d=DwMGaQ&amp;c=WO-RGvefibhHBZq3fL85hQ&amp;r=nlqvXX6Jmbu52yOuosGBtKKs0OQ7eTClhH721mPk7Mc&amp;m=JQLWf-h69iDMiGLYI78CR17IE7y24yZPwKfrTIBAOfo&amp;s=OdQhNWKeFgJTA5r-Hw2pXT28UzUi7vrEK_NRzIZsg_A&amp;e=" style="color:#1155cc" target="_blank"><span style="border:1ptnonewindowtext;padding:0in"><span style='UI",sans-serif'><span style="color:blue">https://arxiv.<wbr></wbr>org/abs/2009.07161</span></span></span></a></span><span><span style='UI",sans-serif'><span style="color:#201f1e">)</span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></p><p>	 </p><p>	<strong>Additional Ways to Join</strong><br>Join by telephone (use any number to dial in)<br>        +1 929 436 2866<br>        +1 312 626 6799<br>        +1 669 900 6833<br>        400 669 9381 China Toll-free</p><p>	International numbers available: <a href="https://harvard.zoom.us/u/aclg6kOggb">https://harvar</a><a href="https://harvard.zoom.us/u/aclg6kOggb">d.zoom.us/u/aclg6kOggb</a></p><p>	One tap mobile: +19294362866,,779283357# US (New York)<br>    <br>Join by SIP conference room system<br>Meeting ID: 779 283 357<br><a href="mailto:779283357@zoomcrc.com">779283357@zoomcrc.com</a></p><p>	<strong>Attachments</strong></p>
LOCATION:Zoom
STATUS:CONFIRMED
DTSTART:20210126T150000Z
DTEND:20210126T150000Z
END:VEVENT
END:VCALENDAR