首页> 外文会议>Emerging Technologies in Security and Defence II; and Quantum-Physics-based Information Security III >Programming Non-Trivial Algorithms in the Measurement Based Quantum Computation Model
【24h】

Programming Non-Trivial Algorithms in the Measurement Based Quantum Computation Model

机译:基于测量的量子计算模型中的非小数算法编程

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

摘要

We provide a set of prescriptions for implementing a quantum circuit model algorithm as measurement based quantum computing (MBQC) algorithm via a large cluster state. As means of illustration we draw upon our numerical modeling experience to describe a large graph state capable of searching a logical 8 element list (a non-trivial version of Grover's algorithm with feedforward). We develop several prescriptions based on analytic evaluation of cluster states and graph state equations which can be generalized into any circuit model operations. Such a resulting cluster state will be able to carry out the desired operation with appropriate measurements and feed forward error correction. We also discuss the physical implementation and the analysis of the principal 3-qubit entangling gate (Toffoli) required for a non-trivial feedforward realization of an 8-element Grover search algorithm.
机译:我们提供了一组通过大型簇状态将量子电路模型算法实现为基于测量的量子计算(MBQC)算法的规定。作为说明,我们利用我们的数值建模经验来描述能够搜索逻辑8元素列表(具有前馈功能的Grover算法的非平凡版本)的大型图形状态。我们基于对簇状态和图状态方程的分析评估,开发了几种处方,可以将其推广到任何电路模型操作中。这样产生的簇状态将能够通过适当的测量和前馈误差校正来执行期望的操作。我们还将讨论8元素格罗弗搜索算法的非平凡前馈实现所需的主要3量子位纠缠门(Toffoli)的物理实现和分析。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号