首页> 外文会议>IEEE Symposium Series on Computational Intelligence >On Comparison of Some Representations for the Evolution of Quantum Operators
【24h】

On Comparison of Some Representations for the Evolution of Quantum Operators

机译:Quantum运算符演变的一些陈述比较

获取原文

摘要

This paper presents a comparative study regarding the evolutionary design of quantum operators in the form of unitary matrices. Three different techniques allowing the generation of unitary matrices are investigated whose parameters are tuned by means of evolutionary algorithms. Such problem may be considered as a numerical optimisation task because the unitary matrices are represented by complex numbers with real-valued coefficients. Specifically, Genetic Algorithm and Evolution Strategy are applied, each in four different setups, and evaluated on three case studies: the 2-qubit Controlled-NOT gate, 3-qubit entanglement operator and 4-qubit detector of an element with the maximum amplitude. The evolutionary algorithms in combination with the given representation techniques are evaluated in order to determine the abilities of various experimental setups to solve the given tasks. The main contribution is the utilisation of QR decomposition, a technique for generating unitary matrices from theoretically any sequence of complex numbers, that has been applied for the first time in this paper for the evolution of quantum operators. It will be demonstrated that the QR decomposition exhibits a good performance especially in solving more complex quantum operators in comparison with other representations.
机译:本文呈现了酉矩阵形式的量子算子进化设计的比较研究。研究了三种不同的技术,允许生成单一矩阵,其参数通过进化算法进行调整。这样的问题可以被认为是数值优化任务,因为酉矩阵由具有实值系数的复数表示。具体而言,应用遗传算法和演化策略,各自在四种不同的设置中,并在三个案例研究中进行评估:2-Qubit控制 - 非栅极,3个Qubit entancement运算符和具有最大幅度的元件的4 QUB检测器。评估与给定的表示技术的进化算法,以便确定各种实验设置解决给定任务的能力。主要贡献是利用QR分解,一种用于在本文中首次应用的从理论上从理论上产生酉矩阵的技术,这对于量子算子的演变,这是已经应用的。将证明QR分解表现出良好的性能,特别是在与其他表示相比求解更复杂的量子运算符。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号