The Learnability of Quantum States Scott Aaronson量子态的可学习性史葛阿伦森.pptVIP

下载本文档

1
0
约4.85千字
约 14页
2017-03-09 发布于上海
举报
版权申诉

The Learnability of Quantum States Scott Aaronson量子态的可学习性史葛阿伦森.ppt

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

The Learnability of Quantum States Scott Aaronson量子态的可学习性史葛阿伦森

Scott AaronsonMIT BQP PSPACE Closed Timelike Curves Make Quantum and Classical Computing Equivalent John WatrousU. Waterloo Uh-oh … here goes Scott with another loony talk about time travel or some such … distracting everyone from the serious stuff like quantum multi-prover interactive proof systems... If you don’t like time travel, then this talk is about a new algorithm for implicitly computing fixed points of superoperators in polynomial space. But really … you don’t like time travel?! Everyone’s first idea for a time travel computer: Do an arbitrarily long computation, then send the answer back in time to before you started THIS DOES NOT WORK Why not? Ignores the Grandfather Paradox Doesn’t take into account the computation you’ll have to do after getting the answer Deutsch’s Model A closed timelike curve (CTC) is simply a resource that, given an operation f:{0,1}n?{0,1}n acting in some region of spacetime, finds a fixed point of f—that is, an x such that f(x)=x Of course, not every f has a fixed point—that’s the Grandfather Paradox! But since every Markov chain has a stationary distribution, there’s always a distribution D s.t. f(D)=D Probabilistic Resolution of the Grandfather Paradox- You’re born with ? probability- If you’re born, you back and kill your grandfather- Hence you’re born with ? probability CTC Computation R CTC R CR C 0 0 0 Answer “Causality-Respecting Register” “Closed Timelike Curve Register” Polynomial Size Circuit PCTC is the class of decision problems solvable in this model You (the “user”) pick a uniform poly-size circuit C on two registers, RCTC and RCR, as well as an input to RCR. Let C’ be the induced operation on RCTC. Then Nature is forced to find a probability distribution D over states of RCTC such that C’(D)=D. (If there’s more than one such D, Nature chooses one adversarially.) Then given a sample from D in RCTC, you read the final output off from RCR. Theorem: PCTC = PSPACE Proof: For PCTC ? PSPACE, just need to find som