量子计算模拟及优化方法综述

在处理某些大规模并行问题时,量子计算因量子位独特的叠加态和纠缠态特性,相比经典计算机在并行处理方面具有更明显的优势。现阶段,物理量子比特计算机受限于可扩展性、相干时间和量子门操作精度,在经典计算机上开展量子计算模拟成为研究量子优越性和量子算法的有效途径。然而,随着量子比特数的增加,模拟所需的计算机资源呈指数增长。因此,研究大规模量子计算模拟在保证计算准确度、精度及效率的情况下减少模拟所需资源具有重要意义。从量子比特、量子门、量子线路、量子操作系统等方面展开,阐述量子计算的基本原理和背景知识。同时总结基于经典计算机的量子计算模拟基本方法,分析不同方法的设计思路和优缺点,列举目前常见的量子计算模拟器。在此基础上,针对量子计算模拟的通信开销问题,从节点拆分和通信优化2个方面出发,讨论基于超级计算机集群的量子计算模拟优化方法。     

量子计算

近几年来,量子计算机逐渐引起人们的关注。对于计算机科技人员,量子计算机似乎高深莫测。文章是专门为那些不懂量子力学而又想了解量子计算机的计算机工作者撰写的。介绍了和量子计算有关的术语和符号,并着重阐明一个n位量子寄存器为何能存储2^n个n位数？量子计算机的一次操作为何能计算所有x的f(x)？对于解栽些问题,量子计算机为何能有惊人的运算速度？除了上面3个问题外,还将介绍基本的量子逻辑门和量子逻辑网络,接着介绍一个量子算法,然后介绍量子计算机的组织结构,最后是讨论,将评价量子计算机的优势和弱点,并讨论量子计算机的物理实现和对量子计算的展望。     

量子计算与量子计算机

量子计算是一种依照量子力学理论进行的新型计算,量子计算的基础和原理以及重要量子算法为在计算速度上超越图灵机模型提供了可能。在发展与完善量子计算理论的同时,量子计算机的物理实现方案也被不断提出。光子量子计算机,基于核磁共振、离子阱或谐振子等技术的量子计算机物理模型已被逐一实现。近年来亦出现了几个典型的基于量子计算机的量子算法。2001年在一台基于核磁共振技术的量子计算设备上成功演示的Shor量子算法,显示出量子计算机处理复杂问题的巨大潜能。文章对当前量子计算机物理实现的研究进展进行了综述。     

Ground-0 Axioms vs. First Principles and Second Law: From the Geometry of Light and Logic of Photon to Mind-Light-Matter Unity-AI&QI

Without the geometry of light and logic of photon, observer-observability forms a paradox in modern science, truth-equilibrium finds no unification, and mind-light-matter unity is unreachable in spacetime. Subsequently, quantum mechanics has been shrouded with mysteries preventing itself from reaching definable causality for a general purpose analytical quantum computing paradigm. Ground-0 Axioms are introduced as an equilibrium-based, dynamic, bipolar set-theoretic unification of the first principles of science and the second law of thermodynamics. Related literatures are critically reviewed to justify the self-evident nature of Ground-0 Axioms. A historical misinterpretation by the founding fathers of quantum mechanics is identified and corrected. That disproves spacetime geometries (including but not limited to Euclidean and Hilbert spaces) as the geometries of light and truth-based logics (including but not limited to bra-ket quantum logic) as the logics of photon. Backed with logically definable causality and Dirac 3-polarizer experiment, bipolar quantum geometry (BQG) and bipolar dynamic logic (BDL) are identified as the geometry of light and the logic of photon, respectively, and wave-particle complementarity is shown less fundamental than bipolar complementarity. As a result, Ground-0 Axioms lead to a geometrical and logical illumination of the quantum and classical worlds as well as the physical and mental worlds. With logical resolutions to the EPR and Schr?dinger’s cat paradoxes, an analytical quantum computing paradigm named quantum intelligence (QI) is introduced. It is shown that QI makes mind-light-matter unity and quantum-digital compatibility logically reachable for quantum-neuro-fuzzy AI-machinery with groundbreaking applications. It is contended that Ground-0 Axioms open a new era of science and philosophy—the era of mind-light-matter unity in which human-level white-box AI&QI is logically prompted to join Einstein’s grand unification to foster major scientific advances.      

一种综合可计算情感建模方法

情感作为人类具有智能的一个重要体现,是创建可信服的虚拟智能体不可或缺的环节.如何通过情感来提高虚拟智能体的智能性和可信服性已成为亟待解决的关键问题.结合生理和认知对情感的影响,提出了一种综合的可计算情感建模方法;设计了一个完全的过程框架,以描述情感在不同时刻如何动态变化以及如何处理多种混合情感的情况;并建立了基于具体描述事件和情感关系的情感结构,以产生具体、真实的情感行为;提出了交互学习机制以增强虚拟智能体对动态环境的适应能力.实例验证表明,此情感模型能有效地增加虚拟智能体在交互过程中的可信服性.     

量子计算系统软件研究综述

量子计算理论上有望解决诸多经典难解问题, 近年来量子计算机的快速发展正推动这一理论进入实践. 然而, 当前硬件中繁多的错误会造成计算结果出错, 严重限制了量子计算机解决实际问题的能力. 量子计算系统软件位于应用与硬件之间, 充分挖掘系统软件在硬件错误减缓方面的潜力, 对于近期实现有实用价值的量子计算而言至关重要. 由此, 近期涌现了一批量子计算系统软件研究工作. 将这些工作归纳入编译器、运行时系统和调试器3个范畴, 通过对它们的分析总结, 梳理量子计算系统软件的研究现状, 揭示其在硬件错误减缓方面的重要作用. 并对未来的研究方向进行展望.     

量子计算机:量子算法与物理实现

量子算法与物理实现是量子计算机研究中的两个基本问题。本文首先总结了相关领域的主要进展,并讨论了有代表性的量子算法,特别介绍了用于求解线性方程组的量子算法,分析了影响新量子算法提出的因素。然后,探讨了物理实现的迪文森佐判据,并介绍了典型的实现方案及性能比较。同时,也关注了对量子计算机研究持有异议的观点。最后,对量子计算机的新研究方向作了探讨。     

How to build a device that cannot be built

In this paper, we show how the GHZ paradox can be used to design a computing device that cannot be physically implemented within the context of classical physics, but nonetheless can be within quantum physics, i.e., in a quantum physics laboratory. This example gives an illustration of the many subtleties involved in the quantum control of distributed quantum systems. We also show how the second elementary symmetric Boolean function can be interpreted as a quantification of the nonlocality and indeterminism involved in the GHZ paradox.     

基于量子逻辑的图灵机及其通用性

基于量子逻辑的自动机理论是量子计算模型的一个重要研究方向.该文研究了基于量子逻辑的图灵机(简称量子图灵机)及其一些变形,给出了包括非确定型量子图灵机l-VTM,确定型量子图灵机l-VDTM以及相应类型的多带量子图灵机,并引入量子图灵机基于深度优先与宽度优先识别语言的两种不同定义方式,证明了这两种定义方式在量子逻辑意义下是不等价的.进一步证明了l-VTM、l-VDTM与相应类型的多带量子图灵机之间的等价性.其次,给出了量子递归可枚举语言及量子递归语言的定义,并给出了二者的层次刻画,证明了l-VTM与l-VDTM不等价,但两者作为量子递归语言的识别器是等价的.最后,文中讨论了基于量子逻辑的通用图灵机的存在性问题,给出了一套合理编码系统,证明了基于量子逻辑的通用图灵机在其所取值的正交模格无限时不存在,而在其所取值的正交模格有限时是存在的.     

Universality and programmability of quantum computers

Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits. The problem of universality has been addressed most famously in a paper by Deutsch, and later by Bernstein and Vazirani as well as Kitaev and Solovay. The quantum logic circuit model, developed by Feynman and Deutsch, has been more prominent in the research literature than Deutsch’s quantum Turing machines. Quantum Turing machines form a class closely related to deterministic and probabilistic Turing machines and one might hope to find a universal machine in this class. A universal machine is the basis of a notion of programmability. The extent to which universality has in fact been established by the pioneers in the field is examined and this key notion in theoretical computer science is scrutinised in quantum computing by distinguishing various connotations and concomitant results and problems.     

量子群智能优化算法综述

随着科学技术的不断发展,最优化理论及其衍生出的算法已经广泛应用于人们的日常工作与生活当中,现实世界中的很多问题都可以被描述为组合优化问题。群智能优化算法这些年来被证明在解决组合优化问题方面效果显著,将当下处于研究热点的量子计算概念引入群智能优化算法形成的量子群智能优化算法,为更好地解决组合优化问题提出了一个新的研究方向。在过去的二十多年里,许多量子群智能优化算法被不断开发出来,同时在此基础上进行了大量改进与应用。综述了量子蚁群算法、量子粒子群算法、量子人工鱼群算法、量子人工蜂群算法、量子布谷鸟搜索算法、量子混合蛙跳算法、量子萤火虫算法、量子蝙蝠算法等量子群智能优化算法,并对量子群智能优化算法面临的问题以及未来研究方向进行了深入探讨。     

量子搜索及量子智能优化研究进展

为了提高智能优化算法的收敛速度及优化性能,目前国内外将量子计算机制和传统智能优化相融合,研究和提出了多种量子进化算法及量子群智能优化算法;为了进一步推动该领域的研究进展,系统地介绍了国内外提出的多种量子搜索及量子智能优化算法,其中包括量子搜索、量子衍生进化、量子神经网络三个方面内容;总结出目前改进量子搜索算法的主要机制和量子计算与传统智能计算的主要融合方式,并展望了量子搜索和量子智能优化有待进一步研究和需要解决的问题。     

Topological-Like Features in Diagrammatical Quantum Circuits

In this paper, we revisit topological-like features in the extended Temperley–Lieb diagrammatical representation for quantum circuits including the teleportation, dense coding and entanglement swapping. We describe these quantum circuits and derive characteristic equations for them with the help of topological-like operations. Furthermore, we comment on known diagrammatical approaches to quantum information phenomena from the perspectives of both tensor categories and topological quantum field theories. Moreover, we remark on the proposal for categorical quantum physics and information as described by dagger ribbon categories. The main results in this paper had been presented at the workshop “Cats, Kets and Cloisters” (Computing Laboratory, Oxford University, July 17–23, 2006). Categorical quantum physics and information is proposed as described by dagger ribbon categories. The functor between Abramsky and Coecke’s categorical quantum mechanics and the extended Temperley–Lieb categorical approach is recognized as the same type as those defining topological quantum field theories. On the one hand, fundamental objects in the physical world may be string-like (even brane-like) and satisfy the braid statistics. On the other hand, fundamental particles at the Planck energy scale (or quasi-particles of many-body systems) may obey the braid statistics and have an effective (or a new internal) degree of freedom called the “twist spin”. The name “categorical quantum physics and information” hereby refers to quantum physics and information which can be recast in terms of the language of categories. This is a simple and intuitional generalization of the name “categorical quantum mechanics”. The latter does not yet recognize conformal field theories, topological quantum field theories, quantum gravity and string theories which have been already described in the categorical framework by different research groups. Besides, the proposal categorical quantum physics and information is strongly motivated by the present study in quantum information phenomena and theory. It is aimed at setting up a theoretical platform on which both categorical quantum mechanics and topological quantum computing by Freedman, Larsen and Wang are allowed to stand.     

Cofields: a physically inspired approach to motion coordination

As computing becomes increasingly pervasive, autonomous computers are going to be embedded in everyday objects in our physical environment. In such scenarios, mobility itself will be pervasive. Mobile users, mobile devices, computer-enabled vehicles, and mobile software components will define a dynamic, networked world in which a large set of autonomous components will interact with each other to orchestrate their activities. We focus on the problem of coordinating autonomous agent's movements in a distributed environment. Orchestrating mobile autonomous agents can take inspiration from the laws of physics. Agent's movements could be driven by locally perceived computational force fields, or cofields, generated by the agents themselves and propagated through an embedded infrastructure.     

基于纠缠的量子密钥分配协议仿真

由于受物理资源和实验条件的限制,在经典计算机上对量子密钥分配（QKD）仿真,为研究者提供一种手段以便更好地掌握这类抽象协议。对以纠缠态为基础的E91协议的量子密钥分配过程进行仿真,重点对比分析了理想环境、有噪环境以及窃听环境下的仿真结果,并验证该量子密钥分配协议的安全性。     

面向情境的移动应用研发

移动网络的出现极大推进普适计算发展,智能设备成为生活、工作不可缺少的部分,形成个体随时、随地在线状态,显具身和情境性,形成应用研发新环境,为软件设计理论、方法、技术等层面创新提供条件。基于被誉为认知科学二次革命的具身、分布认知等新思想,情境、认知将成为移动应用创新切入点,为情境矢量化,认知大数据处理提供理论;移动情境是Agent生存数字空间,其设计思想、方法、矢量化技术直接关系到服务品质。以物流行业移动应用为例,阐述物流情境矢量化架构,认知动力系统结构。     

基于参数化量子电路的量子卷积神经网络模型及应用

量子神经网络结合了量子计算与经典神经网络模型的各自优势, 为人工智能领域的未来发展提供了一种 全新的思路. 本文提出一种基于参数化量子电路的量子卷积神经网络模型, 能够针对欧几里得结构数据与非欧几里 得结构数据, 利用量子系统的计算优势加速经典机器学习任务. 在MNIST数据集上的数值仿真结果表明, 该模型具 有较强的学习能力和良好的泛化性能.     

Augmented reality agents for user interface adaptation

Most augmented reality (AR) applications are primarily concerned with letting a user browse a 3D virtual world registered with the real world. More advanced AR interfaces let the user interact with the mixed environment, but the virtual part is typically rather finite and deterministic. In contrast, autonomous behavior is often desirable in ubiquitous computing (Ubicomp), which requires the computers embedded into the environment to adapt to context and situation without explicit user intervention. We present an AR framework that is enhanced by typical Ubicomp features by dynamically and proactively exploiting previously unknown applications and hardware devices, and adapting the appearance of the user interface to persistently stored and accumulated user preferences. Our framework explores proactive computing, multi‐user interface adaptation, and user interface migration. We employ mobile and autonomous agents embodied by real and virtual objects as an interface and interaction metaphor, where agent bodies are able to opportunistically migrate between multiple AR applications and computing platforms to best match the needs of the current application context. We present two pilot applications to illustrate design concepts. Copyright © 2007 John Wiley & Sons, Ltd.     

基于LOBA逻辑的言语行为表示

言语行为是多主体系统中一个有趣而重要的问题.该文从实际推理主体(practical reasoningagents)研究的角度对语用学中的言语行为进行了探讨.在多主体系统中言语行为的研究主要集中在3个方面:1)言语行为的本体描述;2)主体如何推理出合理的言语行为;3)主体如何正确处理其他主体发出的言语行为.这3个方面侧重点不同,但是相互间又紧密关联.重点讨论上述2)和3)两方面的内容,建立了一个主体认知过程的模型,并用可信主体逻辑LOBA(logic of believable agents)进行形式化表示.在主体认知过程的模型中,考虑包括主体的感知、信念、情绪、期望、目标、意图、承诺在内的各种认知成分,通过引入相应的认知动作来考虑这些认知成分之间的动态关系,并在此基础上描述主体如何产生和处理言语行为.在逻辑系统的构建上,LOBA逻辑扩展了KARO逻辑和LORA逻辑,将主体的情绪和认知动作都作为模态算子进行处理,并构建了3层语义模型以解释主体的认知动作.利用上述方法,LOBA可以在更细的粒度上来刻画主体的动态的实际推理过程.