{"id":2187,"date":"2009-01-16T11:38:25","date_gmt":"2009-01-16T18:38:25","guid":{"rendered":"http:\/\/dabacon.org\/pontiff\/?p=2187"},"modified":"2009-01-16T11:38:25","modified_gmt":"2009-01-16T18:38:25","slug":"qip-2009-day-5-liveblogging","status":"publish","type":"post","link":"https:\/\/dabacon.org\/pontiff\/2009\/01\/16\/qip-2009-day-5-liveblogging\/","title":{"rendered":"QIP 2009 Day 5 Liveblogging"},"content":{"rendered":"

The last day of QIP in Santa Fe. Also note that Joe has posted some nice notes on additivity on his blog: part I<\/a> and part II<\/a>. Oh, and QIP next year will be in Zurich, and QIP the year after next will be in Singapore.<\/p>\n

computing, conference, quantum<\/div>\n

<\/p>\n

Lluis Masanes, “Towards device-independent security in QKD”<\/h3>\n

Paper: arXiv:0807.2158<\/a>. I cam in late, so was a bit lost. But basically Lluis talked about secret key distillation under weaker assumptions than just assuming quantum theory. It seems that one an do secret key distillation from accessing the correlations that violate Bell inequalities under the assumption of no signaling.<\/p>\n

Amnon Ta-Shma, “Short seed extractors against quantum storage”<\/h3>\n

Amnon talked about the paper arXiv:0808.1994<\/a>.<\/p>\n

Jop Briet (speaker), Harry Buhrman, and Ben Toner, “A generalized Grothendieck inequality and entanglement in XOR games”<\/h3>\n

Dude I need LaTeX support in scienceblogs. Jop talked about a new Grothendieck’s type inequality (see the paper arXiv:0901.2009<\/a> for the definition.) This can then be used to show that the amount of entanglement required to maximally violate a Bell inequality must depend on the number of measurements (not just the number of measurement outcomes.)<\/p>\n

Dejan Dukaric, Manuel Forster, Severin Winkler, and Stefan Wolf , “On non-locality distillation”<\/h3>\n

At this point my brain was full.<\/p>\n

Gilles Brassard, Louis Salvail, and Alain Tapp, “Key distribution and oblivious transfer \u00e0 la Merkle”<\/h3>\n

Robert K\u00f6nig, Renato Renner, and Christian Schaffner, “The operational meaning of min- and max-entropy”<\/h3>\n

Matthias Christandl, Dejan Dukaric, Robert K\u00f6nig, and Renato Renner, “Postselection-technique with applications to quantum cryptography and the parallel repetition problem”<\/h3>\n

Robert K\u00f6nig (speaker), Ben Reichardt, and Guifre Vidal, “Exact entanglement renormalization for string-net models”<\/h3>\n

Here Robert described his work on Levin and Wen’s string net models. The main result is that the Levin and Wen models can be thought about as arising from the requirement of scale invariant. In particular they show how these models have ground states which are efficiently describable by multi-scale entanglement renormalization ansatz states. Paper here: arXiv:0806.4583<\/a>. I like this paper a lot.<\/p>\n

Aram Harrow and Richard Low (speaker), “Efficient quantum tensor product expanders and k-designs”<\/h3>\n

It would be nice to efficiently implement random unitaries sampled uniformly with respect to Haar measure. This is hard. However often we want to construct methods for sampling random unitaries which give things like random unitaries. Here they talk about the case where one wants to sample with respect to Haar measure which matches the first k moments of the Haar measure (a k-design). Aram and Richard present ways to do this efficiently by efficiently constructing a “k-copy tensor product expander.” Paper: arXiv:0811.2597<\/a>.<\/p>\n

Bill Rosgen, “Distinguishability of random unitary channels”<\/h3>\n","protected":false},"excerpt":{"rendered":"

The last day of QIP in Santa Fe. Also note that Joe has posted some nice notes on additivity on his blog: part I and part II. Oh, and QIP next year will be in Zurich, and QIP the year after next will be in Singapore. computing, conference, quantum<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","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":[40,65],"tags":[],"class_list":["post-2187","post","type-post","status-publish","format-standard","hentry","category-liveblogging","category-quantum-computing"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/2187","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=2187"}],"version-history":[{"count":0,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/2187\/revisions"}],"wp:attachment":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/media?parent=2187"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/categories?post=2187"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/tags?post=2187"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}