For those of you local to Seattle, Scott Aaronson, keeper of the complexity zoo, will be giving a talk this Thursday:<\/p>\n
\nEvent: Colloquium, 05\/25\/2006 11:30 am, Gates Commons, CSE 691
\nSpeaker: Scott Aaronson (University of Waterloo)
\nTalk: The Learnability of Quantum States
\nAbstract: Using ideas from computational learning theory, I’ll show
\nthat “for most practical purposes,” one can learn a quantum state
\nusing a number of measurements that grows only linearly with the
\nnumber of qubits n. By contrast, traditional quantum state tomography
\nrequires a number of measurements that grows exponentially with n.
\nI’ll then give two applications of this learning theorem to quantum
\ncomputing: first, the use of trusted classical advice to verify
\nuntrusted quantum advice, and second, a new simulation of quantum
\none-way protocols.
\nEven though there exists an algorithm to “learn” a quantum state after
\na small number of measurements, that algorithm might not be efficient
\ncomputationally. As time permits, I’ll discuss ongoing work on how to
\nexploit that fact to copy-protect and obfuscate quantum software\n<\/p><\/blockquote>\n","protected":false},"excerpt":{"rendered":"
For those of you local to Seattle, Scott Aaronson, keeper of the complexity zoo, will be giving a talk this Thursday: Event: Colloquium, 05\/25\/2006 11:30 am, Gates Commons, CSE 691 Speaker: Scott Aaronson (University of Waterloo) Talk: The Learnability of Quantum States Abstract: Using ideas from computational learning theory, I’ll show that “for most practical … <\/p>\n
Continue reading “A Visitor”<\/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,75],"tags":[],"class_list":["post-1245","post","type-post","status-publish","format-standard","hentry","category-computer-science","category-quantum","category-seattle"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/1245","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=1245"}],"version-history":[{"count":0,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/1245\/revisions"}],"wp:attachment":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/media?parent=1245"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/categories?post=1245"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/tags?post=1245"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}