首页> 外文学位 >From non-Abelian anyons to quantum computation to coin-flipping by telephone.
【24h】

From non-Abelian anyons to quantum computation to coin-flipping by telephone.

机译:从非阿贝尔正则到量子计算再到电话掷硬币。

获取原文
获取原文并翻译 | 示例

摘要

Following their divorce, Alice and Bob would like to split some of their possessions by flipping a coin. Unwilling to meet in person, and without a trusted third party, they must figure out a scheme to flip the coin over a telephone that guarantees that neither party can cheat.; The preceding scenario is the traditional definition of two-party coin-flipping. In a classical setting, without limits on the available computational power, one player can always guarantee a coin-flipping victory by cheating. However, by employing quantum communication it is possible to guarantee, with only information-theoretic assumptions, that neither party can win by cheating, with a probability greater than two thirds. Along with the description of such a protocol, this thesis derives a tight lower bound on the bias for a large family of quantum weak coin-flipping protocols, proving such a protocol optimal within the family. The protocol described herein is an improvement and generalization of one examined by Spekkens and Rudolph. The key steps of the analysis involve Kitaev's description of quantum coin-flipping as a semidefinite program whose dual problem provides a certificate that upper bounds the amount of cheating for each party.; In order for such quantum protocols to be viable, though, a number of practical obstacles involving the communication and processing of quantum information must be resolved. In the second half of this thesis, a scheme for processing quantum information is presented, which uses non-abelian anyons that are the magnetic and electric excitations of a discrete-group quantum gauge theory. In particular, the connections between group structure and computational power are examined, generalizing previous work by Kitaev, Ogburn and Preskill. Anyon based computation has the advantage of being topological, which exponentially suppresses the rate of decoherence and the errors associated with the elementary quantum gates. Though no physical systems with such excitations are currently known to exist, it remains an exciting open possibility that such particles could be either engineered or discovered in exotic two-dimensional systems.
机译:离婚后,爱丽丝和鲍勃想通过掷硬币来分割一部分财产。他们不愿亲自见面,并且没有可信赖的第三方,他们必须想出一种通过电话翻转硬币的方案,以保证任何一方都不会作弊。前面的场景是两方硬币翻转的传统定义。在经典环境中,在不受可用计算能力限制的情况下,一个玩家始终可以通过作弊来保证掷硬币的胜利。但是,通过采用量子通信,仅通过信息理论上的假设就可以保证任何一方都不会通过欺骗而获胜,概率大于三分之二。除了对这种协议的描述之外,本论文还针对较大的量子弱硬币翻转协议系列推导了偏差的严格下界,证明了该协议在该系列中是最佳的。本文描述的协议是Spekkens和Rudolph所研究协议的改进和概括。分析的关键步骤包括Kitaev将量子硬币翻转描述为一个半定程序,该程序的双重问题提供了一个证书,证明了各方的作弊量上限。但是,为了使这种量子协议可行,必须解决涉及量子信息的通信和处理的许多实际障碍。在论文的后半部分,提出了一种处理量子信息的方案,该方案使用了非阿贝尔质子(non-abelian anyon),这是离散群量子规范理论的磁和电激发。特别是,考察了基塔耶夫(Kataev),奥格本(Ogburn)和普雷斯基尔(Preskill)的先前工作,对组结构和计算能力之间的联系进行了检查。基于Anyon的计算具有拓扑优势,它以指数形式抑制了退相干率和与基本量子门相关的误差。尽管目前尚不存在具有此类激发的物理系统,但仍存在令人兴奋的开放可能性,即可以在特殊的二维系统中对此类粒子进行工程化或发现。

著录项

  • 作者

    Mochon, Carlos.;

  • 作者单位

    California Institute of Technology.;

  • 授予单位 California Institute of Technology.;
  • 学科 Physics Elementary Particles and High Energy.
  • 学位 Ph.D.
  • 年度 2005
  • 页码 165 p.
  • 总页数 165
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 高能物理学;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号