全部版块 我的主页
论坛 经济学人 二区 外文文献专区
494 0
2022-03-08
摘要翻译:
实验证明,用高根逻辑实现通用量子门在实际和技术上是可能的。我们提出了一种并行遗传算法,该算法在具有不同根的qudits上合成了由各种量子门实现的布尔可逆电路。为了能够在高基数量子空间中合成中等尺寸的电路,我们使用GPU加速遗传算法进行了实验。利用加速遗传算法,我们比较了启发式改进和基于代价最小化的变异过程,以及Baldwinian遗传算法和Lamarckian遗传算法对基元的自适应代价和改进。我们还描述了各种适应度函数公式,这些适应度函数公式允许众所周知的通用布尔、可逆或量子概率电路的各种实现。
---
英文标题:
《Evolutionary Quantum Logic Synthesis of Boolean Reversible Logic
  Circuits Embedded in Ternary Quantum Space using Heuristics》
---
作者:
Maarti nLukac, Marek Perkowski, Michitaka Kameyama
---
最新提交年份:
2011
---
分类信息:

一级分类:Physics        物理学
二级分类:Quantum Physics        量子物理学
分类描述:Description coming soon
描述即将到来
--
一级分类:Computer Science        计算机科学
二级分类:Artificial Intelligence        人工智能
分类描述:Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域,除了视觉、机器人、机器学习、多智能体系统以及计算和语言(自然语言处理),这些领域有独立的学科领域。特别地,包括专家系统,定理证明(尽管这可能与计算机科学中的逻辑重叠),知识表示,规划,和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要:
  It has been experimentally proven that realizing universal quantum gates using higher-radices logic is practically and technologically possible. We developed a Parallel Genetic Algorithm that synthesizes Boolean reversible circuits realized with a variety of quantum gates on qudits with various radices. In order to allow synthesizing circuits of medium sizes in the higher radix quantum space we performed the experiments using a GPU accelerated Genetic Algorithm. Using the accelerated GA we compare heuristic improvements to the mutation process based on cost minimization, on the adaptive cost of the primitives and improvements due to Baldwinian vs. Lamarckian GA. We also describe various fitness function formulations that allowed for various realizations of well known universal Boolean reversible or quantum-probabilistic circuits.
---
PDF链接:
https://arxiv.org/pdf/1107.3383
二维码

扫码加我 拉你入群

请注明:姓名-公司-职位

以便审核进群资格,未注明则拒绝

相关推荐
栏目导航
热门文章
推荐文章

说点什么

分享

扫码加好友,拉您进群
各岗位、行业、专业交流群