Quantum Certificate Complexity Scott Aaronson量子复杂性证书史葛阿伦森.pptVIP

Quantum Certificate Complexity Scott Aaronson量子复杂性证书史葛阿伦森.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Quantum Certificate Complexity Scott Aaronson量子复杂性证书史葛阿伦森

Lower Bounds for Local Search by Quantum Arguments Scott Aaronson (UC Berkeley) /~aaronson August 14, 2003 Quantum Background Needed for This Talk Outline Problem: Find a local minimum of a function using as few function evaluations (queries) as possible Relational adversary method: A quantum method for proving quantum and classical lower bounds on query complexity (only other example: Kerenidis and de Wolf 2003) Applying the method to LOCAL SEARCH Open problems The LOCAL SEARCH Problem Given: undirected connected graph G=(V,E) and function Task: Find a v?V such that for all neighbors w of v Motivation Why do local search algorithms work so well in practice? Conventional wisdom: Because finding a local optimum is intrinsically not that hard We show this is false—even for quantum computers Raises a question: Why do exponentially long chains of descending values, as used for lower bounds, almost never occur in “real-world” problems? Motivation #2 Quantum adiabatic algorithm (Farhi et al.): Quantum analogue of simulated annealing Can sometimes “tunnel” through barriers to reach global instead of local optima Further strange feature: For function f(x)=|x| on Boolean hypercube {0,1}n, finds minimum 0n in O(1) queries, instead of O(n) classically We give first example where adiabatic algorithm is provably only polynomially faster than simulated annealing at finding local optima Motivation #3 Megiddo and Papadimitriou defined a complexity class TFNP, of NP search problems for which we know a solution exists Example: Given a circuit that maps {0,1}n to {0,1}n-1, find two inputs that map to same output Papadimitriou: Are TFNP problems good candidates for fast quantum algorithms? My answer: Probably not Collision lower bound (A 2002): PPP ? FBQP relative to an oracle (PPP = Polynomial Pigeonhole Principle, FBQP = Function Bounded-Error Quantum Polytime) This work: PLS ? FBQP relative to an oracle (PLS = Polynomial Local Search) Deterministic Query Complexity of LOCAL SEA

您可能关注的文档

文档评论(0)

118books + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档