{"id":1659,"date":"2007-10-30T15:45:06","date_gmt":"2007-10-30T22:45:06","guid":{"rendered":"http:\/\/dabacon.org\/pontiff\/?p=1659"},"modified":"2007-10-30T15:45:06","modified_gmt":"2007-10-30T22:45:06","slug":"qip-2008-talks","status":"publish","type":"post","link":"https:\/\/dabacon.org\/pontiff\/2007\/10\/30\/qip-2008-talks\/","title":{"rendered":"QIP 2008 Talks"},"content":{"rendered":"<p>The list of contributed talks for QIP 2008 is now available:<\/p>\n<blockquote><p>\n<b>Invited talks<\/b><br \/>\nDorit Aharonov, Hebrew University<br \/>\nAndris Ambainis, University of Waterloo and University of Latvia<br \/>\nAvraham Ben-Aroya, Tel-Aviv university<br \/>\nPatrick Hayden, McGill University<br \/>\nOded Regev, Tel-Aviv University<br \/>\nBen Reichardt, California Institute of Technology<br \/>\nRenato Renner, Cambridge<br \/>\nFalk Unger, CWI, Amsterdam<br \/>\nMichael Wolf, Max-Planck-Institute for Quantumoptics, Garching<br \/>\n<b>Contributed talks<\/b><br \/>\n<em>30-minute talks<\/em><br \/>\nOded Regev and Ben Toner. Simulating Quantum Correlations with Finite Communication.<br \/>\nGraeme Smith. The private classical capacity with a symmetric side channel<br \/>\nJulia Kempe, Hirotada Kobayashi, Keiji Matsumoto and Thomas Vidick. Using Entanglement in Quantum Multi-Prover Interactive Proofs<br \/>\nGabor Ivanyos, Luc Sanselme and Miklos Santha. An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups<br \/>\nAndrew Cross, Graeme Smith, John Smolin and Bei Zeng. Codeword Stabilized Quantum Codes<br \/>\nToby Cubitt, Aram Harrow, Debbie Leung, Ashley Montanaro and Andreas Winter. Counterexamples to additivity of minimum output p-Renyi entropy for p close to 0<br \/>\nNikhil Bansal, Sergey Bravyi and Barbara Terhal. Classical approximation schemes for the ground-state energy of quantum and classical Ising spin glasses on planar graphs<br \/>\nSimon-Pierre Desrosiers and Frederic Dupuis. Quantum entropic security and approximate quantum encryption<br \/>\nJulia Kempe, Oded Regev and Ben Toner. The Unique Games Conjecture with Entangled Provers is False<br \/>\nGilles Brassard, Anne Broadbent, Joseph Fitzsimons, Sebastien Gambs and Alain Tapp Anonymous quantum communication<br \/>\n<em>20-minute talks<\/em><br \/>\nIvan Damgaard, Serge Fehr, Louis Salvail and Christian Schaffner. Secure Identification and QKD in the Bounded-Quantum-Storage Model<br \/>\nJean Christian Boileau, Lana Sheridan, Martin Laforest and Stephen Bartlett. Quantum Reference Frames and the Classification of Rotationally-Invariant Maps<br \/>\nIvan Damgaard, Serge Fehr, Renato Renner, Louis Salvail and Christian Schaffner. A Tight High-Order Entropic Quantum Uncertainty Relation With Applications<br \/>\nStefano Pironio, Antonio Acin, Nicolas Brunner, Nicolas Gisin, Serge Massar and Valerio Scarani. Device-independent security of Quantum Key Distribution<br \/>\nStephanie Wehner and Andreas Winter. Higher entropic uncertainty relations for anti-commuting observables<br \/>\nStefano Pironio, Miguel Navascues and Antonio Acin. Quantum probabilities, semidefinite programming, and optimization over Hilbert spaces<br \/>\nZhengfeng Ji, Jianxin Chen, Zhaohui Wei and Mingsheng Ying. The LU-LC conjecture is false<br \/>\nScott Aaronson. Quantum Copy-Protection<br \/>\nJulia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner and Thomas Vidick. On the Power of Entangled Provers: Immunizing games against entanglement<br \/>\nDaniel E. Browne, Elham Kashefi, Mehdi Mhalla and Simon Perdrix. Determinism in Measurement based quantum computation<br \/>\nDan Browne, Matthew Elliot, Steven Flammia, Seth Merkel, Akimasa Miyake and Anthony Short. Phase transition of computational power in the resource states for one-way quantum computation<br \/>\nAram Harrow. Quantum expanders from any classical Cayley graph expander<br \/>\nTsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun and Andrew C.-C. Yao. Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-Prover Interactive Proof Systems<br \/>\nKeiji Matsumoto. Self-teleportation and its application on LOCC estimation and other tasks<br \/>\nKazuo Iwama, Harumichi Nishimura, Rudy Raymond and Shigeru Yamashita. Unbounded-Error Classical and Quantum Communication Complexity<br \/>\nRobert Koenig and Renato Renner. Sampling of min-entropy relative to quantum knowledge<br \/>\nMatthias Christandl and Ben Toner. De Finetti theorems for finitely exchangeable conditional probability=20 distributions<br \/>\nYi Zhao, Fred Fung, Bing Qi, Christine Chen and Hoi-Kwong Lo. Quantum hacking: experimental demonstration of time-shift attack<br \/>\nJulien Degorre, Marc Kaplan, Sophie Laplante and Jeremie Roland. The complexity of simulating non-signaling distributions<br \/>\nJonathan Walgate and Andrew Scott. Completely Entangled Random Subspaces\n<\/p><\/blockquote>\n","protected":false},"excerpt":{"rendered":"<p>The list of contributed talks for QIP 2008 is now available: Invited talks Dorit Aharonov, Hebrew University Andris Ambainis, University of Waterloo and University of Latvia Avraham Ben-Aroya, Tel-Aviv university Patrick Hayden, McGill University Oded Regev, Tel-Aviv University Ben Reichardt, California Institute of Technology Renato Renner, Cambridge Falk Unger, CWI, Amsterdam Michael Wolf, Max-Planck-Institute for &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/dabacon.org\/pontiff\/2007\/10\/30\/qip-2008-talks\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;QIP 2008 Talks&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[20,63],"tags":[],"class_list":["post-1659","post","type-post","status-publish","format-standard","hentry","category-computer-science","category-quantum"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/1659","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/comments?post=1659"}],"version-history":[{"count":0,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/1659\/revisions"}],"wp:attachment":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/media?parent=1659"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/categories?post=1659"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/tags?post=1659"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}