{"id":314585,"date":"2016-12-28T13:33:55","date_gmt":"2016-12-28T21:33:55","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-event&#038;p=314585"},"modified":"2018-11-08T15:47:26","modified_gmt":"2018-11-08T23:47:26","slug":"qip-2017","status":"publish","type":"msr-event","link":"https:\/\/www.microsoft.com\/en-us\/research\/event\/qip-2017\/","title":{"rendered":"Quantum Information Processing 2017 hosted by Microsoft Research"},"content":{"rendered":"<p><strong>Tutorials:<\/strong> January 14\u201315<\/p>\n<p><strong>Venue:<\/strong>\u00a0<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/www.starwoodmeeting.com\/events\/start.action?id=1606227091&key=16708A64\" target=\"_blank\" rel=\"noopener\">Westin Downtown Seattle<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<p>Join the conversation on Twitter during the conference! Add #QIP2017 to your tweets and posts.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>QIP 2017 will be hosted in Seattle, Washington by the QuArC group at Microsoft Research in Redmond and the University of Washington January 14-20, 2017.<\/p>\n","protected":false},"featured_media":427197,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr_startdate":"2017-01-14","msr_enddate":"2017-01-20","msr_location":"Seattle, WA, USA","msr_expirationdate":"","msr_event_recording_link":"","msr_event_link":"https:\/\/microsoftqip2017.eventcore.com\/","msr_event_link_redirect":false,"msr_event_time":"","msr_hide_region":false,"msr_private_event":false,"footnotes":""},"research-area":[243138],"msr-region":[197900],"msr-event-type":[197944],"msr-video-type":[],"msr-locale":[268875],"msr-program-audience":[],"msr-post-option":[],"msr-impact-theme":[],"class_list":["post-314585","msr-event","type-msr-event","status-publish","has-post-thumbnail","hentry","msr-research-area-quantum","msr-region-north-america","msr-event-type-hosted-by-microsoft","msr-locale-en_us"],"msr_about":"<strong>Tutorials:<\/strong> January 14\u201315\r\n\r\n<strong>Venue:<\/strong>\u00a0<a href=\"https:\/\/www.starwoodmeeting.com\/events\/start.action?id=1606227091&amp;key=16708A64\" target=\"_blank\" rel=\"noopener\">Westin Downtown Seattle<\/a>\r\n\r\nJoin the conversation on Twitter during the conference! Add #QIP2017 to your tweets and posts.","tab-content":[{"id":0,"name":"QIP 2017","content":"<h2>20th Annual Conference on Quantum Information Processing<\/h2>\r\n<img class=\"alignleft wp-image-314669\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/11\/QIP2017-Seattle_940x600.jpg\" alt=\"QIP 2017 Seattle Washington\" width=\"455\" height=\"291\" \/>QIP 2017 was hosted in Seattle, Washington by the <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/group\/quantum-architectures-and-computation-group-quarc\/\" target=\"_blank\" rel=\"noopener\">QuArC <\/a>group at Microsoft Research in Redmond and the University of Washington.\r\n\r\nThe international annual Quantum Information Processing (QIP) series is the premier meeting for theoretical quantum information research. Since 1998, the conference has featured breakthroughs by the leaders in the disciplines of computing, cryptography, information theory, mathematics and physics. The scientific objective of the series is to gather the theoretical quantum information community to present and discuss the latest groundbreaking work in the field.\r\n\r\nQIP 2017 is the twentieth international conference on theoretical aspects of quantum computing, quantum cryptography, and quantum information in a series that started in Aarhus in 1998 and was last held in 2016 in Banff.\r\n\r\nNew this year: QIP will feature parallel tracks each day of the conference, allowing for more accepted talks!\r\n\r\n[accordion]\r\n\r\n[panel header=\"Get QIP 2017 announcements\"]\r\n\r\nTo receive announcements, calls for papers and other general information about QIP 2017, send an email from your preferred email address to <a href=\"mailto:qip2017-accounce@lists.research.microsoft.com\">qip2017-accounce@lists.research.microsoft.com<\/a> with the following:\r\n\r\nSubject: SUBSCRIBE\r\nBody of message: SUBSCRIBE QIP2017-ANNOUNCE FirstName LastName\r\n\r\nTo <strong>unsubscribe<\/strong>, send an email from your preferred email address with the following:\r\n\r\nSubject: UNSUBSCRIBE\r\nBody of message: UNSUBSCRIBE QIP2017-ANNOUNCE FirstName LastName\r\n\r\n[\/panel]\r\n\r\n[panel header=\"Join the QIP 2017 discussion\"]\r\n\r\nTo join the discussion with other conference participants about logistics of the conference (e.g., finding a roommate or planning a hike, etc.), send an email from your preferred email address to <a href=\"mailto:listserv@list.research.microsoft.com\">listserv@list.research.microsoft.com<\/a> with an empty subject line the following message body:\r\n\r\nSUBSCRIBE QIP2017-DISCUSS FirstName LastName\r\n\r\nIf you successfully subscribe, you will receive a confirmation email that you must reply to. If you do not receive the confirmation email, please check your spam\/ junk folder.\r\n\r\nTo <strong>unsubscribe<\/strong>, send an email from your preferred email address with the following message body:\r\n\r\nUNSUBSCRIBE QIP2017-DISCUSS FirstName LastName\r\n\r\n[\/panel]\r\n\r\n[\/accordion]"},{"id":1,"name":"Details","content":"QIP 2017 was hosted in Seattle Washington by the QuArC group at Microsoft Research in Redmond and the University of Washington.\r\n\r\n[accordion]\r\n<h2>Program Schedules<\/h2>\r\n[panel header=\"Main program schedule and videos\"]\r\n<blockquote><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/event\/qip-2017\/#!schedule\">QIP 2017 schedule with details and videos<\/a><\/blockquote>\r\n<blockquote><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/11\/QIP-2017-schedule-web-v2.pdf\">QIP 2017 schedule at a glance<\/a><\/blockquote>\r\n<blockquote><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/11\/QIP-schedule-detail-v2.pdf\">QIP 2017 detailed schedule<\/a><\/blockquote>\r\n[\/panel]\r\n\r\n[panel header=\"Tutorial schedule\"]\r\n<blockquote><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/11\/QIP-2017-tutorials-web.pdf\">QIP 2017 tutorials schedule<\/a><\/blockquote>\r\n[\/panel]\r\n\r\n[panel header=\"Software demos and schedule\"]\r\n<strong>Rigetti Computing<\/strong> - Monday, January 16, 8:00pm-9:30pm\r\n<blockquote>Title: <strong>A Practical Quantum Programming Workshop<\/strong><\/blockquote>\r\n<blockquote>Abstract: Recent progress on quantum computing hardware, especially in superconducting qubit systems, highlights the need for practical programming models and tools for these first devices. In particular, many near-term applications are quantum\/classical hybrid algorithms, that treat the quantum computer as a co-processor. In this workshop, we present an open source quantum programming toolkit targeting near-term applications and devices. This toolkit includes an intermediate quantum instruction language (Quil) and Python libraries for generating and executing Quil code in either a simulated environment or on a quantum processor. This workshop will be interactive, so bring your laptops and Python 2.7 installations!<\/blockquote>\r\n<strong>Microsoft LIQUi|&gt;<\/strong> - Tuesday, January 17, 8:00pm-9:30pm\r\n<blockquote>Title: <strong>Language Integrated Quantum Operations (LIQUi|&gt;) - A User's Tutorial<\/strong><\/blockquote>\r\n<blockquote>Abstract: LIQUi|&gt; provides a modular software architecture for the simulation of quantum algorithms. It provides a high-level interface and is independent of a specific quantum architecture. In the past year, we\u2019ve released LIQUi|&gt; to the public for academic use. It is a free package that runs on Windows, Linux and OSX as a provided library and executable with built-in examples and sample scripts as well as a development environment (using Visual Studio or mono, also freely available) that allows the user to compile their own quantum algorithms into an executable. The package includes a 100-page user\u2019s manual as well as over 700 pages of API documentation. This tutorial will focus on:\r\n<ul>\r\n \t<li>Obtaining and installing the package from <a href=\"http:\/\/stationq.github.io\/Liquid\/\">http:\/\/stationq.github.io\/Liquid\/<\/a><\/li>\r\n \t<li>Obtaining and installing Visual Studio and mono as development environments (best for attendees to do this beforehand, following instructions on the above website, see \u201cGetting Started\u201d)<\/li>\r\n \t<li>Getting the system running using built in examples (e.g., Shor)<\/li>\r\n \t<li>How to draw circuits (e.g., Teleport)<\/li>\r\n \t<li>Editing, compiling and running your own circuit (step-by-step)<\/li>\r\n \t<li>Use of scripting (e.g., controlling and creating Quantum Chemistry tests)<\/li>\r\n \t<li>Overview of documentation (User\u2019s Manual, API docs, Videos, GitHub community)<\/li>\r\n<\/ul>\r\nTo follow along during the tutorial, please download the software from <a href=\"http:\/\/stationq.github.io\/Liquid\/\">http:\/\/stationq.github.io\/Liquid\/<\/a> in advance.<\/blockquote>\r\n[\/panel]\r\n\r\n[panel header=\"Poster sessions\"]\r\n<blockquote><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/11\/QIP-2017-Posters-Day-1-Monday-January-16.pdf\">QIP 2017 | Day 1 | Monday, January 16<\/a><\/blockquote>\r\n<blockquote><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/11\/QIP-2017-Posters-Day-2-Tuesday-January-17.pdf\">QIP 2017 | Day 2 | Tuesday, January 17<\/a><\/blockquote>\r\n[\/panel]\r\n<h2>Program Details<\/h2>\r\n[panel header=\"Invited talks\"]\r\n<a href=\"http:\/\/chemists.princeton.edu\/chan\/\"><strong>Garnet Chan<\/strong><\/a> \u2013 Simulating quantum systems on classical computers\r\n<blockquote>Tuesday, January 17, 9:00AM \u2013 10:00AM<\/blockquote>\r\n<blockquote>Abstract: I will describe the landscape of classical simulations of the quantum mechanics of materials, chemistry, and biology and the role that quantum information theory has played. I will showcase the current state-of-the-art and highlight challenges, with some speculation as to where quantum computing may be important.<\/blockquote>\r\n<a href=\"http:\/\/bit.ly\/2e69kDo\"><strong>Chaoyang Lu<\/strong><\/a> \u2013 Racing classical computers with quantum boson-sampling machines\r\n<blockquote>Tuesday, January 17, 3:50PM \u2013 4:50PM<\/blockquote>\r\n<blockquote>Abstract: In this talk, I will report two routes towards experimental BosonSampling with many photons. We developed SPDC two-photon source with simultaneously a collection efficiency of ~70% and an indistinguishability of ~91% between independent photons. With this, we demonstrate genuine and distillable entanglement of ten photons under different pump power [1]. Such a platform will provide enabling technologies for teleportation of multiple properties of photons [2] and efficient scattershot BosonSampling. Self-assembled InGaAs QDs are in principle deterministic single-quantum emitters with near-unity quantum efficiency and fast decay rate. Using a QD coupled to a micropillar, we produced single photons with high purity, near-unity indistinguishability [3], and high extraction efficiency, all combined in a single device compatibly and simultaneously [4]. Long streams of &gt;1000 single photons separated by tens of microseconds maintain a &gt;92% indistinguishability, which are shown to be near transform limit [5]. The single photons are used for 3-, 4-, and 5-bosonsampling experiments, more than 24,000 times faster than all previous experiments, and more than 10 times faster than through calculating the matrices permanents using the first electronic computer (ENIAC) and transistorized computer (TRADIC) in the human history [6]. Our architecture is feasible to be scaled up to a larger number of photons and with higher rate to race against increasingly advanced classical computers in the near term.\r\n<ul>References:\r\n \t<li>[1] X.-L. Wang et al. Experimental ten-photon entanglement, Phys. Rev. Lett. 117, 210502 (2016).<\/li>\r\n \t<li>[2] X.-L. Wang et al. Quantum teleportation of multiple degrees of freedom of a single photon, Nature 518, 516 (2015).<\/li>\r\n \t<li>[3] Y.-M. He et al. On-demand semiconductor single-photon source with near-unity indistinguishability Nature Nanotechnology 8, 213 (2013).<\/li>\r\n \t<li>[4] X. Ding et al. On-demand single photons with high extraction efficiency and near-unity indistinguishability from a resonantly driven quantum dot in a micropillar, Phys. Rev. Lett. 116, 020401 (2016).<\/li>\r\n \t<li>[5] H. Wang et al. Near transform-limited single photons from an efficient solid-state quantum emitter, Phys. Rev. Lett. 116, 213601 (2016).<\/li>\r\n \t<li>[6] H. Wang et al. Multi-photon boson-sampling machines beating early classical computers, arXiv:1612.06956<\/li>\r\n<\/ul>\r\n<\/blockquote>\r\n<a href=\"https:\/\/homes.cs.washington.edu\/~jrl\/\"><strong>James Lee<\/strong><\/a> \u2013 Spectrahedral lifts and quantum learning\r\n<blockquote>Thursday, January 19, 9:00AM \u2013 10:00AM<\/blockquote>\r\n<blockquote>Abstract: Semidefinite programming (SDP) is one of the most powerful general purpose methods in combinatorial optimization, and understanding its strengths and limitations is a central focus of research in mathematical optimization. In joint work with Raghavendra and Steurer, we showed recently that polytopes associated to NP-hard problems (like Max-Cut and the Traveling Salesman Problem) do not admit SDP characterizations of subexponential size. Previously, it was unclear how to achieve such strong lower bounds for any explicit family of polytopes. A key insight involves associating a large quantum-classical state to an SDP and then learning a \u201csimple\u201d approximation to that state via a boosting process guided by the von Neumann entropy. The idea of viewing certain kinds of classical objects as points in a relaxed quantum landscape has other potential applications in the theory of computation.<\/blockquote>\r\n<blockquote>Resources: Following are some blog entries about entropy optimization, lifts of polytopes, and related things.<\/blockquote>\r\n<blockquote>Arxiv pointer to the main reference: <a href=\"https:\/\/arxiv.org\/abs\/1411.6317\">https:\/\/arxiv.org\/abs\/1411.6317<\/a>\r\n<ul>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/06\/16\/entropy-optimality-matrix-scaling\/\">Matrix scaling<\/a><\/li>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/06\/17\/entropy-optimality-changs-lemma\/\">Chang\u2019s Lemma<\/a><\/li>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/06\/17\/entropy-optimality-a-potential-function\/\">A potential function<\/a><\/li>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/06\/18\/entropy-optimality-blooms-changs-lemma\/\">Bloom\u2019s Chang\u2019s Lemma<\/a><\/li>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/06\/19\/entropy-optimality-forsters-isotropy\/\">Forster\u2019s isotropy<\/a><\/li>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/06\/20\/primer-lifts-of-polytopes-and-non-negative-matrix-factorization\/\">Primer: Lifts of polytopes<\/a><\/li>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/06\/21\/entropy-optimality-lifts-of-polytopes\/\">Lifts of polytopes<\/a><\/li>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/06\/23\/entropy-optimality-non-negative-rank-lower-bounds\/\">Non-negative rank<\/a><\/li>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/06\/29\/entropy-optimality-quantum-lifts-of-polytopes\/\">Quantum lifts<\/a><\/li>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/07\/04\/entropy-optimality-analytic-psd-rank-and-johns-theorem\/\">Analytic PSD rank<\/a><\/li>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/09\/18\/lecture-notes-for-the-summer-school-on-combinatorial-optimization-at-him\/\">HIM Lecture notes<\/a><\/li>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/11\/16\/entropy-optimality-on-path-space\/\">Optimality on path spaces<\/a><\/li>\r\n \t<li><a href=\"https:\/\/tcsmath.org\/2015\/11\/21\/follmers-drift-itos-lemma-and-the-log-sobolev-inequality\/\">Follmer drift and log-Sobolev<\/a><\/li>\r\n<\/ul>\r\n<\/blockquote>\r\n[\/panel]\r\n[panel header=\"Tutorial lectures\"]\r\n<a href=\"http:\/\/www.physics.usyd.edu.au\/~sflammia\/\"><strong>Steve Flammia<\/strong><\/a> - Debugging the next generation of quantum devices\r\n<blockquote>Saturday, January 14, 9:30AM \u2013 12:00PM<\/blockquote>\r\n<blockquote>Abstract: Recent years have witnessed tremendous progress in laboratory experiments for quantum computing. As the complexity of these experiments increases, however, so too does the difficultly in verifying the quality of the experiment by some objective measure, and in characterizing any undesired noise processes therein so as to improve the next generation devices. In particular, in the absence of a full-fledged quantum computer, we are left with the question: how can we tell if our quantum computer is really working? In this tutorial I will present an overview of the core methods that experimentalists use to address these tasks. The two main tools can be broadly classified as being either tomography or randomized benchmarking, and I will discuss the strengths and weaknesses of these methods. I will describe the theoretical challenges that remain both for mathematical analysis of these ideas as well as for practical data analysis from real experiments.<\/blockquote>\r\n<strong>Lidia Del Rio<\/strong> - Quantum Thermodynamics\r\n<blockquote>Saturday, January 14, 2:00PM \u2013 4:30PM<\/blockquote>\r\n<blockquote>Abstract: How much heat is dissipated in a quantum computer? Just how small can thermal engines be? When can we model a device\u2019s environment as a heat bath? As technology miniaturizes, we find that traditional thermodynamics is inadequate to study heat and work at the nanoscale, due for example to finite-size effects, emergence of quantum effects, subjectivity of information, and relevance of single-shot results. To tackle these challenges, a new theory of quantum thermodynamics is emerging, drawing insights from quantum information theory. In this tutorial, we will see how tools developed to study entanglement and quantum communication can be applied to thermodynamics. First, we will explore the relationship between information and thermodynamics, from Maxwell\u2019s demon to the work cost of quantum computations. I will then motivate and lay out the resource-theoretic approach to thermodynamics, which allows us to derive the thermodynamic laws from first principles. Finally, I will give a brief overview of the state of the art and promising directions in the field. The tutorial will be accessible to any quantum mechanic with a background in CS, mathematics, or physics.<\/blockquote>\r\n<blockquote>[1] J. Goold, M. Huber, A. Riera, LdR &amp; P. Skrzypczyk, The role of quantum information in thermodynamics \u2013 a topical review, arXiv:1505.07835<\/blockquote>\r\n<a href=\"http:\/\/munich-quantum-center.de\/index.php?id=106\"><strong>Norbert Schuch<\/strong><\/a> - Matrix Product States and Tensor Networks\r\n<blockquote>Sunday, January 15, 9:30AM \u2013 12:00PM<\/blockquote>\r\n<blockquote>Abstract: Interacting systems of many quantum particles exhibit rich physics due to their underlying entanglement, and are a topic of major interest in several areas of physics. In recent years, quantum information ideas have allowed us to understand the entanglement structure of such systems, and to come up with novel ways to describe and study them. In my lecture, I will first explain how we can describe such systems based on their entanglement structure, giving rise to so-called Tensor Network States. I will then discuss how these concepts can be used to model strongly interacting many-body systems and to study the different exotic topological states of matter based on their entanglement, and I will briefly highlight their suitability for numerical simulations. Finally, I will discuss open mathematical and physical challenges in the field.<\/blockquote>\r\n<a href=\"http:\/\/iqim.caltech.edu\/profile\/john-preskill\/\"><strong>John Preskill<\/strong><\/a> - Quantum Information and Spacetime\r\n<blockquote>Sunday, January 15, 2:00PM \u2013 4:30PM<\/blockquote>\r\n<blockquote>Abstract: I will review how tools from quantum information theory are providing a fresh perspective on some of the deepest problems in particle physics and gravitation. The first lecture will be a brisk overview of the current status of fundamental physics, followed by a discussion of entanglement in quantum field theory and of the properties of quantum black holes. The second lecture will be an introduction to AdS\/CFT duality in quantum gravity, emphasizing the emergence of spacetime from entanglement and the role of quantum error correction. I know it sounds scary, but I\u2019m a physicist, so it will be perfectly safe.<\/blockquote>\r\n<blockquote>Select References:<\/blockquote>\r\n<blockquote>\r\n<ul>\r\n \t<li>Mark Van Raamsdonk, Lectures on gravity and entanglement, <a href=\"https:\/\/arxiv.org\/abs\/1609.00026\">https:\/\/arxiv.org\/abs\/1609.00026<\/a><\/li>\r\n \t<li>Daniel Harlow, Jerusalem lectures on black holes and quantum information, <a href=\"https:\/\/arxiv.org\/abs\/1409.1231\">https:\/\/arxiv.org\/abs\/1409.1231<\/a><\/li>\r\n \t<li>Scott Aaronson, The complexity of quantum states and transformations: from quantum money to black holes (Lectures 6 and 7), <a href=\"https:\/\/arxiv.org\/abs\/1607.05256\">https:\/\/arxiv.org\/abs\/1607.05256<\/a><\/li>\r\n \t<li>Fernando Pastawski et al., Holographic quantum error-correcting codes, <a href=\"https:\/\/arxiv.org\/abs\/1503.06237\">https:\/\/arxiv.org\/abs\/1503.06237<\/a><\/li>\r\n<\/ul>\r\n<\/blockquote>\r\n[\/panel]\r\n[panel header=\"Accepted talks\"]\r\n<div id=\"wrapper\">\r\n<div id=\"main\" class=\"clearfix \">\r\n<div class=\"fusion-row\">\r\n<div id=\"content\">\r\n<div id=\"post-21481\" class=\"post-21481 page type-page status-publish hentry\">\r\n<div class=\"post-content\">\r\n<div class=\"fusion-fullwidth fullwidth-box fusion-fullwidth-1 fusion-parallax-none nonhundred-percent-fullwidth\">\r\n<div class=\"fusion-row\">\r\n<div class=\"fusion-one-half fusion-layout-column fusion-column-last fusion-spacing-yes\">\r\n<div class=\"fusion-column-wrapper\">\r\n<div class=\"accordian fusion-accordian\">\r\n<div id=\"accordion-21481-2\" class=\"panel-group\">\r\n<div class=\"fusion-panel panel-default\">\r\n<div id=\"c83b5d8308c0b6583\" class=\"panel-collapse collapse in\">\r\n<div class=\"panel-body toggle-content\">\r\n\r\n<strong>Plenary talks<\/strong>\r\n<blockquote>\r\n<ul>\r\n \t<li><strong>From quantum thermodynamical identities to a second law equality<\/strong>\u2014Alvaro Alhambra, <a href=\"http:\/\/www.damtp.cam.ac.uk\/user\/jono\/\" target=\"_blank\" rel=\"noopener\">Jonathan Oppenheim<\/a>, Chris Perry, and Lluis Masanes<\/li>\r\n \t<li><strong>The entanglement of distillation for gauge theories<\/strong>\u2014Karel Van Acoleyen, Volkher Scholz, Michael Marien, Nick Bultinck, Jutho Haegemen, and Frank Verstraete<\/li>\r\n \t<li><strong>Exponential separation between quantum communication complexity and classical information complexity<\/strong>\u2014Anurag Anshu, Dave Touchette, Penghui Yao, and Nengkun Yu<\/li>\r\n \t<li><strong>Tsirelson\u2019s problem and an embedding theorem for groups arising from non-local games<\/strong>\u2014William Slofstra<\/li>\r\n \t<li><strong>Entropy Accumulation in Device-Independent Protocols<\/strong>\u2014Rotem Arnon-Friedman, Fr\u00e9d\u00e9ric Dupuis, Omar Fawzi, Renato Renner, and <a href=\"http:\/\/cms.caltech.edu\/~vidick\/\" target=\"_blank\" rel=\"noopener\">Thomas Vidick<\/a><\/li>\r\n \t<li><strong>Quantum homomorphic encryption for polynomial-sized circuits (Best Student Paper)<\/strong>\u2014Yfke Dulek, <a href=\"http:\/\/www.cwi.nl\/~schaffne\" target=\"_blank\" rel=\"noopener\">Christian Schaffner<\/a>, and Florian Speelman<\/li>\r\n<\/ul>\r\n<\/blockquote>\r\n<strong>Accepted talks<\/strong>\r\n<blockquote>\r\n<ul>\r\n \t<li><strong>Gaussian optimizers in quantum information<\/strong>\u2014Giacomo De Palma, Dario Trevisan, and Vittorio Giovannetti<\/li>\r\n \t<li><strong>Multivariate Trace Inequalities<\/strong>\u2014<a href=\"https:\/\/sites.google.com\/site\/suttedav\/\" target=\"_blank\" rel=\"noopener\">David Sutter<\/a>, <a href=\"http:\/\/marioberta.info\/\" target=\"_blank\" rel=\"noopener\">Mario Berta<\/a>, and <a href=\"http:\/\/marcotom.info\/\" target=\"_blank\" rel=\"noopener\">Marco Tomamichel<\/a><\/li>\r\n \t<li><strong>Private states, quantum data hiding and the swapping of perfect secrecy<\/strong>\u2014Roberto Ferrara, and Matthias Christandl<\/li>\r\n \t<li><strong>A Complete Characterization of Unitary Quantum Space<\/strong>\u2014Bill Fefferman and Cedric Yen-Yu Lin<\/li>\r\n \t<li><strong>Unifying gate-synthesis and magic state distillation<\/strong>\u2014Earl Campbell and Mark Howard<\/li>\r\n \t<li><strong>Optimal compression for identically prepared qubit states<\/strong>\u2014Yuxiang Yang, Giulio Chiribella, and Masahito Hayashi<\/li>\r\n \t<li><strong>A parallel repetition theorem for all entangled games<\/strong>\u2014<a href=\"http:\/\/www.henryyuen.net\/\" target=\"_blank\" rel=\"noopener\">Henry Yuen<\/a><\/li>\r\n \t<li><strong>Finite correlation length implies efficient preparation of quantum thermal states<\/strong>\u2014Michael Kastoryano and Fernando Brandao<\/li>\r\n \t<li><strong>Universal quantum Hamiltonians<\/strong>\u2014<a href=\"http:\/\/www.dr-qubit.org\/\" target=\"_blank\" rel=\"noopener\">Toby Cubitt<\/a>, <a href=\"http:\/\/www.cs.bris.ac.uk\/~montanar\" target=\"_blank\" rel=\"noopener\">Ashley Montanaro<\/a>, and Stephen Piddock<\/li>\r\n \t<li><strong>Quantum Recommendation Systems<\/strong>\u2014Iordanis Kerenidis and Anupam Prakash<\/li>\r\n \t<li><strong>A Resource Theory for Work and Heat<\/strong>\u2014Carlo Sparaciari, Jonathan Oppenheim, and Tobias Fritz<\/li>\r\n \t<li><strong>Fault-Tolerant Error Correction for non-Abelian Anyons<\/strong>\u2014Guillaume Dauphinais and David Poulin<\/li>\r\n \t<li><strong>Quantum Speed-ups for Semidefinite Programming<\/strong>\u2014Fernando Brandao and Krysta Svore<\/li>\r\n \t<li><strong>Geometric inequalities and contractivity of bosonic semigroups<\/strong>\u2014Nilanjana Datta, Stefan Huber, Robert K\u00f6nig, Yan Pautrat, Cambyse Rouz\u00e9, and Anna Vershynina<\/li>\r\n \t<li><strong>Robust Self-Testing of Many Qubit States<\/strong>\u2014Anand Natarajan and <a href=\"http:\/\/cms.caltech.edu\/~vidick\/\" target=\"_blank\" rel=\"noopener\">Thomas Vidick<\/a><\/li>\r\n \t<li><strong>Rigorous RG algorithms and area laws for low energy eigenstates in 1D<\/strong>\u2014Itai Arad, Zeph Landau, Umesh Vazirani, and <a href=\"http:\/\/cms.caltech.edu\/~vidick\/\" target=\"_blank\" rel=\"noopener\">Thomas Vidick<\/a><\/li>\r\n \t<li><strong>Semidefinite programming strong converse bounds for quantum channel capacities<\/strong>\u2014<a href=\"https:\/\/xinwang.online\/\" target=\"_blank\" rel=\"noopener\">Xin Wang<\/a>, Wei Xie and <a href=\"http:\/\/www.quantum-lab.org\/runyao\/\" target=\"_blank\" rel=\"noopener\">Runyao Duan<\/a><\/li>\r\n \t<li><strong>Time-correlated noise in quantum computation<\/strong>\u2014Hector Bombin<\/li>\r\n \t<li><strong>Threshold Theorem for Quantum Supremacy<\/strong>\u2014Keisuke Fujii<\/li>\r\n \t<li><strong>Sequential measurements, disturbance and property testing<\/strong>\u2014Aram Harrow, Cedric Lin, and <a href=\"http:\/\/www.cs.bris.ac.uk\/~montanar\" target=\"_blank\" rel=\"noopener\">Ashley Montanaro<\/a><\/li>\r\n \t<li><strong>Belief propagation decoding of quantum channels by passing quantum messages<\/strong>\u2014<a href=\"http:\/\/www.phys.ethz.ch\/~renes\" target=\"_blank\" rel=\"noopener\">Joseph M. Renes<\/a><\/li>\r\n \t<li><strong>Biunitary constructions in quantum information<\/strong>\u2014<a href=\"http:\/\/www.cs.ox.ac.uk\/people\/david.reutter\" target=\"_blank\" rel=\"noopener\">David Reutter<\/a> and <a href=\"http:\/\/www.cs.ox.ac.uk\/people\/jamie.vicary\" target=\"_blank\" rel=\"noopener\">Jamie Vicary<\/a><\/li>\r\n \t<li><strong>Energy as a detector of nonlocality of many-body spin systems<\/strong>\u2014Jordi Tura Brugu\u00e9s, Gemma de Las Cuevas, Remigiusz Augusiak, Maciej Lewenstein, Antonio Ac\u00edn, and Ignacio Cirac<\/li>\r\n \t<li><strong>Application of a resource theory for magic states to fault-tolerant quantum computing<\/strong>\u2014Mark Howard and Earl Campbell<\/li>\r\n \t<li><strong>Optimal Quantum Sample Complexity of Learning Algorithms<\/strong>\u2014Srinivasan Arunachalam and <a href=\"http:\/\/homepages.cwi.nl\/~rdewolf\/\" target=\"_blank\" rel=\"noopener\">Ronald de Wolf<\/a><\/li>\r\n \t<li><strong>Operator scaling and applications<\/strong>\u2014<a href=\"http:\/\/www.cs.princeton.edu\/~garg\/\" target=\"_blank\" rel=\"noopener\">Ankit Garg<\/a>, <a href=\"https:\/\/www.ccny.cuny.edu\/profiles\/leonid-gurvits\" target=\"_blank\" rel=\"noopener\">Leonid Gurvits<\/a>, <a href=\"https:\/\/www.cs.princeton.edu\/~rmo\/\" target=\"_blank\" rel=\"noopener\">Rafael Oliveira<\/a>, and <a href=\"https:\/\/www.math.ias.edu\/avi\/home\" target=\"_blank\" rel=\"noopener\">Avi Wigderson<\/a><\/li>\r\n \t<li><strong>Information-Theoretic Tools for Interactive Quantum Protocols, and Applications: Flow of Information, Augmented Index, and DYCK(2)<\/strong>\u2014Mathieu Lauriere, Ashwin Nayak, and Dave Touchette<\/li>\r\n \t<li><strong>Sculpting Quantum Speedups<\/strong>\u2014Scott Aaronson and Shalev Ben-David<\/li>\r\n \t<li><strong>Complexity of quantum impurity problems<\/strong>\u2014Sergey Bravyi and David Gosset<\/li>\r\n \t<li><strong>Zero-knowledge proof systems for QMA<\/strong>\u2014Anne Broadbent, Zhengfeng Ji, Fang Song, and John Watrous<\/li>\r\n \t<li><strong>Separations in communication complexity using cheat sheets and information complexity<\/strong>\u2014Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Goos, Rahul Jain, <a href=\"http:\/\/www.robinkothari.com\/\" target=\"_blank\" rel=\"noopener\">Robin Kothari<\/a>, Troy Lee, and <a href=\"http:\/\/www.lri.fr\/~santha\" target=\"_blank\" rel=\"noopener\">Miklos Santha<\/a><\/li>\r\n \t<li><strong>Applications of recoverability in quantum information<\/strong>\u2014Alvaro Alhambra, Mario Berta, <a href=\"http:\/\/www.math.cm.is.nagoya-u.ac.jp\/~buscemi\/\" target=\"_blank\" rel=\"noopener\">Francesco Buscemi<\/a>, Siddhartha Das, Marius Lemm, Seth Lloyd, Iman Marvian, <a href=\"http:\/\/www.markwilde.com\/\" target=\"_blank\" rel=\"noopener\">Mark Wilde<\/a>, Stephanie Wehner, and <a href=\"http:\/\/www0.cs.ucl.ac.uk\/people\/M.Woods.html\" target=\"_blank\" rel=\"noopener\">Mischa Woods<\/a><\/li>\r\n \t<li><strong>Capacity Estimates for TRO Channels<\/strong>\u2014Li Gao, Marius Junge, and Nicholas Laracuente<\/li>\r\n \t<li><strong>Optimal Hamiltonian Simulation by Quantum Signal Processing<\/strong>\u2014Guang Hao Low and Isaac Chuang<\/li>\r\n \t<li><strong>Improved classical simulation of quantum circuits dominated by Clifford gates<\/strong>\u2014Sergey Bravyi and David Gosset<\/li>\r\n \t<li><strong>Symmetry protected topological order at nonzero temperature<\/strong>\u2014Sam Roberts, Beni Yoshida, Aleksander Kubica, and Stephen Bartlett<\/li>\r\n \t<li><strong>Limitations of semidefinite programs for separable states and entangled games<\/strong>\u2014Aram Harrow, Anand Natarajan, and <a href=\"https:\/\/ix.cs.uoregon.edu\/~xiaodiwu\/\" target=\"_blank\" rel=\"noopener\">Xiaodi Wu<\/a><\/li>\r\n \t<li><strong>A polynomial time quantum algorithm for computing class groups and solving the principal ideal problem in arbitrary degree number fields<\/strong>\u2014Jean-Francois Biasse and Fang Song<\/li>\r\n \t<li><strong>Asymptotic entanglement manipulation under PPT operations: new SDP bounds and irreversibility<\/strong>\u2014<a href=\"https:\/\/xinwang.online\/\" target=\"_blank\" rel=\"noopener\">Xin Wang<\/a> and <a href=\"http:\/\/www.quantum-lab.org\/runyao\/\" target=\"_blank\" rel=\"noopener\">Runyao Duan<\/a><\/li>\r\n \t<li><strong>Compression of Quantum Multi-Prover Interactive Proofs<\/strong>\u2014Zhengfeng Ji<\/li>\r\n \t<li><strong>The Thermality of Quantum Approximate Markov Chains, with implications to the Locality of Edge States and Entanglement Spectrum<\/strong>\u2014Kohtaro Kato and Fernando Brandao<\/li>\r\n \t<li><strong>Characterizing Quantum Supremacy in Near-Term Devices<\/strong>\u2014Sergio Boixo, Sergei Isakov, Vadim Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael Bremner, John Martinis, and Hartmut Neven<\/li>\r\n \t<li><strong>Anyons and Matrix Product Operator Algebras<\/strong>\u2014Nick Bultinck, Michael Marien, Dominic Williamson, Mehmet Burak Sahinoglu, Jutho Haegeman, and Frank Verstraete<\/li>\r\n \t<li><strong>Round Complexity in the Local Transformations of Quantum and Classical State<\/strong>\u2014<a href=\"http:\/\/www.physics.siu.edu\/~echitamb\" target=\"_blank\" rel=\"noopener\">Eric Chitambar<\/a> and Min-Hsiu Hsieh<\/li>\r\n \t<li><strong>On preparing ground states of gapped Hamiltonians: An efficient Quantum Lov\u00e1sz Local Lemma<\/strong>\u2014Andras Gilyen and Or Sattath<\/li>\r\n \t<li><strong>General Randomness Amplification with Non-signaling Security<\/strong>\u2014<a href=\"http:\/\/www.iis.sinica.edu.tw\/~kmchung\/\" target=\"_blank\" rel=\"noopener\">Kai-Min Chung<\/a>, <a href=\"https:\/\/web.eecs.umich.edu\/~shiyy\/\" target=\"_blank\" rel=\"noopener\">Yaoyun Shi<\/a>, and <a href=\"https:\/\/ix.cs.uoregon.edu\/~xiaodiwu\/\" target=\"_blank\" rel=\"noopener\">Xiaodi Wu<\/a><\/li>\r\n \t<li><strong>SU(p,q) coherent states and Gaussian de Finetti theorems<\/strong>\u2014<a href=\"https:\/\/sites.google.com\/site\/anthonyleverrier\/\" target=\"_blank\" rel=\"noopener\">Anthony Leverrier<\/a><\/li>\r\n \t<li><strong>Catalytic Decoupling<\/strong>\u2014Christian Majenz, Mario Berta, <a href=\"http:\/\/www.fi.muni.cz\/~dupontd\/\" target=\"_blank\" rel=\"noopener\">Fr\u00e9d\u00e9ric Dupuis<\/a>, <a href=\"http:\/\/www.itp.phys.ethz.ch\/people\/renner\/\" target=\"_blank\" rel=\"noopener\">Renato Renner<\/a>, and Matthias Christandl <em>merged with <\/em><strong> Deconstruction and conditional erasure of quantum correlations<\/strong>\u2014Mario Berta, Fernando Brandao, Christian Majenz, and <a href=\"http:\/\/www.markwilde.com\/\" target=\"_blank\" rel=\"noopener\">Mark Wilde<\/a><\/li>\r\n \t<li><strong>Converse bounds for private communication over quantum channels<\/strong>\u2014<a href=\"http:\/\/www.markwilde.com\/\" target=\"_blank\" rel=\"noopener\">Mark Wilde<\/a>, Marco Tomamichel, and Mario Berta <em> merged with <\/em><strong> Two-way assisted capacities for quantum and private communication<\/strong>\u2014<a href=\"https:\/\/www-users.cs.york.ac.uk\/pirs\/\" target=\"_blank\" rel=\"noopener\">Stefano Pirandola<\/a>, Riccardo Laurenza, Carlo Ottaviani, and Leonardo Banchi<\/li>\r\n \t<li><strong>Overlapping qubits<\/strong>\u2014<a href=\"http:\/\/ee.usc.edu\/\" target=\"_blank\" rel=\"noopener\">Rui Chao<\/a>, <a href=\"http:\/\/www-bcf.usc.edu\/~breichar\/\" target=\"_blank\" rel=\"noopener\">Ben Reichardt<\/a>, Chris Sutherland and <a href=\"http:\/\/cms.caltech.edu\/~vidick\/\" target=\"_blank\" rel=\"noopener\">Thomas Vidick<\/a>\r\n<em> merged with\r\n<\/em><strong> Parallel self-testing of (tilted) EPR pairs via copies of (tilted) CHSH<\/strong>\u2014<a href=\"https:\/\/directory.caltech.edu\/personnel\/acoladan\" target=\"_blank\" rel=\"noopener\">Andrea W. Coladangelo<\/a> <em>and<\/em><strong> The Parallel-Repeated Magic Square Game is Rigid<\/strong>\u2014<a href=\"http:\/\/www.mit.edu\/~mcoudron\/\" target=\"_blank\" rel=\"noopener\">Matthew Coudron<\/a> and Anand Natarajan<\/li>\r\n \t<li><strong>Simulated Quantum Annealing Can Be Exponentially Faster than Classical Simulated Annealing<\/strong>\u2014Elizabeth Crosson and Aram Harrow\r\n<em>merged with\r\n<\/em><strong> Adiabatic Optimization Versus Diffusion Monte Carlo<\/strong> \u2014Michael Jarret, <a href=\"https:\/\/www.nist.gov\/people\/jordan-stephen-p\" target=\"_blank\" rel=\"noopener\">Stephen Jordan<\/a>, and Brad Lackey<\/li>\r\n \t<li><strong>Efficient quantum walk on the grid with multiple marked elements<\/strong>\u2014<a href=\"http:\/\/www.cpsc.ucalgary.ca\/~hoyer\" target=\"_blank\" rel=\"noopener\">Peter H\u00f8yer<\/a> and Mojtaba Komeili <i>merged with <\/i><strong>Controlled quantum ampli\ufb01cation<\/strong>\u2014C\u0103t\u0103lin Dohotaru and <a href=\"http:\/\/www.cpsc.ucalgary.ca\/~hoyer\" target=\"_blank\" rel=\"noopener\">Peter H\u00f8yer<\/a><\/li>\r\n<\/ul>\r\n<\/blockquote>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n[\/panel]\r\n[panel header=\"Accepted posters\"]\r\n<div id=\"wrapper\">\r\n<div id=\"main\" class=\"clearfix \">\r\n<div class=\"fusion-row\">\r\n<div id=\"content\">\r\n<div id=\"post-21481\" class=\"post-21481 page type-page status-publish hentry\">\r\n<div class=\"post-content\">\r\n<div class=\"fusion-fullwidth fullwidth-box fusion-fullwidth-1 fusion-parallax-none nonhundred-percent-fullwidth\">\r\n<div class=\"fusion-row\">\r\n<div class=\"fusion-one-half fusion-layout-column fusion-column-last fusion-spacing-yes\">\r\n<div class=\"fusion-column-wrapper\">\r\n<div class=\"accordian fusion-accordian\">\r\n<div id=\"accordion-21481-2\" class=\"panel-group\">\r\n<div class=\"fusion-panel panel-default\">\r\n<div id=\"82fca032050cd861c\" class=\"panel-collapse collapse in\">\r\n<div class=\"panel-body toggle-content\">\r\n<blockquote>\r\n<ul>\r\n \t<li><strong>Diagonal gates in the Clifford hierarchy<\/strong>\u2014Shawn Cui, Daniel Gottesman, and Anirudh Krishna<\/li>\r\n \t<li><strong>Neural-Network Quantum States: Do Machines Dream of Schroedinger\u2019s Cat?\u2014<\/strong>Giuseppe Carleo and Matthias Troyer<\/li>\r\n \t<li><strong>Analytic and nearly optimal self-testing bounds for the Clauser-Horne-Shimony-Holt and Mermin inequalities\u2014<\/strong>Jedrzej Kaniewski<\/li>\r\n \t<li><strong>Geometric approach to entanglement quantification with polynomial measures<\/strong>\u2014<a href=\"http:\/\/bartoszregula.github.io\/\" target=\"_blank\" rel=\"noopener\">Bartosz Regula<\/a> and <a href=\"http:\/\/quantumcorrelations.weebly.com\/\" target=\"_blank\" rel=\"noopener\">Gerardo Adesso<\/a><\/li>\r\n \t<li><strong>Informational content of compressed sensing measurements in quantum tomography<\/strong>\u2014Amir Kalev, Charles Baldwin, Robert Kosut, and Ivan Deutsch<\/li>\r\n \t<li><strong>Continuous-variable quantum network coding using coherent states<\/strong>\u2014Ke Li, Tao Shang, Gang Du, and Jianwei Liu<\/li>\r\n \t<li><strong>Fundamental limitation on quantum broadcast networks<\/strong>\u2014Stefan Baeuml and <a href=\"http:\/\/www.brl.ntt.co.jp\/people\/azuma\/\" target=\"_blank\" rel=\"noopener\">Koji Azuma<\/a><\/li>\r\n \t<li><strong>Entangled Cloning of Stabilizer Codes and Free Fermions<\/strong>\u2014Timothy Hsieh<\/li>\r\n \t<li><strong>Topological Order and Memory Time in Marginally Self-Correcting Quantum Memory<\/strong>\u2014Karthik Siva and Beni Yoshida<\/li>\r\n \t<li><strong>Approximating local observables on projected entangled pair states<\/strong>\u2014<a href=\"https:\/\/martinschwarz.wordpress.com\/\" target=\"_blank\" rel=\"noopener\">Martin Schwarz<\/a>, <a href=\"http:\/\/www.physik.fu-berlin.de\/en\/einrichtungen\/ag\/ag-eisert\/\" target=\"_blank\" rel=\"noopener\">Oliver Buerschaper<\/a>, and <a href=\"http:\/\/www.physik.fu-berlin.de\/en\/einrichtungen\/ag\/ag-eisert\/\" target=\"_blank\" rel=\"noopener\">Jens Eisert<\/a><\/li>\r\n \t<li><strong>Time and Space Efficient Quantum Algorithms for Detecting Cycles and Testing Bipartiteness\u2014<\/strong>Christopher Cade, <a href=\"http:\/\/www.cs.bris.ac.uk\/~montanar\" target=\"_blank\" rel=\"noopener\">Ashley Montanaro<\/a>, and Aleksandrs Belovs<\/li>\r\n \t<li><strong>Privacy Amplification Against Active Quantum Adversaries<\/strong>\u2014Gil Cohen and <a href=\"http:\/\/cms.caltech.edu\/~vidick\/\" target=\"_blank\" rel=\"noopener\">Thomas Vidick<\/a><\/li>\r\n \t<li><strong>Entanglement of approximate quantum strategies in XOR games<\/strong>\u2014Dimiter Ostrev and <a href=\"http:\/\/cms.caltech.edu\/~vidick\/\" target=\"_blank\" rel=\"noopener\">Thomas Vidick<\/a><\/li>\r\n \t<li><strong>More Randomness from a Prepare-and-Measure Scenario with Independent Devices\u2014<\/strong>Yun-Guang Han, Zhen-Qiang Yin, Hong-Wei Li, Wei Chen, Shuang Wang, Guang-Can Guo, and Zheng-Fu Han<\/li>\r\n \t<li><strong>Quantum Secret Broadcast for Wireless Quantum Networks<\/strong>\u2014Gang Du, Tao Shang, Ke Li, and Jianwei Liu<\/li>\r\n \t<li><strong>The weakness of CTC qubits and the power of approximate counting<\/strong>\u2014<a href=\"http:\/\/www.cs.cmu.edu\/\" target=\"_blank\" rel=\"noopener\">Ryan O\u2019Donnell<\/a> and <a href=\"http:\/\/www.cmpe.boun.edu.tr\/~say\/\" target=\"_blank\" rel=\"noopener\">A.C. Cem Say<\/a><\/li>\r\n \t<li><strong>Multipartite Entanglement in Stabilizer Tensor Networks<\/strong>\u2014Sepehr Nezami and <a href=\"https:\/\/web.stanford.edu\/~waltemic\/\" target=\"_blank\" rel=\"noopener\">Michael Walter<\/a><\/li>\r\n \t<li><strong>Orientation Statistics and Quantum Information<\/strong>\u2014Kevin Schultz<\/li>\r\n \t<li><strong>Should entanglement measures be monogamous or faithful?\u2014<\/strong><a href=\"http:\/\/math.univ-lyon1.fr\/~lancien\/\" target=\"_blank\" rel=\"noopener\">C\u00e9cilia Lancien<\/a>, <a href=\"http:\/\/cnqo.phys.strath.ac.uk\/people\/academic-staff\/marco-piani\/\" target=\"_blank\" rel=\"noopener\">Marco Piani<\/a>, <a href=\"https:\/\/sites.google.com\/site\/derwinter\/\" target=\"_blank\" rel=\"noopener\">Andreas Winter<\/a>, Sara Di Martino, Gerardo Adesso, and Marcus Huber<\/li>\r\n \t<li><strong>Pointer Quantum PCPs and Multi-Prover Games<\/strong>\u2014Alex Bredariol Grilo, Iordanis Kerenidis, and Attila Pereszlenyi<\/li>\r\n \t<li><strong>Conditional Mutual Information of Bipartite Unitaries and Scrambling<\/strong>\u2014Dawei Ding, Michael Walter and Patrick Hayden<\/li>\r\n \t<li><strong>Optimal quantum networks and one-shot entropies<\/strong>\u2014Daniel Ebler and Giulio Chiribella<\/li>\r\n \t<li><strong>A Four-Round LOCC Protocol Outperforms All Two-Round Protocols in Reducing the Entanglement Cost for A Distributed Quantum Information Processing<\/strong>\u2014Eyuri Wakakuwa, Akihito Soeda, and Mio Murao<\/li>\r\n \t<li><strong>Size-Driven Quantum Phase Transitions<\/strong>\u2014Johannes Bausch, <a href=\"http:\/\/www.dr-qubit.org\/\" target=\"_blank\" rel=\"noopener\">Toby Cubitt<\/a>, Angelo Lucia, David Perez-Garcia, and Michael M. Wolf<\/li>\r\n \t<li><strong>Clean quantum and classical communication protocols<\/strong>\u2014Harry Buhrman, Matthias Christandl, Chris Perry, and Jeroen Zuiddam<\/li>\r\n \t<li><strong>A sufficient set of gates for thermodynamics<\/strong>\u2014Chris Perry, Piotr Cwiklinski, Janet Anders, Michal Horodecki, and Jonathan Oppenheim<\/li>\r\n \t<li><strong>Irreconcilable Difference Between Quantum Walks and Adiabatic Quantum Computing<\/strong>\u2014<a href=\"http:\/\/thomaswong.net\/\" target=\"_blank\" rel=\"noopener\">Thomas Wong<\/a> and <a href=\"http:\/\/math.ucsd.edu\/~dmeyer\/\" target=\"_blank\" rel=\"noopener\">David Meyer<\/a><\/li>\r\n \t<li><strong>The complexity of estimating local physical quantities<\/strong>\u2014<a href=\"http:\/\/www.people.vcu.edu\/~sgharibian\/\" target=\"_blank\" rel=\"noopener\">Sevag Gharibian<\/a> and Justin Yirka<\/li>\r\n \t<li><strong>Quantum processes which do not use coherence<\/strong>\u2014Benjamin Yadin, Jiajun Ma, Davide Girolami, Mile Gu, and Vlatko Vedral<\/li>\r\n \t<li><strong>Degradable states and one-way entanglement distillation<\/strong>\u2014<a href=\"http:\/\/www.statslab.cam.ac.uk\/~fl327\/\" target=\"_blank\" rel=\"noopener\">Felix Leditzky<\/a>, <a href=\"http:\/\/www.statslab.cam.ac.uk\/~nila\/\" target=\"_blank\" rel=\"noopener\">Nilanjana Datta<\/a>, and <a href=\"https:\/\/sites.google.com\/site\/gsbsmith\/\" target=\"_blank\" rel=\"noopener\">Graeme Smith<\/a><\/li>\r\n \t<li><strong>A theory of resource destruction<\/strong>\u2014Zi-Wen Liu, Xueyuan Hu, and Seth Lloyd<\/li>\r\n \t<li><strong>Relative Entropy Bounds on Quantum, Private and Repeater Capacities<\/strong>\u2014Alexander M\u00fcller-Hermes and Matthias Christandl<\/li>\r\n \t<li><strong>No energy transport without discord<\/strong>\u2014Seth Lloyd, Vazrik Chiloyan, Yongjie Hu, Samuel Huberman, Zi-Wen Liu, and Gang Chen<\/li>\r\n \t<li><strong>Sufficiency of quantum channels and equality in the data processing inequality for the sandwiched R\u00e9nyi divergence<\/strong>\u2014<a href=\"http:\/\/www.mat.savba.sk\/~jencova\/\" target=\"_blank\" rel=\"noopener\">Anna Jen\u010dov\u00e1<\/a>, <a href=\"http:\/\/www.statslab.cam.ac.uk\/~fl327\/\" target=\"_blank\" rel=\"noopener\">Felix Leditzky<\/a>, <a href=\"https:\/\/www.maths.cam.ac.uk\/cambyse-rouze\" target=\"_blank\" rel=\"noopener\">Cambyse Rouz\u00e9<\/a>, and <a href=\"http:\/\/www.statslab.cam.ac.uk\/~nila\/\" target=\"_blank\" rel=\"noopener\">Nilanjana Datta<\/a><\/li>\r\n \t<li><strong>Hamiltonian Simulation with Optimal Sample Complexity<\/strong>\u2014<a href=\"http:\/\/umiacs.umd.edu\/~shelbyk\" target=\"_blank\" rel=\"noopener\">Shelby Kimmel<\/a>, Cedric Yen-Yu Lin, Guang Hao Low, Maris Ozols, and Theodore Yoder<\/li>\r\n \t<li><strong>The additive classical capacity of quantum channels assisted by noisy entanglement<\/strong>\u2014Quntao Zhuang, Yechao Zhu, and Peter Shor<\/li>\r\n \t<li><strong>Local Decoders in the 4D Toric Code<\/strong>\u2014Nikolas Breuckmann, Barbara Terhal, Kasper Duivenvoorden, and Dominik Michels<\/li>\r\n \t<li><strong>Tripartite-to-Bipartite Entanglement Transformation by SLOCC and the Classification of Matrix Spaces<\/strong>\u2014Yinan Li, Youming Qiao, <a href=\"https:\/\/xinwang.online\/\" target=\"_blank\" rel=\"noopener\">Xin Wang<\/a>, and <a href=\"http:\/\/www.quantum-lab.org\/runyao\/\" target=\"_blank\" rel=\"noopener\">Runyao Duan<\/a><\/li>\r\n \t<li><strong>Monogamy relation in no-disturbance theories<\/strong>\u2014Zhih-Ahn Jia, Yuchun Wu, and Guang-Can Guo<\/li>\r\n \t<li><strong>Quantum homomorphic signature with repeatable verification<\/strong>\u2014Tao Shang, Zhuang Pei, Ke Li, and Jianwei Liu<\/li>\r\n \t<li><strong>Theory of the quantum internet<\/strong>\u2014<a href=\"http:\/\/www.brl.ntt.co.jp\/people\/azuma\/\" target=\"_blank\" rel=\"noopener\">Koji Azuma<\/a>, Akihiro Mizutani, <a href=\"http:\/\/www.comm.utoronto.ca\/~hklo\/\" target=\"_blank\" rel=\"noopener\">Hoi-Kwong Lo<\/a>, and Go Kato<\/li>\r\n \t<li><strong>Chaos in quantum channels<\/strong>\u2014Pavan Hosur, Xiao-Liang Qi, Dan Roberts, and Beni Yoshida<\/li>\r\n \t<li><strong>Efficient implementation of Quantum circuits with limited qubit interactions<\/strong>\u2014Steve Brierley<\/li>\r\n \t<li><strong>Decomposition of Quantum Markov Chains and Zero-error Capacity<\/strong>\u2014Ji Guan, Yuan Feng, and Mingsheng Ying<\/li>\r\n \t<li><strong>No fixed point guarantee of Nash equilibrium in quantum games<\/strong>\u2014<a href=\"http:\/\/www.kustar.ac.ae\/pages\/dr-faisal-shah-khan\" target=\"_blank\" rel=\"noopener\">Faisal Shah Khan<\/a> and <a href=\"http:\/\/web.ornl.gov\/~hqt\/\" target=\"_blank\" rel=\"noopener\">Travis Humble<\/a><\/li>\r\n \t<li><strong>Simple, near-optimal quantum protocols for die-rolling<\/strong>\u2014<a href=\"https:\/\/sites.google.com\/site\/jamiesikora\/\" target=\"_blank\" rel=\"noopener\">Jamie Sikora<\/a><\/li>\r\n \t<li><strong>Device-independent tests of time-like correlations<\/strong>\u2014Michele Dall\u2019Arno, Sarah Brandsen, Francesco Buscemi, and Vlatko Vedral<\/li>\r\n \t<li><strong>Achieving quantum supremacy with sparse and noisy commuting quantum computations<\/strong>\u2014<a href=\"http:\/\/mickbremner.org\/\" target=\"_blank\" rel=\"noopener\">Michael Bremner<\/a>, <a href=\"http:\/\/www.cs.bris.ac.uk\/~montanar\" target=\"_blank\" rel=\"noopener\">Ashley Montanaro<\/a>, and Dan Shepherd<\/li>\r\n \t<li><strong>No-Hypersignaling as a Physical Principle<\/strong>\u2014Michele Dall\u2019Arno, Sarah Brandsen, Alessandro Tosini, Francesco Buscemi, and <a href=\"http:\/\/www.vlatkovedral.org\/\" target=\"_blank\" rel=\"noopener\">Vlatko Vedral<\/a><\/li>\r\n \t<li><strong>Robust Bell inequalities from communication complexity<\/strong>\u2014Sophie Laplante, Mathieu Lauri\u00e8re, Alexandre Nolin, J\u00e9r\u00e9mie Roland, and Gabriel Senno<\/li>\r\n \t<li><strong>Optimal Circuit-Level Decoding for Surface Codes<\/strong>\u2014Bettina Heim, Krysta M. Svore, and Matthew B. Hastings<\/li>\r\n \t<li><strong>Modernizing Quantum Annealing<\/strong>\u2014Nicholas Chancellor<\/li>\r\n \t<li><strong>Constructing Mutually Unbiased Bases from Quantum Latin Squares<\/strong>\u2014<a href=\"https:\/\/www.cs.ox.ac.uk\/people\/benjamin.musto\/\" target=\"_blank\" rel=\"noopener\">Benjamin Musto<\/a><\/li>\r\n \t<li><strong>Fundamental energy cost for quantum measurement<\/strong>\u2014<a href=\"https:\/\/www.itp.uni-hannover.de\/Gruppen\/quinfo\/dreeb\/\" target=\"_blank\" rel=\"noopener\">David Reeb<\/a>, <a href=\"https:\/\/www.itp.uni-hannover.de\/Gruppen\/quinfo\/de\/members.html\" target=\"_blank\" rel=\"noopener\">Kais Abdelkhalek<\/a>, and <a href=\"http:\/\/grupsderecerca.uab.cat\/giq\/people\" target=\"_blank\" rel=\"noopener\">Yoshifumi Nakata<\/a><\/li>\r\n \t<li><strong>Span Programs, Formula Evaluation, and Graph Connectivity<\/strong>\u2014<a href=\"http:\/\/www.its.caltech.edu\/~sjeffery\/\" target=\"_blank\" rel=\"noopener\">Stacey Jeffery<\/a> and <a href=\"http:\/\/umiacs.umd.edu\/~shelbyk\" target=\"_blank\" rel=\"noopener\">Shelby Kimmel<\/a><\/li>\r\n \t<li><strong>Explaining quantum correlations through evolution of causal models<\/strong>\u2014Robin Harper, Robert Chapman, Chris Ferrie, <a href=\"http:\/\/www.cgranade.com\/\" target=\"_blank\" rel=\"noopener\">Christopher Granade<\/a>, Richard Kueng, Daniel Naoumenko, Steven Flammia, and Alberto Peruzzo<\/li>\r\n \t<li><strong>Monotonicity of quantum relative entropies under positive maps and their sufficiency<\/strong>\u2014<a href=\"https:\/\/www.itp.uni-hannover.de\/Gruppen\/quinfo\/dreeb\/\" target=\"_blank\" rel=\"noopener\">David Reeb<\/a> and <a href=\"http:\/\/qmath.ku.dk\/staff\/\" target=\"_blank\" rel=\"noopener\">Alexander M\u00fcller-Hermes<\/a><\/li>\r\n \t<li><strong>Fully general device-independence for two-party cryptography and position verification<\/strong>\u2014J\u00e9r\u00e9my Ribeiro, Gl\u00e1ucia Murta, and Stephanie Wehner<\/li>\r\n \t<li><strong>Constructing orthonormal bases to distinguish all pure states in finite dimensional<\/strong>\u2014Yu Wang and Yun Shang<\/li>\r\n \t<li><strong>Pretty good measures in quantum information theory<\/strong>\u2014Raban Iten, <a href=\"http:\/\/www.phys.ethz.ch\/~renes\" target=\"_blank\" rel=\"noopener\">Joseph M. Renes<\/a>, and <a href=\"https:\/\/sites.google.com\/site\/suttedav\/\" target=\"_blank\" rel=\"noopener\">David Sutter<\/a><\/li>\r\n \t<li><strong>Schur complement inequalities for covariance matrices and monogamy of quantum correlations<\/strong>\u2014Ludovico Lami, Christoph Hirche, Gerardo Adesso, and Andreas Winter<\/li>\r\n \t<li><strong>Efficient simulation of sparse Markovian quantum dynamics<\/strong>\u2014<a href=\"http:\/\/www.cs.umd.edu\/~amchilds\/\" target=\"_blank\" rel=\"noopener\">Andrew Childs<\/a> and <a href=\"http:\/\/quics.umd.edu\/people\/tongyang-li\" target=\"_blank\" rel=\"noopener\">Tongyang Li<\/a><\/li>\r\n \t<li><strong>Computing quopit Clifford circuit amplitudes via sum-over-paths<\/strong>\u2014Dax Koh, Mark Penney and Robert Spekkens<\/li>\r\n \t<li><strong>Limits on the storage of quantum information in a volume of space<\/strong>\u2014Steven Flammia, Jeongwan Haah, Michael Kastoryano, and Isaac Kim<\/li>\r\n \t<li><strong>On SZK and PostBQP<\/strong>\u2014<a href=\"http:\/\/people.csail.mit.edu\/adam\" target=\"_blank\" rel=\"noopener\">Adam Bouland<\/a>, Lijie Chen, Dhiraj Holden, Justin Thaler, and Prashant Nalini Vasudevan<\/li>\r\n \t<li><strong>Markovian Marginals<\/strong>\u2014Isaac Kim<\/li>\r\n \t<li><strong>Further extensions of Clifford circuits and their classical simulation complexities<\/strong>\u2014Dax Koh<\/li>\r\n \t<li><strong>Quantum Circuits for Quantum Channels<\/strong>\u2014Raban Iten, Roger Colbeck, and Matthias Christandl<\/li>\r\n \t<li><strong>Quantum Tokens for Digital Signatures<\/strong>\u2014Shalev Ben-David and Or Sattath<\/li>\r\n \t<li><strong>Shortcuts to quantum network routing<\/strong>\u2014Eddie Schoute, Laura Mancinska, Tanvirul Islam, Iordanis Kerenidis, and Stephanie Wehner<\/li>\r\n \t<li><strong>Asymmetric de Finetti Theorem for Infinite-dimensional Quantum Systems<\/strong>\u2014Murphy Yuezhen Niu<\/li>\r\n \t<li><strong>Universal Refocusing and an Inverse-Free Solovay-Kitaev Theorem<\/strong>\u2014Imdad Sardharwalla, <a href=\"http:\/\/www.dr-qubit.org\/\" target=\"_blank\" rel=\"noopener\">Toby Cubitt<\/a>, <a href=\"http:\/\/www.mit.edu\/~aram\/\">Aram Harrow<\/a>, and <a href=\"https:\/\/people.maths.bris.ac.uk\/~manl\/\" target=\"_blank\" rel=\"noopener\">Noah Linden<\/a><\/li>\r\n \t<li><strong>Efficient unitary designs with nearly time-independent Hamiltonian dynamics<\/strong>\u2014Yoshifumi Nakata, Christoph Hirche, Masato Koashi, and Andreas Winter<\/li>\r\n \t<li><strong>Test for a large amount of entanglement, using few measurements<\/strong>\u2014<a href=\"http:\/\/ee.usc.edu\/\" target=\"_blank\" rel=\"noopener\">Rui Chao<\/a>, <a href=\"http:\/\/www-bcf.usc.edu\/~breichar\/\" target=\"_blank\" rel=\"noopener\">Ben Reichardt<\/a>, Chris Sutherland, and <a href=\"http:\/\/cms.caltech.edu\/~vidick\/\" target=\"_blank\" rel=\"noopener\">Thomas Vidick<\/a><\/li>\r\n \t<li><strong>Simulating positive-operator-valued measures with projective measurements<\/strong>\u2014Michal Oszmaniec, Leonardo Guerini, Peter Wittek, and Antonio Acin<\/li>\r\n \t<li><strong>Recent progress in integrated development environments for hybrid classical-quantum computing workflows<\/strong>\u2014Kathleen Hamilton, Travis Humble, Keith Britt, Alexander McCaskey, Jonathan Schrock, and Neena Imam<\/li>\r\n \t<li><strong>Information Topologies on Non-Commutative State Spaces<\/strong>\u2014<a href=\"http:\/\/www.stephan-weis.info\/\" target=\"_blank\" rel=\"noopener\">Stephan Weis<\/a><\/li>\r\n \t<li><strong>Determining the computational power of symmetry protected topological phases<\/strong>\u2014David Stephen, <a href=\"http:\/\/www.iqst.ca\/people\/peoplepage.php?id=314\" target=\"_blank\" rel=\"noopener\">Dongsheng Wang<\/a>, Abhishodh Prakash, Tzu-Chieh Wei, and Robert Raussendorf<\/li>\r\n \t<li><strong>Discrimination power of a quantum detector<\/strong>\u2014Christoph Hirche, Masahito Hayashi, Emilio Bagan, and John Calsamiglia<\/li>\r\n \t<li><strong>Compatibility in Multiparameter Quantum Metrology<\/strong>\u2014Sammy Ragy, Rafa\u0142 Demkowicz-Dobrza\u0144ski, and Marcin Jarzyna<\/li>\r\n \t<li><strong>RANDOM QUANTUM CORRELATIONS ARE GENERICALLY NON-CLASSICAL<\/strong>\u2014Carlos Gonzalez-Guillen, C\u00e9cilia Lancien, Carlos Palazuelos, and Ignacio Villanueva<\/li>\r\n<\/ul>\r\n<\/blockquote>\r\n<blockquote>\r\n<ul>\r\n \t<li><strong>A wave function approach to gradient density estimation using the higher dimensional stationary phase approximation<\/strong>\u2014Karthik Gurumoorthy, Anand Rangarajan, and John Corring<\/li>\r\n \t<li><strong>A Neural Decoder for Topological Codes<\/strong>\u2014Giacomo Torlai and Roger Melko<\/li>\r\n \t<li><strong>Fixed-Point Adiabatic Quantum Search<\/strong>\u2014Alexander Dalzell, Theodore Yoder, and Isaac Chuang<\/li>\r\n \t<li><strong>The Complexity of Translationally-Invariant Low-Dimensional Spin Lattices in 3D<\/strong>\u2014Johannes Bausch and Stephen Piddock<\/li>\r\n \t<li><strong>Two Topos Interpretations for Measurement Based Quantum Computations<\/strong>\u2014Raouf Dridi and Leon Loveridge<\/li>\r\n \t<li><strong>Product states can be hard to distinguish locally<\/strong>\u2014Sarah Croke and Stephen Barnett<\/li>\r\n \t<li><strong>The Computational Complexity of Ball Permutations<\/strong>\u2014<a href=\"http:\/\/www.scottaaronson.com\/\" target=\"_blank\" rel=\"noopener\">Scott Aaronson<\/a>, <a href=\"http:\/\/people.csail.mit.edu\/adam\/\" target=\"_blank\" rel=\"noopener\">Adam Bouland<\/a>, <a href=\"https:\/\/www.math.ucdavis.edu\/~greg\/\" target=\"_blank\" rel=\"noopener\">Greg Kuperberg<\/a>, and Saeed Mehraban<\/li>\r\n \t<li><strong>Fast State Transfer and Entanglement Renormalization Using Long-Range Interactions<\/strong>\u2014Zachary Eldredge, Zhe-Xuan Gong, Ali Hamed Mosavian, Michael Foss-Feig, and Alexey Gorshkov<\/li>\r\n \t<li><strong>Increasing the quantum UNSAT penalty of the circuit-to-Hamiltonian construction<\/strong>\u2014Johannes Bausch and Elizabeth Crosson<\/li>\r\n \t<li><strong>Relativistic (or 2-prover 1-round) zero-knowledge protocol for NP secure against quantum adversaries<\/strong>\u2014Andr\u00e9 Chailloux and <a href=\"https:\/\/sites.google.com\/site\/anthonyleverrier\/\" target=\"_blank\" rel=\"noopener\">Anthony Leverrier<\/a><\/li>\r\n \t<li><strong>Autonomous quantum machines and finite sized clocks<\/strong>\u2014Mischa Woods, Ralph Silva, and Jonathan Oppenheim<\/li>\r\n \t<li><strong>Tensor-network simulations of the surface code under realistic noise<\/strong>\u2014Andrew Darmawan and David Poulin<\/li>\r\n \t<li><strong>Certified randomness is both local and global<\/strong>\u2014<a href=\"http:\/\/www.umiacs.umd.edu\/~camiller\" target=\"_blank\" rel=\"noopener\">Carl Miller<\/a> and <a href=\"http:\/\/web.eecs.umich.edu\/~shiyy\/\" target=\"_blank\" rel=\"noopener\">Yaoyun Shi<\/a><\/li>\r\n \t<li><strong>Hardness of traversing the ground space of commuting Hamiltonians<\/strong>\u2014<a href=\"http:\/\/www.davidgosset.com\/\" target=\"_blank\" rel=\"noopener\">David Gosset<\/a>, Jenish C. Mehta, and <a href=\"http:\/\/cms.caltech.edu\/~vidick\/\" target=\"_blank\" rel=\"noopener\">Thomas Vidick<\/a><\/li>\r\n \t<li><strong>Quantum hashing is secure against classical leakage<\/strong>\u2014Cupjin Huang and <a href=\"https:\/\/web.eecs.umich.edu\/~shiyy\/\" target=\"_blank\" rel=\"noopener\">Yaoyun Shi<\/a><\/li>\r\n \t<li><strong>Bounding the costs of quantum simulation of many-body physics in real space<\/strong>\u2014Ian Kivlichan, Nathan Wiebe, Ryan Babbush, and Al\u00e1n Aspuru-Guzik<\/li>\r\n \t<li><strong>The coherent relative entropy: a new parent entropy measure<\/strong>\u2014Philippe Faist and Renato Renner<\/li>\r\n \t<li><strong>Device-independent characterizations of the quantum state in a Bell experiment<\/strong>\u2014Zhaohui Wei and Jamie Sikora<\/li>\r\n \t<li><strong>Hamiltonian Realizations of New Topological Phases of Matter in Three Spatial Dimensions<\/strong>\u2014Dominic Williamson and Zhenghan Wang<\/li>\r\n \t<li><strong>Equivalence between contextuality and negativity of the Wigner function for qudits<\/strong>\u2014Nicolas Delfosse, Cihan Okay, Juan Bermejo-Vega, Dan Browne, and Robert Raussendorf<\/li>\r\n \t<li><strong>A linear-time benchmarking tool for generalized surface codes<\/strong>\u2014Nicolas Delfosse, Pavithran Iyer, and David Poulin<\/li>\r\n \t<li><strong>Measurement-based linear optics<\/strong>\u2014Rafael Alexander, Natasha Gabay, Peter Rohde, and Nicolas Menicucci<\/li>\r\n \t<li><strong>Generalized surface codes and packing of logical qubits<\/strong>\u2014Nicolas Delfosse, Pavithran Iyer, and David Poulin<\/li>\r\n \t<li><strong>Chaos and complexity by design<\/strong>\u2014<a href=\"http:\/\/www.sns.ias.edu\/~roberts\/\" target=\"_blank\" rel=\"noopener\">Dan Roberts<\/a> and Beni Yoshida<\/li>\r\n \t<li><strong>Quantum Error Correction of Reference Frame Information<\/strong>\u2014Sepehr Nezami, Patrick Hayden, and Grant Salton<\/li>\r\n \t<li><strong>Do objective results typically appear in quantum measurements?<\/strong>\u2014Piotr Cwiklinski, Jaroslaw Korbicz, Edgar Aguilar, and Pawel Horodecki<\/li>\r\n \t<li><strong>Error regions in quantum state tomography: computational complexity caused by the geometry of quantum states<\/strong>\u2014Daniel Suess, \u0141ukasz Rudnicki, <a href=\"http:\/\/www.fisica.ufmg.br\/\" target=\"_blank\" rel=\"noopener\">Thiago O. Maciel<\/a>, and David Gross<\/li>\r\n \t<li><strong>High-Rate Fault-Tolerant Quantum Measurement and Nearly Good Sparse Quantum Codes<\/strong>\u2014<a href=\"http:\/\/www.cs.cornell.edu\/~jshi\/\" target=\"_blank\" rel=\"noopener\">Jonathan Shi<\/a><\/li>\r\n \t<li><strong>Quantum algorithm for multivariate polynomial interpolation<\/strong>\u2014<a href=\"http:\/\/jianxin.iqubit.org\/\" target=\"_blank\" rel=\"noopener\">Jianxin Chen<\/a>, Andrew Childs, and Shih-Han Hung<\/li>\r\n \t<li><strong>Efficient quantum algorithms for simulating Lindblad evolution<\/strong>\u2014Richard Cleve and Chunhao Wang<\/li>\r\n \t<li><strong>Refinement and Properties of the Sphere-Packing Bound for Classical-Quantum Channels<\/strong>\u2014Hao-Chung Cheng, Min-Hsiu Hsieh, and Marco Tomamichel<\/li>\r\n \t<li><strong>The Clifford group fails gracefully to be a unitary 4-design (with applications to state distinguishability, entropic uncertainties, and phase retrieval)<\/strong>\u2014Huangjun Zhu, Richard Kueng, Markus Grassl, and <a href=\"http:\/\/www.thp.uni-koeln.de\/gross\/\" target=\"_blank\" rel=\"noopener\">David Gross<\/a><\/li>\r\n \t<li><strong>Extended Learning Graphs for Triangle Finding<\/strong>\u2014Titouan Carette, Mathieu Lauriere, and <a href=\"http:\/\/www.liafa.univ-paris-diderot.fr\/~magniez\" target=\"_blank\" rel=\"noopener\">Frederic Magniez<\/a><\/li>\r\n \t<li><strong>Linear Optical Proofs for the Hardness of Matrix Permanents<\/strong>\u2014Daniel Grier and Luke Schaeffer<\/li>\r\n \t<li><strong>Simulating large quantum circuits on a small quantum computer<\/strong>\u2014<a href=\"http:\/\/www.mit.edu\/~aram\/\" target=\"_blank\" rel=\"noopener\">Aram W. Harrow<\/a>, <a href=\"http:\/\/home.lu.lv\/~sd20008\/\" target=\"_blank\" rel=\"noopener\">Maris Ozols<\/a>, Tianyi Peng, and <a href=\"https:\/\/ix.cs.uoregon.edu\/~xiaodiwu\/\" target=\"_blank\" rel=\"noopener\">Xiaodi Wu<\/a><\/li>\r\n \t<li><strong>Computational Notions of Quantum Min-Entropy<\/strong>\u2014Yi-Hsiu Chen, Kai-Min Chung, <a href=\"https:\/\/sites.google.com\/site\/laichingyi0616\/\" target=\"_blank\" rel=\"noopener\">Ching-Yi Lai<\/a>, Salil Vadhan, and Xiaodi Wu<\/li>\r\n \t<li><strong>Sets of n-local correlations are semialgebraic<\/strong>\u2014<a href=\"http:\/\/quantum-ncku.weebly.com\/\" target=\"_blank\" rel=\"noopener\">Denis Rosset<\/a>, Nicolas Gisin, Yeong-Cherng Liang, Rui-Yang You, and Elie Wolfe<\/li>\r\n \t<li><strong>Coherent Parity Check Construction for Quantum Error Correction<\/strong>\u2014Dominic Horsman, Nicholas Chancellor, Stefan Zohren, and Aleks Kissinger<\/li>\r\n \t<li><strong>Quantum Graph Isomorphisms<\/strong>\u2014Albert Atserias, Laura Mancinska, David Roberson, Robert Samal, Simone Severini, and Antonios Varvitsiotis<\/li>\r\n \t<li><strong>Entanglement-assisted capacities of compound quantum channels<\/strong>\u2014Hrant Gharibyan, Mario Berta, and Michael Walter<\/li>\r\n \t<li><strong>Simulating classical waves in quantum logspace<\/strong>\u2014<a href=\"http:\/\/quics.umd.edu\/people\/stephen-jordan\" target=\"_blank\" rel=\"noopener\">Stephen Jordan<\/a> and <a href=\"http:\/\/portal.cbpf.br\/\" target=\"_blank\" rel=\"noopener\">Pedro Costa<\/a><\/li>\r\n \t<li><strong>Qudit quantum computation on matrix product states with global symmetry<\/strong>\u2014Dongsheng Wang, David Stephen, and Robert Raussendorf<\/li>\r\n \t<li><strong>Quantum key distribution for composite dimensional finite systems<\/strong>\u2014Mohamed Shalaby<\/li>\r\n \t<li><strong>Optimal distillation protocols for GHZ NLB<\/strong>\u2014Talha Lateef<\/li>\r\n \t<li><strong>Capacities for Classes of Quantum Multiple Access Channels and Hadamard Broadcast Channels<\/strong>\u2014Qingle Wang, Siddhartha Das, and <a href=\"http:\/\/www.markwilde.com\/\" target=\"_blank\" rel=\"noopener\">Mark Wilde<\/a><\/li>\r\n \t<li><strong>Practical quantum metrology in noisy environments<\/strong>\u2014Rosanna Nichols, Thomas Bromley, Luis Correa, and Gerardo Adesso<\/li>\r\n \t<li><strong>Thermalization and Return to Equilibrium on Finite Quantum Lattice Systems<\/strong>\u2014Terry Farrelly, Fernando Brandao, and Marcus Cramer<\/li>\r\n \t<li><strong>Quantum no-encoding theorems and probabilistic transforming of quantum states with multiple goals<\/strong>\u2014Mingxing Luo, Huiran Li, Hong Lai, and Xiaojun Wang<\/li>\r\n \t<li><strong>Approximate symmetries of Hamiltonians<\/strong>\u2014<a href=\"http:\/\/www.physics.usyd.edu.au\/~cchubb\/\" target=\"_blank\" rel=\"noopener\">Christopher Chubb<\/a> and Steven Flammia<\/li>\r\n \t<li><strong>Cooling-Assist adiabatic computation<\/strong>\u2014<a href=\"http:\/\/rogerluo.me\/\" target=\"_blank\" rel=\"noopener\">Roger Luo<\/a>, Chao Xu, Yongjian Han, and Chuanfeng Li<\/li>\r\n \t<li><strong>Conditional mutual information and quantum steering<\/strong>\u2014Eneet Kaur, Xiaoting Wang, and Mark M. Wilde<\/li>\r\n \t<li><strong>Classification of locally distinguishable and indistinguishable sets of generalized Bell states<\/strong>\u2014Guojing Tian<\/li>\r\n \t<li><strong>Measuring the absence of coherent state<\/strong>\u2014Sushamana Sharma and Rajshri Vyas<\/li>\r\n \t<li><strong>Quantum Walks via Quantum Cellular Automata<\/strong>\u2014<a href=\"http:\/\/portal.cbpf.br\/\" target=\"_blank\" rel=\"noopener\">Pedro Costa<\/a>, <a href=\"http:\/\/www.lncc.br\/estrutura\/default.php\" target=\"_blank\" rel=\"noopener\">Renato Portugal<\/a>, and <a href=\"http:\/\/portal.cbpf.br\/\" target=\"_blank\" rel=\"noopener\">Fernado de Melo<\/a><\/li>\r\n \t<li><strong>Operator Locality in Quantum Simulation of Fermionic Models<\/strong>\u2014Vojtech Havlicek, Matthias Troyer, and James Whitfield<\/li>\r\n \t<li><strong>Trace distance: A measure of quantumness<\/strong>\u2014Manju Bhatt, Natasha Awasthi, and Umesh Chandra Johri<\/li>\r\n \t<li><strong>Graph-Associated Entanglement Cost of Multipartite State in Exact and Finite-Block-Length Approximate Construction<\/strong>\u2014Hayata Yamasaki, Akihito Soeda, and Mio Murao<\/li>\r\n \t<li><strong>Asymptotic Convertibility of Entanglement: A General Approach to Entanglement Concentration and Dilution<\/strong>\u2014Yong Jiao, Eyuri Wakakuwa, and Tomohiro Ogawa<\/li>\r\n \t<li><strong>On the Effect of Coherence of Noise in Quantum Error Correction<\/strong>\u2014Yasunari Suzuki, Keisuke Fujii, and Masato Koashi<\/li>\r\n \t<li><strong>Robust Relativistic Bit Commitment<\/strong>\u2014Kaushik Chakraborty, Andr\u00e9 Chailloux, and Anthony Leverrier<\/li>\r\n \t<li><strong>Quantum Digital-to-Analog Converters<\/strong>\u2014Dave Chapman<\/li>\r\n \t<li><strong>Valley qubits in graphene for quantum computing and communications<\/strong>\u2014Yu-Shu Wu, Ning-Yuan Lue, Ming-Jay Yang, and Neil Na<\/li>\r\n \t<li><strong>Single-photon quantum non-locality: violation of CHSH inequality using feasible measurement setups<\/strong>\u2014Su-Yong Lee, Jiyong Park, Jaewan Kim, and Changsuk Noh<\/li>\r\n \t<li><strong>Effects of measurement dependence on generalized CHSH-Bell test in the single-run and multiple-run scenarios<\/strong>\u2014Dan-Dan Li, Yu-Qian Zhou, Fei Gao, Xin-Hui Li, and Qiao-Yan Wen<\/li>\r\n \t<li><strong>Quantum resource theory of non-stabilizer states in the one-shot regime<\/strong>\u2014Hoan Dang, Mehdi Ahmadi, Gilad Gour, and Barry Sanders<\/li>\r\n \t<li><strong>Correlations between non-commuting observables<\/strong>\u2014Marek Wajs, Dagomir Kaszlikowski, Pawel Kurzynski, and Junghee Ryu<\/li>\r\n \t<li><strong>Entanglement area law for long-range interacting systems<\/strong>\u2014Zhexuan Gong<\/li>\r\n \t<li><strong>Pseudo-Density Matrix Formulation of Quantum Field Theory<\/strong>\u2014Tian Zhang and Vlatko Vedral<\/li>\r\n \t<li><strong>Skew information conversion to and extraction from local quantum uncertainty<\/strong>\u2014Liang Qiu, Yu Guo, and Barry Sanders<\/li>\r\n \t<li><strong>An Optimal Discrimination of Two Mixed Qubit States with a Fixed Rate of Inconclusive Results<\/strong>\u2014Younghun Kwon, <a href=\"http:\/\/frontier.hanyang.ac.kr\/\" target=\"_blank\" rel=\"noopener\">Donghoon Ha<\/a>, and Jihwan Kim<\/li>\r\n \t<li><strong>QInfer: Statistical inference software for quantum applications<\/strong>\u2014<a href=\"http:\/\/www.cgranade.com\/\" target=\"_blank\" rel=\"noopener\">Christopher Granade<\/a>, Chris Ferrie, Ian Hincks, Steven Casagrande, Thomas Alexander, Jonathan Gross, Michal Kononeko, and Yuval Sanders<\/li>\r\n \t<li><strong>Optimization of Lattice Surgery is hard<\/strong>\u2014Daniel Herr, Franco Nori, and Simon Devitt<\/li>\r\n \t<li><strong>Randomized benchmarking in measurement-based quantum computing<\/strong>\u2014Rafael Alexander, Peter Turner, and Stephen Bartlett<\/li>\r\n \t<li><strong>Quantum input-output algorithm for quantum systems with limited controllability<\/strong>\u2014Ryosuke Sakai, Akihito Soeda, and Mio Murao<\/li>\r\n \t<li><strong>Topological One-Way Quantum Computation with the GKP Code States using Highly-Reliable Post-Selected Measurement<\/strong>\u2014Kosuke Fukui, Akihisa Tomita, and Atsushi Okamoto<\/li>\r\n \t<li><strong>More randomness certification for any entangled two-qubit states underdevice-independent<\/strong>\u2014<a href=\"http:\/\/sklnst.bupt.edu.cn\/\" target=\"_blank\" rel=\"noopener\">Yu-Kun Wang<\/a>, <a href=\"http:\/\/sklnst.bupt.edu.cn\/\" target=\"_blank\" rel=\"noopener\">Su-Juan Qin<\/a>, and <a href=\"http:\/\/sklnst.bupt.edu.cn\/\" target=\"_blank\" rel=\"noopener\">Fei Gao<\/a><\/li>\r\n \t<li><strong>Security Analysis of Stochastic Routing Scheme in Grid-Shaped Partially-Trusted Relay Quantum Key Distribution Network<\/strong>\u2014Xingtong Liu, Jian Wang, and Ruilin Li<\/li>\r\n \t<li><strong>Software-defined Quantum Network Switching<\/strong>\u2014Ronald Sadlier, Brian Williams, Travis Humble, and Venkateswara Dasari<\/li>\r\n \t<li><strong>Parameterized Query Complexity in Quantum Computation<\/strong>\u2014<a href=\"http:\/\/www.cs.uleth.ca\/~benkoczi\" target=\"_blank\" rel=\"noopener\">Robert Benkoczi<\/a>, <a href=\"http:\/\/scholar.ulethbridge.ca\/sauryadas\/home\" target=\"_blank\" rel=\"noopener\">Saurya Das<\/a>, <a href=\"http:\/\/www.cs.uleth.ca\/~gaur\" target=\"_blank\" rel=\"noopener\">Daya Gaur<\/a>, <a href=\"http:\/\/www.cs.uleth.ca\/~hossain\" target=\"_blank\" rel=\"noopener\">Shahadat Hossain<\/a>, and Parijat Purohit<\/li>\r\n \t<li><strong>Quantum algorithms for Gibbs sampling and hitting-time estimation\u2014<\/strong>Anirban Narayan Chowdhury, and Rolando Somma<\/li>\r\n \t<li><strong>Bipartite entanglement under symmetry<\/strong>\u2014<a href=\"http:\/\/people.ucalgary.ca\/~mwgirard\/\" target=\"_blank\" rel=\"noopener\">Mark Girard<\/a> and Gilad Gour<\/li>\r\n \t<li><strong>Detecting Topological Order with Ribbon Operators<\/strong>\u2014<a href=\"http:\/\/www.physics.usyd.edu.au\/~jbridge\" target=\"_blank\" rel=\"noopener\">Jacob C Bridgeman<\/a>, <a href=\"http:\/\/www.physics.usyd.edu.au\/~sflammia\" target=\"_blank\" rel=\"noopener\">Steven T Flammia<\/a>, and <a href=\"http:\/\/www.physique.usherbrooke.ca\/poulin\/\" target=\"_blank\" rel=\"noopener\">David Poulin<\/a><\/li>\r\n \t<li><strong>Efficient Fault-Tolerant Conversion between the Steane and Reed-Muller Quantum Codes<\/strong>\u2014Dongxiao Quan, Changxing Pei, and Barry C. Sanders<\/li>\r\n \t<li><strong>Discrepancies between Asymptotic and Exact Spectral Gap Analyses of Quantum Adiabatic Barrier Tunneling<\/strong>\u2014Lucas Brady and Wim Van Dam<\/li>\r\n \t<li><strong>Locality Preserving Logical Gates in Topological Stabiliser Codes<\/strong>\u2014Paul Webster and Stephen D. Bartlett<\/li>\r\n \t<li><strong>Properties of a [7,1,3] Non-CSS Stabilizer Code<\/strong>\u2014Muyuan Li, Mauricio Gutierrez, Kenneth Brown, and Andrew Cross<\/li>\r\n \t<li><strong>Lower bounds on the size of semi-quantum automata<\/strong>\u2014Lvzhou Li and Daowen Qiu<\/li>\r\n \t<li><strong>Tunable excitation spectrum in quantum double models<\/strong>\u2014Anna Komar and Olivier Landon-Cardinal<\/li>\r\n \t<li><strong>Optimal control for time-dependent quantum metrology<\/strong>\u2014Shengshi Pang and Andrew Jordan<\/li>\r\n \t<li><strong>The Non-coherence-generating Channels<\/strong>\u2014Xueyuan Hu<\/li>\r\n \t<li><strong>Minimal control power of the controlled dense coding<\/strong>\u2014Changhun Oh, Hoyong Kim, Kabgyun Jeong, and Hyunseok Jeong<\/li>\r\n \t<li><strong>Completely Positive Semidefinite Rank<\/strong>\u2014Anupam Prakash, Jamie Sikora, Antonios Varvitsiotis, and Zhaohui Wei<\/li>\r\n \t<li><strong>An Equivalence Between EPR-Steering and Bell Nonlocality for Two Qubits<\/strong>\u2014Parth Girdhar and Eric G. Cavalcanti<\/li>\r\n \t<li><strong>Capacity of a quantum memory channel correlated by matrix product states<\/strong>\u2014<a href=\"http:\/\/www.daiict.ac.in\/\" target=\"_blank\" rel=\"noopener\">Jaideep Mulherkar<\/a> and <a href=\"http:\/\/www.daiict.ac.in\/\" target=\"_blank\" rel=\"noopener\">V Sunitha<\/a><\/li>\r\n \t<li><strong>Quantum Laplacian Eigenmap<\/strong>\u2014Yiming Huang and Xiaoyu Li<\/li>\r\n \t<li><strong>Exact controllization of unitary operation with fractional queries<\/strong>\u2014Qingxiuxiong Dong, Shojun Nakayama, Akihito Soeda, and Mio Murao<\/li>\r\n \t<li><strong>Can one quantum bit separate any pair of words with zero-error?<\/strong>\u2014Aleksandrs Belovs, Juan Andres Montoya, and <a href=\"http:\/\/abuzer.yakaryilmaz.com\/\" target=\"_blank\" rel=\"noopener\">Abuzer Yakaryilmaz<\/a><\/li>\r\n \t<li><strong>Information Reconciliation for QKD in WDM-PON Access Networks<\/strong>\u2014Suhwang Jeong and Jeongseok Ha<\/li>\r\n \t<li><strong>Hamiltonian Computation<\/strong>\u2014<a href=\"http:\/\/nicholas-chancellor.me\/\" target=\"_blank\" rel=\"noopener\">Nicholas Chancellor<\/a>, James G. Morley, Sougato Bose, Andrew Daley, and <a href=\"http:\/\/kendon.info\/viv\/\" target=\"_blank\" rel=\"noopener\">Viv Kendon<\/a><\/li>\r\n \t<li><strong>Optimal discrimination of pure states in the single-qubit regime<\/strong>\u2014Graeme Weir, Stephen Barnett, and Sarah Croke<\/li>\r\n \t<li><strong>Lower bounds for quantum solvers for SDPs and LPs<\/strong>\u2014Joran van Apeldoorn, Andras Gilyen, Sander Gribling, and Ronald de Wolf<\/li>\r\n \t<li><strong>One-sided Measurement-Device-Independent Quantum Key Distribution<\/strong>\u2014Wen-Fei Cao, Yi-Zheng Zhen, Yu-Lin Zheng, Valerio Scarani, Li Li, Zeng-Bing Chen, Nai-Le Liu, Kai Chen and Jian-Wei Pan<\/li>\r\n \t<li><strong>Performance of QAOA on Typical Instances of Constraint Satisfaction Problems with Bounded Degree<\/strong>\u2014Yechao Zhu and Cedric Yen-Yu Lin<\/li>\r\n \t<li><strong>Transversal Clifford gates on folded surface codes<\/strong>\u2014Jonathan Moussa<\/li>\r\n \t<li><strong>Modeling the Surface 17 with Ion Traps<\/strong>\u2014Colin Trout, Muyuan Li, Mauricio Gutierrez, and Kenneth Brown<\/li>\r\n \t<li><strong>Hierarchy of Universal Entanglement in 2D Measurement-based Quantum Computation<\/strong>\u2014Jacob Miller and Akimasa Miyake<\/li>\r\n \t<li><strong>Resource reflecting functor and its application to non-uniformity<\/strong>\u2014Robin Cockett, Gilad Gour, Barry C. Sanders, and Priyaa Varshinee Srinivasan<\/li>\r\n \t<li><strong>Commutator bounds for product formulas<\/strong>\u2014<a href=\"http:\/\/www.cs.umd.edu\/~amchilds\" target=\"_blank\" rel=\"noopener\">Andrew Childs<\/a>, Dmitri Maslov, Neil Ross, and Yuan Su<\/li>\r\n \t<li><strong>Thresholds for universal concatenated quantum codes<\/strong>\u2014Christopher Chamberland, Tomas Jochym-O\u2019Connor, and Raymond Laflamme<\/li>\r\n \t<li><strong>Quantum-Entangled Interactions Under Unknown Circumstances<\/strong>\u2014Dmitry Kravchenko<\/li>\r\n \t<li><strong>Efficient Optimized Quantum Control for Adiabatic Quantum Computation<\/strong>\u2014Gregory Quiroz<\/li>\r\n \t<li><strong>Performance of Hyperbolic Surface Codes<\/strong>\u2014Nikolas Breuckmann, Anirudh Krishna, and Barbara Terhal<\/li>\r\n \t<li><strong>On the Hierarchy for k-Round Quantum Automata Communication Protocol<\/strong>\u2014<a href=\"https:\/\/scholar.google.ru\/citations?hl=ru&amp;user=Gz9f3-YAAAAJ\" target=\"_blank\" rel=\"noopener\">Kamil Khadiev<\/a> and Aliya Khadieva<\/li>\r\n \t<li><strong>Fast Mixing with Quantum Walks vs. Classical Processes<\/strong>\u2014Simon Apers, <a href=\"http:\/\/users.ugent.be\/~asarlet\/\" target=\"_blank\" rel=\"noopener\">Alain Sarlette<\/a>, and <a href=\"http:\/\/www.dei.unipd.it\/~ticozzi\" target=\"_blank\" rel=\"noopener\">Francesco Ticozzi<\/a><\/li>\r\n \t<li><strong>Unity-Efficiency Parametric Down-Conversion via Amplitude Amplification and its Application in GHZ State Preparation<\/strong>\u2014Murphy Yuezhen Niu, <a href=\"http:\/\/www.rle.mit.edu\/people\/directory\/jeffrey-shapiro\/\" target=\"_blank\" rel=\"noopener\">Jeffrey H. Shapiro<\/a>, <a href=\"http:\/\/www.iqst.ca\/people\/home\/bsanders\/\" target=\"_blank\" rel=\"noopener\">Barry Sanders<\/a>, and <a href=\"http:\/\/www.rle.mit.edu\/people\/directory\/ngai-chuen-wong\/\" target=\"_blank\" rel=\"noopener\">Franco Wong<\/a><\/li>\r\n \t<li><strong>Versatile lattice code surgery<\/strong>\u2014Christophe Vuillot and Barbara Terhal<\/li>\r\n \t<li><strong>Quantum Circuits Synthesis Using Lattices Over Number Fields<\/strong>\u2014Sebastian Schoennenbeck and Vadym Kliuchnikov<\/li>\r\n \t<li><strong>Thermal Operations under Partial Information \u2013 An operational derivation of Jaynes\u2019 Principle<\/strong>\u2014Paul Boes, Rodrigo Gallego, Henrik Wilming, and Jens Eisert<\/li>\r\n \t<li><strong>Improvements on Color-to-Surface Code Switching<\/strong>\u2014Ciaran Ryan-Anderson<\/li>\r\n \t<li><strong>Reducing runtimes in adiabatic quantum computation with Energy Landscape Manipulation (ELM)<\/strong>\u2014Richard Tanburn, Oliver Lunt, and Nike Dattani<\/li>\r\n \t<li><strong>Pancharatnam Phase Deficit can Detect Macroscopic Entanglement<\/strong>\u2014Namrata Shukla and <a href=\"http:\/\/www.hri.res.in\/~akpati\/\" target=\"_blank\" rel=\"noopener\">Arun K Pati<\/a><\/li>\r\n \t<li><strong>Universal computation by multiparticle quantum walk with improved error bounds<\/strong>\u2014Zak Webb<\/li>\r\n \t<li><strong>Spacetime Replication of Quantum Information Using (2,3) Quantum Secret Sharing and Teleportation<\/strong>\u2014Yadong Wu, Abdullah Khalid, Masoud Habibi, and Barry Sanders<\/li>\r\n \t<li><strong>Scaling of Interferometric Baselines of Telescopic Arrays with Quantum Repeater Generations<\/strong>\u2014Siddhartha Santra, Brian Kirby, Alejandra Maldonado-Trapp, and Michael Brodsky<\/li>\r\n \t<li><strong>Quantum Algorithm for Linear Differential Equations with Exponentially Improved Dependence on Precision<\/strong>\u2014Dominic Berry, Andrew Childs, Aaron Ostrander, and Guoming Wang<\/li>\r\n \t<li><strong>Discord assisted dense coding with arbitrary two-qubit X-states<\/strong>\u2014Alejandra Maldonado Trapp, Brian Kirby, Siddhartha Santra, Anzi Hu, Michael Brodsky, and Charles Clark<\/li>\r\n \t<li><strong>Divide and Conquer Approach for Quantum Hamiltonian Simulation<\/strong>\u2014<a href=\"http:\/\/www.cs.columbia.edu\/~stuartah\/\" target=\"_blank\" rel=\"noopener\">Stuart Hadfield<\/a> and <a href=\"http:\/\/www.cs.columbia.edu\/~ap\/\" target=\"_blank\" rel=\"noopener\">Anargyros Papageorgiou<\/a><\/li>\r\n \t<li><strong>Exact sampling hardness of Ising spin models<\/strong>\u2014Bill Fefferman, Alexey Gorshkov, and Michael Foss-Feig<\/li>\r\n \t<li><strong>Complexity of sampling as an order parameter<\/strong>\u2014Abhinav Deshpande, <a href=\"http:\/\/www.umiacs.umd.edu\/~wjf\/\" target=\"_blank\" rel=\"noopener\">Bill Fefferman<\/a>, Michael Foss-Feig, and <a href=\"http:\/\/groups.jqi.umd.edu\/gorshkov\/\" target=\"_blank\" rel=\"noopener\">Alexey Gorshkov<\/a><\/li>\r\n \t<li><strong>Some algorithmic applications of exceptional configurations in quantum walks<\/strong>\u2014Alexander Rivosh, Nikolajs Nahimovs, and Dmitry Kravchenko<\/li>\r\n \t<li><strong>The Landscape of Quantum Artificial Intelligence Research<\/strong>\u2014<a href=\"http:\/\/www.umbc.edu\/~shehab1\/\" target=\"_blank\" rel=\"noopener\">Omar Shehab<\/a><\/li>\r\n \t<li><strong>Localization effects in the circuit model: an efficient exact calculation of the Lieb-Robinson commutator norm for general matchgate evolution<\/strong>\u2014Adrian Chapman and Akimasa Miyake<\/li>\r\n \t<li><strong>Multi-mode multi-bosonic interference<\/strong>\u2014Abdullah Khalid, Dylan Spivak, Barry Sanders, and Hubert de Guise<\/li>\r\n \t<li><strong>How to Determine the Quantum Fisher Information from Linear Response Theory<\/strong>\u2014Tomohiro Shitara and Masahito Ueda<\/li>\r\n \t<li><strong>Entanglement from Topology in Chern-Simons Theory<\/strong>\u2014<a href=\"http:\/\/gsalton.com\/\" target=\"_blank\" rel=\"noopener\">Grant Salton<\/a>, Michael Walter, and Brian Swingle<\/li>\r\n \t<li><strong>Discrimination of correlated and entangling quantum channels with selective process tomography<\/strong>\u2014Eugene Dumitrescu and Travis Humble<\/li>\r\n \t<li><strong>Physical Correlations from Statistical Inference Bounds<\/strong>\u2014Avishy Carmi, Eliahu Cohen, and Daniel Moskovich<\/li>\r\n \t<li><strong>Characterizations of promise problems with exact quantum query complexity<\/strong>\u2014Daowen Qiu and Shenggen Zheng<\/li>\r\n \t<li><strong>Secure quantum cloud computing with practical verification<\/strong>\u2014Yuki Takeuchi, Keisuke Fujii, Tomoyuki Morimae and Nobuyuki Imoto<\/li>\r\n \t<li><strong>Compression of identically prepared quantum systems<\/strong>\u2014Yuxiang Yang, Giulio Chiribella, and Masahito Hayashi<\/li>\r\n<\/ul>\r\n<\/blockquote>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n<\/div>\r\n[\/panel]\r\n\r\n[panel header=\"Accepted papers\"]\r\n<ul>\r\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/1609.05537\" target=\"_blank\" rel=\"noopener\">Quantum Speed-ups for Semidefinite Programming<\/a>\u2014Fernando Brandao and Krysta Svore<\/li>\r\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/1608.05696\" target=\"_blank\" rel=\"noopener\">Bounding the costs of quantum simulation of many-body physics in real space<\/a>\u2014Ian Kivlichan, Nathan Wiebe, Ryan Babbush, and Al\u00e1n Aspuru-Guzik<\/li>\r\n \t<li>Quantum Circuits Synthesis Using Lattices Over Number Fields\u2014Sebastian Schoennenbeck and Vadym Kliuchnikov<\/li>\r\n<\/ul>\r\n[\/panel]\r\n\r\n[panel header=\"Instructions for speakers and poster presenters\"]\r\n<strong>Speakers:<\/strong>\r\n<blockquote>All talks will be recorded and posted on YouTube. Speakers will be asked to sign a release form to enable posting of the video. Talks should be 30 minutes in length. There will be an additional 5 minutes allocated for questions and answers, and five minutes to allow transition to the next speaker. All talks should use prepared slides. A projector will be available; there will not be a white board.<\/blockquote>\r\n<strong>Poster Presenters:<\/strong>\r\n<blockquote>Posters should be formatted to fit an assigned space 48 inches wide and 36 inches high. A board and fasteners will be available for displaying the poster. Posters must be prepared and printed by the presenter. Posters should be hung during the lunch prior to the assigned poster session and removed by the following morning\u2019s coffee break. Poster session assignments will be announced in the next few weeks.<\/blockquote>\r\n[\/panel]\r\n<h2>Committees<\/h2>\r\n[panel header=\"Program Committee\"]\r\n<ul>\r\n \t<li><a href=\"http:\/\/home.lu.lv\/~ambainis\/\">Andris Ambainis<\/a> (University of Latvia, Chair)<\/li>\r\n \t<li><a href=\"http:\/\/www.quantumlah.org\/people\/itai\">Itai Arad<\/a> (National U of Singapore and Technion, Israel)<\/li>\r\n \t<li><a href=\"http:\/\/math.ipm.ir\/~beigi\/\">Salman Beigi<\/a> (IPM, Tehran)<\/li>\r\n \t<li><a href=\"http:\/\/theory.physics.unige.ch\/~brunner\/\">Nicolas Brunner<\/a> (U Geneva)<\/li>\r\n \t<li><a href=\"https:\/\/who.rocq.inria.fr\/Andre.Chailloux\/\">Andre Chailloux<\/a> (INRIA)<\/li>\r\n \t<li><a href=\"http:\/\/www.dr-qubit.org\/\">Toby Cubitt<\/a> (University College London)<\/li>\r\n \t<li><a href=\"http:\/\/quantum-lab.org\/runyao\/\">Runyao Duan<\/a> (UTS, Sydney)<\/li>\r\n \t<li><a href=\"http:\/\/www.dr-qubit.org\/\">David Gosset<\/a> (IBM)<\/li>\r\n \t<li><a href=\"http:\/\/www.kcik.ug.edu.pl\/staff\">Michal Horodecki<\/a> (U of Gdansk)<\/li>\r\n \t<li><a href=\"http:\/\/www.its.caltech.edu\/~sjeffery\/\">Stacey Jeffery<\/a> (Caltech)<\/li>\r\n \t<li><a href=\"http:\/\/web.mit.edu\/~rkothari\/www\/index.html\">Robin Kothar<\/a>i (MIT)<\/li>\r\n \t<li><a href=\"https:\/\/who.rocq.inria.fr\/Anthony.Leverrier\/\">Anthony Leverrier<\/a> (INRIA)<\/li>\r\n \t<li><a href=\"http:\/\/home.lu.lv\/~sd20008\/\">Maris Ozols<\/a> (Cambridge)<\/li>\r\n \t<li><a href=\"http:\/\/www.strath.ac.uk\/staff\/pianimarcodr\/\">Marco Piani<\/a> (U of Strathclyde)<\/li>\r\n \t<li><a href=\"https:\/\/www.ulb.ac.be\/rech\/inventaire\/chercheurs\/8\/CH7368.html\">Stefano Pironio<\/a> (U Libre Bruxelles)<\/li>\r\n \t<li><a href=\"http:\/\/www.physique.usherbrooke.ca\/poulin\/index.php?sec=accueil&amp;lan=EN\">David Poulin<\/a> (U de Sherbrooke)<\/li>\r\n \t<li><a href=\"https:\/\/www.mattpusey.uk\/\">Matthew Pusey<\/a> (Perimeter Institute)<\/li>\r\n \t<li><a href=\"http:\/\/www.phas.ubc.ca\/~raussen\/\">Robert Raussendorf<\/a> (U of British Columbia)<\/li>\r\n \t<li><a href=\"http:\/\/quic.ulb.ac.be\/members\/jroland\">Jeremie Roland<\/a> (U Libre Bruxelles)<\/li>\r\n \t<li><a href=\"http:\/\/www.tcs.tifr.res.in\/~pgdsen\">Pranab Sen<\/a> (TIFR, Mumbai)<\/li>\r\n \t<li><a href=\"http:\/\/jilawww.colorado.edu\/people\/g_smith\">Graeme Smith<\/a> (JILA and U of Colorado, Boulder)<\/li>\r\n \t<li><a href=\"http:\/\/fangsong.info\/\">Fang Song<\/a> (Portland State U<\/li>\r\n \t<li><a href=\"http:\/\/physics.unm.edu\/pandaweb\/people\/person.php?personID=976\">Rolando Somma<\/a> (LANL)<\/li>\r\n \t<li><a href=\"http:\/\/iqim.caltech.edu\/profile\/kristan-temme\/\">Kristan Temme<\/a> (IBM)<\/li>\r\n \t<li><a href=\"http:\/\/www.markwilde.com\/\">Mark M. Wilde<\/a> (Louisiana State U)<\/li>\r\n \t<li><a href=\"https:\/\/ix.cs.uoregon.edu\/~xiaodiwu\/\">Xiaodi Wu<\/a> (U of Oregon)<\/li>\r\n \t<li><a href=\"https:\/\/www.perimeterinstitute.ca\/people\/jon-yard\">Jon Yard<\/a> (U of Waterloo and Perimeter Institute)<\/li>\r\n<\/ul>\r\n[\/panel]\r\n\r\n[panel header=\"Steering Committee\"]\r\n<ul>\r\n \t<li><a href=\"http:\/\/fernandobrandao.org\/\">Fernando Brandao<\/a> (Caltech)<\/li>\r\n \t<li><a href=\"http:\/\/www.math.uwaterloo.ca\/~amchilds\/\">Andrew Childs<\/a> (Maryland)<\/li>\r\n \t<li><a href=\"http:\/\/sydney.edu.au\/science\/people\/andrew.doherty.php\">Andrew Doherty<\/a> (USYD)<\/li>\r\n \t<li><a href=\"https:\/\/people.maths.bris.ac.uk\/~csxam\/\">Ashley Montanaro<\/a> (Bristol)<\/li>\r\n \t<li><a href=\"http:\/\/www-bcf.usc.edu\/~breichar\/\">Ben Reichardt<\/a> (USC)<\/li>\r\n \t<li><a href=\"http:\/\/www.itp.phys.ethz.ch\/people\/renner\">Renato Renner<\/a> (ETH Zurich)<\/li>\r\n \t<li><a href=\"http:\/\/phas.ucalgary.ca\/profiles\/barry-sanders\">Barry Sanders<\/a> (U Calgary)<\/li>\r\n \t<li><a href=\"http:\/\/research.microsoft.com\/en-us\/people\/ksvore\/\">Krysta Svore<\/a> (Microsoft Research, Chair)<\/li>\r\n \t<li><a href=\"https:\/\/www.quantuminfo.physik.rwth-aachen.de\/go\/id\/exxd\/lidx\/1\">Barbara Terhal<\/a> (TU Delft)<\/li>\r\n<\/ul>\r\n[\/panel]\r\n\r\n[panel header=\"Organizing Committee\"]\r\n<ul>\r\n \t<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/mibeverl\/\">Michael Beverland<\/a> (Microsoft Research)<\/li>\r\n \t<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/alexeib\/\">Alex Bocharov<\/a> (Microsoft Research)<\/li>\r\n \t<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/gurevich\/\">Yuri Gurevich<\/a> (Microsoft Research)<\/li>\r\n \t<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/mahastin\/\">Matthew Hastings<\/a> (Microsoft Research)<\/li>\r\n \t<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/vadym\/\">Vadym Kliuchnikov<\/a> (Microsoft Research)<\/li>\r\n \t<li>Jasmin Krout (Microsoft Research)<\/li>\r\n \t<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/mmostad\/\">Matt Mostad<\/a> (Microsoft Research)<\/li>\r\n \t<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/martinro\/\">Martin Roetteler<\/a> (Microsoft Research)<\/li>\r\n \t<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/ksvore\/\">Krysta Svore<\/a> (Microsoft Research)<\/li>\r\n \t<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/mtroyer\/\">Matthias Troyer<\/a> (Microsoft Research)<\/li>\r\n \t<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/nawiebe\/\">Nathan Wiebe<\/a> (Microsoft Research)<\/li>\r\n<\/ul>\r\n[\/panel]\r\n\r\n[\/accordion]"},{"id":2,"name":"Schedule & Videos","content":"<h3>Saturday, January 14, 2017<\/h3>\r\nMorning tutorial\r\n<em>Debugging the next generation of quantum devices<\/em>\r\n<u>Steve Flammia<\/u>\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-14-Morning-Tutorial-Steve-Flammia-2.pdf\">Presentation slides<\/a> | Videos: <a href=\"https:\/\/www.youtube.com\/watch?v=9bNq_-mLsz4&amp;feature=youtu.be\">Tutorial 1<\/a>, <a href=\"https:\/\/youtu.be\/I0pNdBv6i64\">Tutorial 2<\/a>\r\n\r\nAfternoon tutorial\r\n<em>Quantum thermodynamics<\/em>\r\n<u>L\u00eddia del Rio<\/u>\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-14-Afternoon-Tutorial-Lidia-del-Rio.pdf\">Presentation slides<\/a> | Videos: <a href=\"https:\/\/youtu.be\/cNo6KNOI1Aw\">Tutorial 1<\/a>, <a href=\"https:\/\/youtu.be\/2fD1RzjsSxs\">Tutorial 2<\/a>\r\n<h3>Sunday, January 15, 2017<\/h3>\r\nMorning tutorial\r\n<em>Matrix product states and tensor networks<\/em>\r\n<u>Norbert Schuch<\/u>\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-15-Morning-Tutorial-Norbert-Schuch.pdf\">Presentation slides<\/a> | Videos: <a href=\"https:\/\/youtu.be\/W_IBEAzqm4U\">Tutorial 1<\/a>, <a href=\"https:\/\/youtu.be\/yLpWKvk2fzY\">Tutorial 2<\/a>\r\n\r\nAfternoon tutorial\r\n<em>Quantum information and spacetime<\/em>\r\n<u>John Preskill<\/u>\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-15-Afternoon-Tutorial-John-Preskill.pdf\">Presentation slides<\/a> | Videos: <a href=\"https:\/\/youtu.be\/td1fz5NLjQs\">Tutorial 1<\/a>, <a href=\"https:\/\/youtu.be\/_i4Z5qARmqY\">Tutorial 2<\/a>\r\n<h3>Monday, January 16, 2017<\/h3>\r\n8:00-8:45\r\nRegistration\r\n\r\n8:45-9:00\r\nWelcoming address\r\n\r\n9:00-10:00\r\nPlenary talk I: Chair: Fang Song (Grand Ballroom I + II)\r\n<em>Quantum homomorphic encryption for polynomial-sized circuits (Best Student Paper)<\/em>\r\nYfke Dulek, Christian Schaffner, and Florian Speelman\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-15-Plenary-1-Florian-Speelman.pdf\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/ol3mwTsFOZI\">Abstract and video<\/a>\r\n\r\n10:00-10:30\r\nCoffee break\r\n\r\n10:30-12:30\r\nParallel session I-A: Chair: Andr\u00e9 Chailloux (Grand Ballroom I)\r\n\r\n10:30-11:10\r\n<em>Zero-knowledge proof systems for QMA<\/em>\r\nAnne Broadbent, Zhengfeng Ji, Fang Song, and John Watrous\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-16-Session-IA-Fang-Song.pdf\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/1fXLJBN-KfI\">Abstract and video<\/a>\r\n\r\n11:10-11:50\r\n<em>Compression of quantum multi-prover interactive proofs<\/em>\r\nZhengfeng Ji\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-16-Session-IA-Zhengfang-Ji.pdf\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/349lTxDm6mo\">Abstract and video<\/a>\r\n\r\n11:50-12:30\r\n<em>Sequential measurements, disturbance and property testing<\/em>\r\nAram Harrow, Cedric Lin, and Ashley Montanaro\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-16-Session-IA-Aram-Harrow.pdf\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/HcQIRHAhkSw\">Abstract and video<\/a>\r\n\r\nParallel session I-B: Chair: David Poulin (Grand Ballroom II)\r\n\r\n10:30-11:10\r\n<em>Unifying gate-synthesis and magic state distillation<\/em>\r\nEarl Campbell and Mark Howard\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-16-Session-IB-Mark-Howard-5.pdf\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/1xluQnfqlzM\">Abstract and video<\/a>\r\n\r\n11:10-11:50\r\n<em>Application of a resource theory for magic states to fault-tolerant quantum computing<\/em>\r\nMark Howard and Earl Campbell\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-16-Session-IB-Earl-Campbell.pdf\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/uMGaXEx5p3I\">Abstract and video<\/a>\r\n\r\n11:50-12:30\r\n<em>Time-correlated noise in quantum computation<\/em>\r\nH\u00e9ctor Bomb\u00edn\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-16-Session-IB-Hector-Bombin.pdf\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/yiW0V6Yh6u8\">Abstract and video<\/a>\r\n\r\n12:30-2:00\r\nLunch break\r\n\r\n2:00-3:20\r\nParallel session II-A: Chair: J\u00e9r\u00e9mie Roland (Grand Ballroom I)\r\n\r\n2:00-2:40\r\n<em>Separations in communication complexity using cheat sheets and information complexity<\/em>\r\nAnurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika G\u00f6\u00f6s, Rahul Jain, Robin Kothari, Troy Lee, and Miklos Santha\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-16-Session-IIA-Anurag-Anshu.pdf\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/1TSdQRiQAKE\">Abstract and video<\/a>\r\n\r\n2:40-3:20\r\n<em>Information-theoretic tools for interactive quantum protocols, and applications: flow of information, augmented index, and DYCK(2)<\/em>\r\nMathieu Lauri\u00e8re, Ashwin Nayak, and Dave Touchette\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-16-Session-IIA-Dave-Touchette.pdf\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/2yAj4GMS3fE\">Abstract and video<\/a>\r\n\r\nParallel session II-B: Chair: Karol Horodecki (Grand Ballroom II\r\n\r\n2:00-2:40\r\n<em>Energy as a detector of nonlocality of many-body spin systems<\/em>\r\nJordi Tura Brugu\u00e9s, Gemma de Las Cuevas, Remigiusz Augusiak, Maciej Lewenstein, Antonio Ac\u00edn, and Ignacio Cirac\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-17-Session-IIB-Jordi-Tura-Brugues.pdf\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/OHWkzil45Kg\">Abstract and video<\/a>\r\n\r\n2:40-3:20\r\n<em>A resource theory for work and heat<\/em>\r\nCarlo Sparaciari, Jonathan Oppenheim, and Tobias Fritz\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-17-Session-IIB-Carlo-Sparaciari.pdf\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/9MkMu60xU04\">Abstract and video<\/a>\r\n\r\n3:20-3:50\r\nCoffee break + mentor sessions\r\nSign up for mentoring using available sheets.\r\n\r\n3:50-4:50\r\nPlenary talk II: Chair: Andrew Doherty (Grand Ballroom I + II)\r\n<em>The entanglement of distillation for gauge theories<\/em>\r\nKarel Van Acoleyen, Volkher Scholz, Michael Marien, Nick Bultinck, Jutho Haegemen, and Frank Verstraete\r\n<a href=\"https:\/\/youtu.be\/3Ozjh-gVJOA\">Abstract and video<\/a>\r\n\r\n4:50-6:30\r\nPoster session I: (Grand Ballroom III)\r\nHors d\u2019Oeuvres and drinks will be provided. Vote for best poster using the tickets in your badge.\r\n\r\n8:00-9:30\r\nSoftware demo I: Will Zeng: Rigetti Computing (Grand Ballroom I + II)\r\n<a href=\"https:\/\/youtu.be\/IpoASc18P5Q\">Video<\/a>\r\n<h3>Tuesday, January 17, 2017<\/h3>\r\n9:00-10:00\r\nInvited talk I: Chair: Peter Shor (Grand Ballroom I + II)\r\n<em>Simulating quantum systems on classical computers<\/em>\r\nGarnet Chan\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/01\/2017-01-17-Invited-1-Garnet-Chan.pptx\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/yYwUQe2Aorw\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"t-psIIIA-brandao\"><\/a>10:00-10:30\r\nCoffee break\r\n\r\n<a name=\"t-psIIIA-prakash\"><\/a>10:30-12:30\r\nParallel session III-A: Chair: Aram Harrow (Grand Ballroom I)\r\n<a name=\"t-psIIIA-fefferman\"><\/a>\r\n\r\n10:30-11:10\r\n<em>Quantum speed-ups for semidefinite programming<\/em>\r\nFernando Brandao and Krysta Svore\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-17-Session-IIIA-Fernando-Brandao.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/nqlA9YxMZwI\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n11:10-11:50\r\n<em>Quantum recommendation systems<\/em>\r\nIordanis Kerenidis and Anupam Prakash\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-17-Session-IIIA-Anupam-Prakash.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/fvERLz9Ux80\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"t-psIIIB-renes\"><\/a>\r\n\r\n11:50-12:30\r\n<em>A complete characterization of unitary quantum space<\/em>\r\nBill Fefferman and Cedric Yen-Yu Lin\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-17-Session-IIIA-Bill-Fefferman.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/RtH8sOdr12w\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\nParallel session III-B: Chair: Todd Brun (Grand Ballroom II)\r\n<a name=\"t-psIIIB-reutter\"><\/a>\r\n\r\n10:30-11:10\r\n<em>Belief propagation decoding of quantum channels by passing quantum messages<\/em>\r\nJoseph M. Renes\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-17-Session-IIIB-Joseph-Renes.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | \u00a0\u00a0\u00a0\u00a0<a href=\"https:\/\/youtu.be\/TVkn524ALco\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"t-psIIIB-majenz\"><\/a>\r\n\r\n11:10-11:50\r\n<em>Biunitary constructions in quantum information<\/em>\r\nDavid Reutter and Jamie Vicary\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-17-Session-IIIB-David-Reutter.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/_nVsClvU0lY\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n11:50-12:30\r\n<em>Catalytic Decoupling<\/em>\r\nChristian Majenz, Mario Berta, Fr\u00e9d\u00e9ric Dupuis, Renato Renner, and Matthias Christandl,\r\nmerged with:\r\n<em>Deconstruction and conditional erasure of quantum correlations<\/em>\r\nMario Berta, Fernando Brandao, Christian Majenz, and Mark Wilde\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-17-Session-IIIB-Christian-Majenz.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/tAWiMLH4Ank\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"t-psIVA-wang\"><\/a>12:30-2:00\r\nLunch break\r\n\r\n2:00-3:20\r\nParallel session IV-A: (Grand Ballroom I, Chair: Xiaodi Wu)\r\n<a name=\"t-psIVA-garg\"><\/a>\r\n\r\n2:00-2:40\r\n<em>Asymptotic entanglement manipulation under PPT operations: new SDP bounds and irreversibility<\/em>\r\nXin Wang and Runyao Duan\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-17-Session-IVA-Xin-Wang.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/EufpsdJxVV0\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"t-psIVB-arunachalam\"><\/a>\r\n\r\n2:40-3:20\r\n<em>Operator scaling and applications<\/em>\r\nAnkit Garg, Leonid Gurvits, Rafael Oliveira, and Avi Wigderson\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-17-Session-IVA-Ankit-Garg.pptx\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/gmIxJbvaWWw\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\nParallel session IV-B: (Grand Ballroom II, Chair: Miklos Santha)\r\n<a name=\"t-psIVB-h\u00f8yer\"><\/a>\r\n\r\n2:00-2:40\r\n<em>Optimal quantum sample complexity of learning algorithms<\/em>\r\nSrinivasan Arunachalam and Ronald de Wolf\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-18-Session-IVB-Srinivasan-Arunachalam.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/BcHKMOQTnKg\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n2:40-3:20\r\n<em>Efficient quantum walk on the grid with multiple marked elements<\/em>\r\nPeter H\u00f8yer and Mojtaba Komeili\r\nmerged with:\r\n<em>Controlled quantum ampli\ufb01cation<\/em>\r\nC\u0103t\u0103lin Dohotaru and Peter H\u00f8yer\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-17-Session-IVB-Peter-Hoyer.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/qC4XLHt7DTc\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"t-invited-lu\"><\/a>3:20-3:50\r\nCoffee break + mentor sessions (sign up for mentoring using available sheets)\r\n\r\n3:50-4:50\r\n<a name=\"poster2\"><\/a>Invited talk II: Chair: Jonathan Oppenheim (Grand Ballroom I + II)\r\n<em>Racing classical computers with quantum boson-sampling machines<\/em>\r\nChaoyang Lu\r\n<a href=\"https:\/\/youtu.be\/o-8Yuk9qh8U\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n4:50-6:30\r\n<a name=\"demo2\"><\/a>Poster session II: (Grand Ballroom III)\r\nHors d\u2019Oeuvres and drinks will be provided. Vote for best poster using the tickets in your badge.\r\n\r\n8:00-9:30\r\nSoftware demo II: (Grand Ballroom I + II)\r\nDave Wecker: Microsoft LIQUi|&gt;\r\n<a href=\"https:\/\/youtu.be\/9JEjqiq7pHE\" target=\"_blank\" rel=\"noopener\">Video<\/a>\r\n<h3>Wednesday, January 18, 2017<\/h3>\r\n9:00-10:00\r\nPlenary talk III: Chair: Fernando Brandao (Grand Ballroom I + II)\r\n<em>From quantum thermodynamical identities to a second law equality<\/em>\r\nAlvaro Alhambra, Jonathan Oppenheim, Chris Perry, and Lluis Masanes\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-18-Plenary-3-Jonathan-Oppenheim.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/QfaMNUnEDGQ\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n10:00\r\nGroup photo\r\nFollow the crowd! We\u2019d love to have you in that picture!\r\n\r\n<a name=\"w-psvA-dauphinais\"><\/a>10:00-10:20\r\nCoffee break\r\n\r\n10:20-11:40\r\nParallel session V-A: Chair: Robert Raussendorf (Grand Ballroom I)\r\n<a name=\"w-psvA-williamson\"><\/a>\r\n\r\n10:20-11:00\r\n<em>Fault-tolerant error correction for non-abelian anyons<\/em>\r\nGuillaume Dauphinais and David Poulin\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-18-Session-VA-Guillaume-Dauphinas.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/n0qoMjtZPEM\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"w-psvb-yuen\"><\/a>\r\n\r\n11:00-11:40\r\n<em>Anyons and matrix product operator algebras<\/em>\r\nNick Bultinck, Michael Marien, Dominic Williamson, Mehmet Burak Sahinoglu, Jutho Haegeman, and Frank Verstraete\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-18-Session-VA-Dominic-Williamson.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/rmc8o56i_aQ\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"w-psvb-natarajan\"><\/a>Parallel session V-B: Chair: Thomas Vidick (Grand Ballroom II)\r\n\r\n10:20-11:00\r\n<em>A parallel repetition theorem for all entangled games<\/em>\r\nHenry Yuen\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-18-Session-VB-Henry-Yuen.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/bHe1ODCfKkY\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n11:00-11:40\r\n<em>Limitations of semidefinite programs for separable states and entangled games<\/em>\r\nAram Harrow, Anand Natarajan, and Xiaodi Wu\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-18-Session-VB-Anand-Natarajan.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/CfCtanzg38w\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n11:40-12:00\r\n<a name=\"w-psVIA-woods\"><\/a>Coffee break\r\n\r\n12:00-1:20\r\nParallel session VI-A: Chair: Omar Fawzi (Grand Ballroom I)\r\n<a name=\"w-psVIA-sutter\"><\/a>\r\n\r\n12:00-12:40\r\n<em>Applications of recoverability in quantum information<\/em>\r\nAlvaro Alhambra, Mario Berta, Francesco Buscemi, Siddhartha Das, Marius Lemm, Seth Lloyd, Iman Marvian, Mark Wilde, Stephanie Wehner, and Mischa Woods\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-18-Session-VIA-Mischa-Woods.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/DzGY9ZgAA64\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"w-psVIB-Biasse\"><\/a>\r\n\r\n12:40-1:20\r\n<em>Multivariate trace inequalities<\/em>\r\nDavid Sutter, Mario Berta, and Marco Tomamichel\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-18-Session-VIA-David-Sutter.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/Vcp4RaD3aD8\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"w-psVIB-bendavid\"><\/a>Parallel session VI-B: Chair: Robin Kothari (Grand Ballroom II)\r\n\r\n12:00-12:40\r\n<em>A polynomial time quantum algorithm for computing class groups and solving the principal ideal problem in arbitrary degree number fields<\/em>\r\nJean-Francois Biasse and Fang Song\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-18-Session-VIB-Jean-Francois-Biasse.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/S-mXI4_QIyI\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n12:40-1:20\r\n<em>Sculpting quantum speedups<\/em>\r\nScott Aaronson and Shalev Ben-David\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-18-Session-VIB-Shalev-Ben-David.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/84dEqkOoOEk\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"conferencedinner\"><\/a>1:20-6:30\r\nFree afternoon\r\nExplore Seattle on your own or join one of the organized excursions by the QuArC team.\r\n\r\n6:30-9:30\r\nConference dinner\r\nAt the Grand Ballroom on the fourth floor.\r\n<h3>Thursday, January 19, 2017<\/h3>\r\n9:00-10:00\r\nInvited talk III: Chair: Krysta Svore (Grand Ballroom I + II)\r\n<em>Spectrahedral lifts and quantum learning \u00a0<\/em>\r\nJames Lee\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Invited-3-James-Lee.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/YATM5FBUOm0\" target=\"_blank\" rel=\"noopener\">Video<\/a>\r\n\r\n<a name=\"r-psVIIA-crosso\"><\/a>10:00-10:30\r\nCoffee break\r\n\r\n10:30-12:30\r\n<a name=\"r-psVIIA-low\"><\/a>Parallel session VII-A: (Grand Ballroom I, Chair: David Gosset)\r\n\r\n10:30-11:10\r\n<em>Simulated quantum annealing can be exponentially faster than classical simulated annealing<\/em>\r\nElizabeth Crosson and Aram Harrow\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Session-VIIA-Elizabeth-Crosson.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\nmerged with:\r\n<em>Adiabatic optimization versus diffusion Monte Carlo<\/em>\r\nMichael Jarret, Stephen Jordan, and Brad Lackey\r\n<a href=\"https:\/\/youtu.be\/tXxMtXiOc_k\">Abstract and video<\/a><a name=\"r-psVIIA-vidick\"><\/a>\r\n\r\n11:10-11:50\r\n<em>Optimal Hamiltonian simulation by quantum signal processing<\/em>\r\nGuang Hao Low and Isaac Chuang\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Session-VIIA-Guang-Hao-Low.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/Cv9juBFHIVs\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"r-psVIIb-chitambar\"><\/a>\r\n\r\n11:50-12:30\r\n<em>Rigorous RG algorithms and area laws for low energy eigenstates in 1D<\/em>\r\nItai Arad, Zeph Landau, Umesh Vazirani, and Thomas Vidick\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Session-VIIA-Thomas-Vidick-1.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/Dvr2mcA6_uA\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"r-psVIIb-chiribella\"><\/a>Parallel session VII-B: (Grand Ballroom II, Chair: Mark Wilde)\r\n\r\n10:30-11:10\r\n<em>Round complexity in the local transformations of quantum and classical state<\/em>\r\nEric Chitambar and Min-Hsiu Hsieh\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Session-VIIB-Eric-Chitambar.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/OJaGuFqzXQo\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n11:10-11:50\r\n<em>Optimal compression for identically prepared qubit states<\/em>\r\nYuxiang Yang, Giulio Chiribella, and Masahito Hayashi\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Session-VIIB-Giulio-Chiribella.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/p7hC9B0UCbM\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n11:50-12:30\r\nFree time\r\n\r\n<a name=\"r-psVIIIA-piddock\"><\/a>12:30-2:00\r\nBusiness lunch (Grand Ballroom I + II)\r\nBoxed lunches will be provided.\r\n\r\n<a name=\"r-psVIIIA-gosset\"><\/a>2:00-4:00\r\nParallel session VIII-A: Chair: Nathan Wiebe (Grand Ballroom I)\r\n\r\n2:00-2:40\r\n<em>Universal quantum Hamiltonians<\/em>\r\nToby Cubitt, Ashley Montanaro, and Stephen Piddock\r\n\r\n<a name=\"r-psVIIIA-gilyen\"><\/a>\r\n\r\n2:40-3:20\r\n<em>Complexity of quantum impurity problems<\/em>\r\nSergey Bravyi and David Gosset\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Session-VIIIA-David-Gosset.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/kdXD975Tnog\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"r-psVIIIB-natarajan\"><\/a>\r\n\r\n3:20-4:00\r\n<em>On preparing ground states of gapped Hamiltonians: an efficient quantum Lov\u00e1sz local lemma<\/em>\r\nAndras Gilyen and Or Sattath\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Session-VIIIA-Andras-Gilyen.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/j-uNlygJ1Vs\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\nParallel session VIII-B: Chair: Anthony Leverrier (Grand Ballroom II)\r\n<a name=\"r-psVIIIB-chao\"><\/a>\r\n\r\n2:00-2:40\r\n<em>Robust self-testing of many qubit states<\/em>\r\nAnand Natarajan and Thomas Vidick\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Session-VIIIB-Anand-Natarajan.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/kth0GNnKq_g\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"r-psVIIIB-chung\"><\/a>\r\n\r\n2:40-3:20\r\n<em>Overlapping qubits<\/em>\r\nRui Chao, Ben Reichardt, Chris Sutherland and Thomas Vidick,\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Session-VIIIB-Rui-Chao.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/TP7jMlE5qCk\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\nmerged with:\r\n<em> Parallel self-testing of (tilted) EPR pairs via copies of (tilted) CHSH<\/em>\r\nAndrea W. Coladangelo,\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Session-VIIIB-Andrea-Coladangelo.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/TP7jMlE5qCk\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\nmerged with:\r\n<em> The parallel-repeated magic square game is rigid<\/em>\r\nMatthew Coudron and Anand Natarajan\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Session-VIIIB-Matthew-Coudron.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/TP7jMlE5qCk\">Abstract and video<\/a>\r\n\r\n3:20-4:00\r\n<em>General randomness amplification with non-signaling security<\/em>\r\nKai-Min Chung, Yaoyun Shi, and Xiaodi Wu\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Session-VIIIB-Xiaodi-Wu.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/jjWc2kGS8yc\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"r-plenary-friedman\"><\/a>4:00-4:30\r\nCoffee break + mentor sessions (sign up for mentoring using available sheets)\r\n\r\n4:30-5:30\r\nPlenary talk IV: Chair: Joseph Renes (Grand Ballroom I + II)\r\n<em>Entropy accumulation in device-independent protocols<\/em>\r\nRotem Arnon-Friedman, Fr\u00e9d\u00e9ric Dupuis, Omar Fawzi, Renato Renner, and Thomas Vidick\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-19-Plenary-4-Rotem-Arnon-Friedman.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/4rwA_2aLnLc\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n5:30-7:00\r\nFree time\r\nTime for a quick dinner and for transitioning to the Seattle Aquarium\r\n\r\n7:30-10:30\r\nRump session at the Seattle Aquarium\r\nPlease submit your rump talk suggestions to Vadym Kliuchnikov! (vadym@microsoft.com)\r\n<h3>Friday, January 20, 2017<\/h3>\r\n9:00-10:00\r\nPlenary talk V: Chair: Andris Ambainis (Grand Ballroom I + II)\r\n<em>Tsirelson\u2019s problem and an embedding theorem for groups arising from non-local games<\/em>\r\nWilliam Slofstra\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Plenary-5-William-Slofstra.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/RR_7Y00klK0\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"f-psIXA-boixo\"><\/a>10:00-10:30\u00a0 Coffee break\r\n\r\n10:30-12:30\r\nParallel session IX-A: (Grand Ballroom I, Chair: Martin Roetteler)\r\n<a name=\"f-psIXA-fujii\"><\/a>\r\n\r\n10:30-11:10\r\n<em>Characterizing quantum supremacy in near-term devices<\/em>\r\nSergio Boixo, Sergei Isakov, Vadim Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael Bremner, John Martinis, and Hartmut Neven\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-IXA-Sergio-Boixo.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/uNNg9R_TCkg\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"f-psIXA-bravyi\"><\/a>\r\n\r\n11:10-11:50\r\n<em>Threshold theorem for quantum supremacy<\/em>\r\nKeisuke Fujii\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-IXA-Keisuke-Fujii.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/wBa0wdtkSZk\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"f-psIXB-depalma\"><\/a>\r\n\r\n11:50-12:30\r\n<em>Improved classical simulation of quantum circuits dominated by Clifford gates<\/em>\r\nSergey Bravyi and David Gosset\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-IXA-Sergey-Bravyi.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/MqVTcuLw9Dc\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\nParallel session IX-B: Chair: Stephen Bartlett (Grand Ballroom II)\r\n<a name=\"f-psIXB-leverrier\"><\/a>\r\n\r\n10:30-11:10\r\n<em>Gaussian optimizers in quantum information<\/em>\r\nGiacomo De Palma, Dario Trevisan, and Vittorio Giovannetti\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-IXB-Giacomo-De-Palma.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/5HwadffK4TI\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"f-psIXB-vershynina\"><\/a>\r\n\r\n11:10-11:50\r\n<em>SU(p,q) coherent states and Gaussian de Finetti theorems<\/em>\r\nAnthony Leverrier\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-IXB-Anthony-Leverrier.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/JkG5vguZxEs\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n11:50-12:30\r\n<em>Geometric inequalities and contractivity of bosonic semigroups<\/em>\r\nNilanjana Datta, Stefan Huber, Robert K\u00f6nig, Yan Pautrat, Cambyse Rouz\u00e9, and Anna Vershynina\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-IXB-Anna-Vershynina.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/ZtdhaD2JFjg\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"f-psXA-laurenza\"><\/a>12:30-2:00\r\nLunch\r\n\r\n2:00-4:00\r\nParallel session X-A: (Grand Ballroom I, Chair: Min-Hsiu Hsieh)\r\n<a name=\"f-psXA-gao\"><\/a>\r\n\r\n2:00-2:40\r\n<em>Two-way assisted capacities for quantum and private communication<\/em>\r\nStefano Pirandola, Riccardo Laurenza, Carlo Ottaviani, and Leonardo Banchi,\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-XA-Riccardo-Laurenza.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/yLaBsIBZzJ4\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\nmerged with:\r\n<em>Converse bounds for private communication over quantum channels<\/em>\r\n<a name=\"f-psXA-wang\"><\/a>Mark Wilde, Marco Tomamichel, and Mario Berta\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-XA-Mark-Wilde.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/yLaBsIBZzJ4\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n2:40-3:20\r\n<em>Capacity estimates for TRO channels<\/em>\r\nLi Gao, Marius Junge, and Nicholas Laracuente\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-XA-Li-Gao.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/_qKhiUyNGFQ\" target=\"_blank\" rel=\"noopener\">Video<\/a>\r\n\r\n<a name=\"f-psXB-kastoryano\"><\/a>\r\n\r\n3:20-4:00\r\n<em>Semidefinite programming strong converse bounds for quantum channel capacities<\/em>\r\nXin Wang, Wei Xie and Runyao Duan\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-XA-Xin-Wang.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/vl0pTbHPUh0\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\nParallel session X-B: Chair: Matthew Hastings (Grand Ballroom II)\r\n<a name=\"f-psXB-kato\"><\/a>\r\n\r\n2:00-2:40\r\n<em>Finite correlation length implies efficient preparation of quantum thermal states<\/em>\r\nMichael Kastoryano and Fernando Brandao\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-XB-Michael-Kastoryano.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/qwa5gHo8rsI\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"f-psXB-roberts\"><\/a>\r\n\r\n2:40-3:20\r\n<em>The thermality of quantum approximate Markov chains, with implications to the locality of edge states and entanglement spectrum<\/em>\r\nKohtaro Kato and Fernando Brandao\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-XB-Kohtaro-Kato.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/kxfwz78GsBU\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n3:20-4:00\r\n<em>Symmetry protected topological order at nonzero temperature<\/em>\r\nSam Roberts, Beni Yoshida, Aleksander Kubica, and Stephen Bartlett\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Session-XB-Sam-Roberts.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/BltJkGcfFp4\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n<a name=\"f-plenary-touchette\"><\/a>4:00-4:30\r\nCoffee break + mentor sessions (sign up for mentoring using available sheets)\r\n\r\n4:30-5:30\r\nPlenary talk VI: Chair: Ronald de Wolf (Grand Ballroom I + II)\r\n<em>Exponential separation between quantum communication complexity and classical information complexity<\/em>\r\nAnurag Anshu, Dave Touchette, Penghui Yao, and Nengkun Yu\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/09\/2017-01-20-Plenary-6-Dave-Touchette.pdf\" target=\"_blank\" rel=\"noopener\">Presentation slides<\/a> | <a href=\"https:\/\/youtu.be\/TsR3qbnaxMA\" target=\"_blank\" rel=\"noopener\">Abstract and video<\/a>\r\n\r\n5:30\r\nClosing\r\n\r\nDisclaimer: Speaker assignments are indicated by an underscored name. Unless requested differently by the authors, by default the first registered individual in the author list was assigned to be speaker. If a merged talk indicates more than one assigned speaker, the allotted time will be split equally among the presenters."},{"id":3,"name":"Travel and Local","content":"[accordion]\r\n\r\n<strong>Travel, visas, and local information<\/strong>\r\n\r\nQIP 2017 was held in Seattle, Washington at the <a href=\"http:\/\/www.westinseattle.com\/\">Westin Downtown Seattle<\/a>. Seattle is easily accessible by light rail and car from the Seattle-Tacoma International Airport (SEA).\r\n\r\n[gallery size=\"full\" columns=\"4\" ids=\"440631,440622,440628,440625,440598,440595,440586,440589\"]\r\n\r\n[panel header=\"U.S. Visas\"]\r\n\r\n<strong>Plan ahead!<\/strong> It is imperative that speakers and attendees allow sufficient time to obtain visas. International registrants should be particularly aware and careful about visa requirements, and should plan travel well in advance.\r\n\r\n<strong>U.S. Visa Information<\/strong>\r\n\r\nInformation on United States visas can be found <a href=\"https:\/\/travel.state.gov\/content\/visas\/en\/visit.html\">here<\/a>. It is advisable to begin the application process as early as possible to avoid last minute problems. The time to obtain a visa can vary widely and has taken over three months for some individuals in the past. An interview at a consulate may also be required.\r\n\r\nThe <a href=\"http:\/\/www.dhs.gov\/\">US Department of Homeland Security<\/a> has implemented the <a href=\"https:\/\/www.cbp.gov\/travel\/international-visitors\/esta\">Electronic System for Travel Authorization (ESTA)<\/a>. ESTA is a new fully automated, electronic system for screening passengers before they begin travel to the United States under the <a href=\"https:\/\/travel.state.gov\/content\/visas\/en\/visit\/visa-waiver-program.html\">Visa Waiver Program<\/a>. ESTA applications may be submitted at any time prior to travel to the United States, and VWP travelers are encouraged to apply for authorization as soon as they begin to plan a trip to the United States. <strong>Please note that ESTA has become mandatory for all travelers from current Visa Waiver Program member countries.<\/strong>\r\n\r\n<strong>Invitation Letters<\/strong>\r\n\r\n<strong>Important:<\/strong> Requests for invitation letters need to be received by <strong>November 11, 2016.<\/strong>\r\n\r\nConference attendees who require a visa will typically need an invitation letter from the QIP Local Chair. To obtain a letter, contact <a href=\"mailto:jasmin@microsoft.com\">jasmin@microsoft.com<\/a> with email header \u201cQIP 2017 Visa Letter Request\u201d. To expedite the process, please provide as many of the following pieces of information as possible in your request:\r\n<blockquote>\u25e6Name<\/blockquote>\r\n<blockquote>\u25e6Mailing Address<\/blockquote>\r\n<blockquote>\u25e6Fax Number<\/blockquote>\r\n<blockquote>\u25e6If presenting a paper\/poster\/talk, include the title<\/blockquote>\r\n<blockquote>\u25e6An up-to-date Curriculum Vitae (CV) that includes, if applicable, a list of publications<\/blockquote>\r\n<blockquote>\u25e6A brief statement explaining your interests in the conference<\/blockquote>\r\n<blockquote>\u25e6A list of any recent QIP conferences you have attended<\/blockquote>\r\n<blockquote>\u25e6A reference in the quantum information community who has attended past QIP conferences.<\/blockquote>\r\n<i>We look forward to seeing you at QIP 2017 in Seattle!<\/i>\r\n\r\n[\/panel]\r\n\r\n[panel header=\"Transportation\"]\r\n\r\n<strong>Traveling to Seattle<\/strong>\r\n\r\nBy Air: The <a href=\"http:\/\/www.portseattle.org\/seatac\/\">Seattle-Tacoma (SeaTac) International Airport<\/a> is located to the south of Seattle. It serves major domestic and international airlines and is easily accessible via taxi, bus, or light rail (see below for details).\r\n\r\nBy Train: Seattle can be conveniently reached by train (<a href=\"http:\/\/tickets.amtrak.com\/itd\/amtrak\">Amtrak Cascades line<\/a>) from Portland, Oregon (3.5 hours), or Vancouver, B.C., Canada (4.5 hours).\r\n\r\nOther options: There are many ways to travel to Seattle from Victoria and Vancouver, B.C., including the <a href=\"http:\/\/www.clippervacations.com\/\">Victoria Clipper Service<\/a>. For details see <a href=\"http:\/\/old.seattletimes.com\/html\/travel\/2008116402_trthreecities17.html\">here<\/a>.\r\n\r\n<strong>Transportation to downtown Seattle<\/strong>\r\n\r\nBy Car: For a map and automobile transportation options to the downtown area from the airport or other locations in Seattle, please see <a href=\"http:\/\/www.westinseattle.com\/transportation\">here<\/a>.\r\n\r\nBy Taxi: Seattle Yellow Cab is the exclusive provider of taxis for the only taxi stands at Seattle-Tacoma Airport. At the time of this writing, the cost to take a taxi from the airport to downtown is approximately $40. Cash and credit cards are accepted. See the <a href=\"http:\/\/www.seattleyellowcab.com\/rates\/\">Yellow Cab flat rate zone map<\/a>. They have 8 to 10 passenger vans available for larger groups.\r\n\r\nBy Uber: There is an Uber pickup location at the airport. <a href=\"http:\/\/seattle.ubermovement.com\/seatacairport\/\">Please see their site for details<\/a>.\r\n\r\nBy Light Rail: By far the easiest and least expensive way to get to downtown Seattle is via <a href=\"http:\/\/www.soundtransit.org\/schedules\/link-light-rail\">Sound Transit Light Rail<\/a>. The train stops just a few blocks from Westin Hotel. The fair is $2.50 per person. Purchase your tickets at the automatic ticket dispensers; it will take VISA, MasterCard, or cash.\r\n\r\n<strong>Transportation to the airport<\/strong>\r\n\r\nBy Taxi: For traveling to Sea-Tac airport from the Westin Hotel or other locations in the downtown Seattle hotel district, you have multiple taxi options. A flat rate fee of $32.00 is charged for this service by all taxicabs that operate in Seattle.\r\n\r\nBy Train: <a href=\"http:\/\/www.soundtransit.org\/schedules\/link-light-rail\">Sound Transit Light Rail<\/a>, with a stop just a few blocks from Westin Hotel, provides service to SeaTac airport. The fare is $2.50 per person. Purchase your tickets at the automatic ticket dispensers; it will take VISA, MasterCard, or cash.\r\n\r\n<strong>In the city<\/strong>\r\n\r\nPublic transportation within downtown Seattle and beyond is offered via <a href=\"http:\/\/kingcounty.gov\/depts\/transportation\/metro\/travel-options\/bus.aspx\">Metro Transit buses<\/a> or Sound Transit bus and light rail service.\r\n\r\n[\/panel]\r\n\r\n[panel header=\"Accommodations\"]\r\n\r\nSee accommodations at the <a href=\"http:\/\/www.westinseattle.com\/\">Westin Downtown Seattle<\/a>\r\n\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/11\/The-Westin-Seattle-Restaurants-within-7-Blocks.pdf\">Explore restaurants within seven blocks<\/a>\r\n\r\n[\/panel]\r\n\r\n[panel header=\"Top things to do\"]\r\n\r\nWelcome to Seattle! Here you will find a vibrant, sophisticated metropolis surrounded by pristine natural beauty and abundant recreation. For places to go and see please consult <a href=\"http:\/\/www.visitseattle.org\/Home.aspx\">Seattle\u2019s Convention and Visitors Bureau<\/a> and Seattle City Government. <a href=\"http:\/\/www.tripadvisor.com\/Attractions-g60878-Activities-Seattle_Washington.html\">TripAdvisor<\/a> also has a nice list of top attractions in the city.\r\n\r\nHere are a couple of recommendations from local Seattleites:\r\n\r\n<strong>Pike Place Market<\/strong>\r\n\r\nDirections from conference hotel: Walk 5 blocks down the hill on Madison. Turn Right onto 1st Ave. Walk 5 blocks to 1st and Pike St. You\u2019re there! Look for the large red neon sign.\r\n\r\nOnce there, here are some tips:\r\n<blockquote>\u25e6Get freshly-made, hot mini-donuts (across from DeLaurenti\u2019s); use a straw to spear them inside the bag.<\/blockquote>\r\n<blockquote>\u25e6Go to <a href=\"http:\/\/beechershandmadecheese.com\/\">Beecher\u2019s<\/a> for fresh, handmade cheese. Free samples! (across the street from the main market building)<\/blockquote>\r\n<blockquote>\u25e6Don\u2019t forget the Market\u2019s 2nd and 3rd floors downstairs! Make sure you have 2 quarters and a penny.<\/blockquote>\r\n<blockquote>\u25e6Bring cash in small bills.<\/blockquote>\r\n<blockquote>\u25e6Don\u2019t eat too much at any one place; dining through the market is the way to go!<\/blockquote>\r\n<blockquote>\u25e6Have a cup of Joe at the original Starbucks (also across the street from the main building).<\/blockquote>\r\n<strong>EMP Museum (music + sci-fi + pop culture)<\/strong>\r\n\r\n325 5th Ave N, Seattle, WA 98109 \u00b7 (206) 770-2700 (Ticket prices vary; winter hours: daily 10:00 AM to 5:00 PM)\r\n\r\n<strong>Seattle Center<\/strong>\r\n\r\nSpace needle, Key Arena, International Fountain, etc. Take the monorail between downtown and the Seattle Center.\r\n\r\n<strong>Seattle Art Museum<\/strong>\r\n\r\n1300 1st Ave, (206) 654-3137 ($15 Adults; Wednesday to Sunday: 10:00 AM to 5:00 PM; Thursday and Friday: 10:00 AM to 9:00 PM)\r\n\r\nIf the weather is nice, also try the (free) Olympic Sculpture Park. It is outdoors along the water just down the street from the Seattle Center.\r\n\r\n<strong>Seattle Aquarium<\/strong>\r\n\r\n1483 Alaskan Way, Seattle, WA 98101, (206) 386-4300 (206) 386-4300 (Adults $19\/Child $12; 9:30 AM to 5:00 PM daily)\r\n\r\n<strong>Underground Tour<\/strong>\r\n\r\n608 1st Ave in Pioneer Square, between Cherry Street and James St.\r\n\r\nDirections: walk down Madison to 5th. Turn Left onto 5th. Walk 3 blocks on 5th to Cherry. Turn Right onto Cherry. Walk 4 blocks down Cherry to 1st. Turn Left onto 1st. $16 Adults; roughly a 90-minute walk. Very fun! Highly recommended! Also take a look around Pioneer Square while you are there.\r\n\r\n<strong>Food!<\/strong>\r\n\r\nYou know you are going to be hungry! Maybe even thirsty. Seattle has a lot of wonderful restaurants and bars to choose from, so go ahead and hit the town:\r\n<blockquote>\u25e6Explore <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/11\/The-Westin-Seattle-Restaurants-within-7-Blocks.pdf\">restaurants within 7 blocks of the Westin Seattle<\/a><\/blockquote>\r\n<blockquote>\u25e6Matt\u2019s in the Market, Fresh seafood, near 1st &amp; Pike<\/blockquote>\r\n<blockquote>\u25e6Pink Door, In Post Alley, near the Pike Place Market<\/blockquote>\r\n<blockquote>\u25e6Purple Cafe and Wine Bar, corner of 4th &amp; University, Call ahead for reservations, California wine country fare<\/blockquote>\r\n<blockquote>\u25e6Fran\u2019s Chocolates, corner of Union &amp; 1st, (on your way to\/from the Pike Place Market), Salted caramels!<\/blockquote>\r\n<blockquote>\u25e6Pike Pub &amp; Brewery, on 1st, just past Union, pub food; beer brewed on site<\/blockquote>\r\n<blockquote>\u25e6Library Bistro, 92 Madison Street<\/blockquote>\r\n<blockquote>\u25e6Cyclops, 2421 First Ave, Belltown<\/blockquote>\r\n<blockquote>\u25e6Baltic Room, 1207 East Pine St, Capitol Hill<\/blockquote>\r\n<blockquote>\u25e6One of Tom Douglas\u2019 many restaurants<\/blockquote>\r\n<blockquote>\u25e6Salumi, 309 3rd Avenue South<\/blockquote>\r\n<blockquote>\u25e6Seattle\u2019s Best Cafe\u2019s (Alon Halevy recommends: Zoka, Vivace, and Allegro, and he really knows coffee)<\/blockquote>\r\n[\/panel]\r\n\r\n[\/accordion]"},{"id":4,"name":"About QIP","content":"[accordion]\r\n[panel header=\"Goal of the conference\"]\r\nThe Conference on Quantum Information Processing (QIP) is an annual conference about quantum computation and information which is usually held around January. Its goal is to represent the preceding year\u2019s best research in the area, in the form of both plenary talks and submitted papers. The conference has no published proceedings, and commonly includes the presentation of work published in proceedings of other conferences or in journals.\r\n[\/panel]\r\n\r\n[panel header=\"Steering committee\"]\r\nThe role of the Steering Committee (SC) is to determine the longer-term course of the conference, to decide upon venues for the next conferences, and to select and invite the plenary speakers for each meeting of the conference. It should also serve as a watchdog and make sure there are no obvious mistakes, e.g., in the choice of time of the conference by the local organizing committee. The SC consists of 9 people, including the local organizers of the previous, next, and subsequent QIPs, and is chaired by the local organizer of the next\/current QIP. Members typically serve for 3 years, with the 3 longest-serving members being replaced once a year, typically soon after QIP. The current SC decides on the replacement of outgoing SC members. The SC chooses the chair of the programme committee (PC) for the next QIP. Starting typically in late summer, the SC invites up to 5 plenary talks which consist of perspective, survey, and\/or experimental talks that would not normally be submitted to the conference program. If there is a tutorial program preceding QIP, then the SC will also invite tutorial speakers, but otherwise leaves the details of the conference programme to the PC.\r\n[\/panel]\r\n\r\n[panel header=\"Program committee\"]\r\nThe role of the Programme Committee (PC) is to select the best submitted papers and to put together a programme for the next QIP. The PC chair chooses the members of the PC (helped by advice from the SC), typically 15 or more people representing the broad range of subfields, including both computer science and physics. The PC chair determines (in cooperation with the SC) the rules for submission and puts out a call for submissions. The selection of talks among the submitted papers is competitive, with typically between 32 and 50 accepted submissions; it is recommended to keep the number of acceptances minimal but the PC has flexibility to accommodate exceptional breadth and quality of submissions in a given year. The PC can designate a few of the best submissions as \u201cplenary\u201d talks, which are assigned more time in the program than regular contributed talks. Poster submissions will generally be accepted unless they are off-topic or clearly wrong, to enable people to obtain funds for travel. At the discretion of the PC, best poster prizes can be awarded.\r\n[\/panel]\r\n\r\n[panel header=\"Typical conference outline\"]\r\nOn the days immediately preceding the conference, tutorials can take place, typically each a half or a full day of lectures on a specific topic, aimed at students. If no or only limited tutorials can be offered, this must be decided by the local organizer in conjunction with the SC. The actual conference takes place from Monday to Friday, with (usually) Wednesday afternoon off for scientific discussions and social excursions. Each morning and afternoon session starts with a 40- to 45-minute plenary talk, followed by contributed talks. Each talk is followed by 5 minutes for questions and for setting up the next talk. The poster session(s), business meeting, and a rump session (optional; for short impromptu presentations of very recent results) are held in late afternoons. The poster session forms an integral part of the QIP conference, and activities such as poster prizes or advertisements for excellent posters are encouraged. Once the conference is over, the website will be hosted on a permanent web server located at ETH Zurich. Some hosting fees (about 1000 CHF) will be required for this service, and should be paid by the organizers. The organizers are also responsible for providing all required web files to ETH Zurich.\r\n[\/panel]\r\n\r\n[panel header=\"Business meeting\"]\r\nAt each QIP there is a business meeting that can be attended by all conference participants, to enable the community to influence the future of QIP democratically. There the organizer for the next QIP gives a presentation, and proposals for the venue of the QIP following the next one are presented and discussed, with an advisory vote taken among the participants. The actual decision about the venue is taken by the SC soon after that. Other organizational matters can also be discussed at the business meeting.\r\n[\/panel]\r\n\r\n[panel header=\"Best student paper\"]\r\nQIP features a prize for the best student submission. A submission is eligible for this prize if and only if the main author(s) is\/are a student(s) at the time of the submission and will present the work at QIP. Furthermore, a significant portion of the work (at least 60%) must have been done by said student(s), including the majority of the key ideas. Eligibility can only be indicated at the time of submission. All authors are notified if their paper has been labelled as eligible for the student prize, and have 14 days following submission to voice any disagreements about the paper\u2019s nomination to the PC chair. The PC chair is free to ask for any clarifications regarding the students\u2019 contributions at any time.\r\n[\/panel]\r\n\r\n[panel header=\"Conflict of interest\"]\r\n<blockquote>1. SC members cannot be plenary speakers, but PC members can be plenary speakers.<\/blockquote>\r\n<blockquote>2. Both SC and PC members are allowed to submit papers and act as paper presenters if a paper submission is accepted. If the PC chair submits a paper, the PC must make sure that the submission is treated exactly the same as any other, particularly regarding the privacy of both reviewers and discussions concerning submissions. One possible approach is to nominate a \u201cVice PC Chair\u201d who can handle the submissions for which the PC chair has a conflict of interest, taking discussions outside the chairing system if required.<\/blockquote>\r\n<blockquote>3. PC members must declare a conflict of interest on certain submissions (such as their own) so that they are not involved in the discussion of these papers.<\/blockquote>\r\n[\/panel]\r\n\r\n[panel header=\"Recent QIP conferences\"]\r\n<a href=\"http:\/\/ucalgary.ca\/qip2016\/\"><strong>QIP 2016<\/strong><\/a> | Banff, Canada\r\n<blockquote>Hosted by the <a href=\"http:\/\/iqst.ca\/\">Institute of Quantum Science and Technology<\/a> at the <a href=\"http:\/\/www.ucalgary.ca\/\">University of Calgary<\/a>.<\/blockquote>\r\n<a href=\"http:\/\/quantum-lab.org\/qip2015\/\"><strong>QIP 2015<\/strong><\/a> | Sydney, Australia\r\n<blockquote>Hosted by <a href=\"http:\/\/www.quantum-lab.org\/\">Quantum Computation Laboratory at Centre<\/a> for Quantum Computation &amp; Intelligent Systems, <a href=\"https:\/\/www.uts.edu.au\/\">University of Technology, Sydney<\/a> (UTS).<\/blockquote>\r\n<a href=\"http:\/\/benasque.org\/2014QIP\/\"><strong>QIP 2014<\/strong><\/a> | Barcelona, Spain\r\n<blockquote>Hosted by the Autonomous <a href=\"http:\/\/benasque.org\/2014QIP\/\">University of Barcelona (UAB)<\/a>, the University of Barcelona (UB) and the Institute for Photonic Sciences (ICFO).<\/blockquote>\r\n[\/panel]\r\n\r\n[panel header=\"QIP conferences since 1998\"]\r\n<blockquote>2013, <a href=\"http:\/\/conference.iiis.tsinghua.edu.cn\/QIP2013\/index.html\">Tsinghua, China<\/a><\/blockquote>\r\n<blockquote>2012, <a href=\"http:\/\/www.iro.umontreal.ca\/~qip2012\/\">IRO Montr\u00e9al, Canada<\/a><\/blockquote>\r\n<blockquote>2011, <a href=\"http:\/\/qip2011.quantumlah.org\/\">CQT, Singapore<\/a><\/blockquote>\r\n<blockquote>2010, <a href=\"http:\/\/www.qip2010.ethz.ch\/index\">ETH Z\u00fcrich, Z\u00fcrich, Switzerland<\/a><\/blockquote>\r\n<blockquote>2009, <a href=\"http:\/\/info.phys.unm.edu\/qip2009\/\">Santa Fe, New Mexico<\/a><\/blockquote>\r\n<blockquote>2008, New Delhi, India<\/blockquote>\r\n<blockquote>2007, Brisbane, Australia<\/blockquote>\r\n<blockquote>2006, <a href=\"http:\/\/www.lri.fr\/qip06\/\">Paris, France<\/a><\/blockquote>\r\n<blockquote>2005, <a href=\"http:\/\/stuff.mit.edu\/afs\/athena\/org\/q\/qip2005\/\">Massachusetts Institute of Technology, Cambridge<\/a><\/blockquote>\r\n<blockquote>2004, <a href=\"http:\/\/qipconference.org\/2004\/\">Perimeter Institute and Institute for Quantum Computing, Waterloo<\/a><\/blockquote>\r\n<blockquote>2003, <a href=\"http:\/\/www.msri.org\/calendar\/workshops\/WorkshopInfo\/204\/show_workshop\">MSRI, Berkeley<\/a><\/blockquote>\r\n<blockquote>2002, IBM, Yorktown Heights<\/blockquote>\r\n<blockquote>2001, <a href=\"http:\/\/homepages.cwi.nl\/~qip\/\">CWI, Amsterdam<\/a><\/blockquote>\r\n<blockquote>2000, <a href=\"http:\/\/www.crm.umontreal.ca\/act\/theme\/1999\/at_1999_12_05_an.html\">CRM, Montr\u00e9al<\/a><\/blockquote>\r\n<blockquote>1999, DePaul, Chicago<\/blockquote>\r\n<blockquote>1998, BRICS, Aarhus<\/blockquote>\r\n[\/panel]\r\n\r\n[\/accordion]"}],"msr_startdate":"2017-01-14","msr_enddate":"2017-01-20","msr_event_time":"","msr_location":"Seattle, WA, USA","msr_event_link":"https:\/\/microsoftqip2017.eventcore.com\/","msr_event_recording_link":"","msr_startdate_formatted":"January 14, 2017","msr_register_text":"Watch now","msr_cta_link":"https:\/\/microsoftqip2017.eventcore.com\/","msr_cta_text":"Watch now","msr_cta_bi_name":"Event Register","featured_image_thumbnail":"<img width=\"960\" height=\"320\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/12\/QIP-hero.jpg\" class=\"img-object-cover\" alt=\"Seattle skyline\" decoding=\"async\" loading=\"lazy\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/12\/QIP-hero.jpg 1200w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/12\/QIP-hero-300x100.jpg 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/12\/QIP-hero-768x256.jpg 768w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/12\/QIP-hero-1024x341.jpg 1024w\" sizes=\"(max-width: 960px) 100vw, 960px\" \/>","event_excerpt":"QIP 2017 will be hosted in Seattle, Washington by the QuArC group at Microsoft Research in Redmond and the University of Washington January 14-20, 2017.","msr_research_lab":[199565],"related-researchers":[{"type":"user_nicename","display_name":"Krysta M. Svore","user_id":32588,"people_section":"Section name 1","alias":"ksvore"}],"msr_impact_theme":[],"related-academic-programs":[],"related-groups":[],"related-projects":[],"related-opportunities":[],"related-publications":[],"related-videos":[],"related-posts":[],"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/314585"}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-event"}],"version-history":[{"count":5,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/314585\/revisions"}],"predecessor-version":[{"id":440799,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/314585\/revisions\/440799"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/427197"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=314585"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=314585"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=314585"},{"taxonomy":"msr-event-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event-type?post=314585"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=314585"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=314585"},{"taxonomy":"msr-program-audience","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-program-audience?post=314585"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=314585"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=314585"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}