绝热量子计算理论引介

本文引介绝热量子计算理论评述量子绝热定理最新的应用。基于量子绝热方法在最新的前沿领域量子计算中建立量子绝热算法。我们引介"局域量子绝热",并考虑了这一局域绝热概念对量子算法的可能应用。     

耗散对受激拉曼绝热转移过程的影响

应用最近发展的量子耗散理论 ,研究了耗散对简单三能级体系的受激拉曼绝热转移过程的影响 ,并与pump dump过程比较 .计算结果表明 ,受激拉曼绝热转移的机制能很好地抑制中间态的弛豫与涨落的影响 .数值结果也表明了新的量子耗散理论可以正确地描述场与耗散相互耦合的动力学问题     

量子绝热定理(II):近似和适用条件

文章首先概述了近年国际文献中关于量子绝热近似和绝热条件的不自洽性的研究.叙述了文献中关于绝热近似不自洽性的论证和争论.然后引入文章作者的观点,从不同于国外文献的角度出发指出应当正确地理解瞬时本征函数的相位问题,从这个相位的正确处理,得出结论:(1)MS不自洽的存在,不因计及几何相位而消除;(2)量子几何相位不自洽是不存在;(3)现时的标准的绝热近似条件不是充分条件.     

旋转磁场中朗道系统的非绝热非周期性量子几何相位和Hannay角

基于代数动力学，精确求解了旋转磁场中的朗道系统，讨论了它的一般几何相位，给出了一般量子几何相位中对应于规范势的那部分相位的经典对应. 数值计算结果显示出非绝热演化和绝热演化的重大区别：非绝热演化诱导的非绝热量子激发引起系统物理量的非周期性和复杂性，体现了环境对系统的影响.     

两个量子窄区串联时的绝热输运和欧姆输运

利用Landoner 公式的多通道推广形式, 研究了两个不相等的量子窄区在串联情形下的绝热输运和欧姆输运. 这两个窄区以一个密闭的空腔相连接. 计算结果表明绝热输运导致窄区电阻的非相加性, 而非绝热输运服从欧姆相加规则. 这与实验定性一致. 关键词：     

Berry型量子纯态与Berry型量子系统

提出了Berry型量子纯态与Berry型量子系统的新概念，讨论了它们的性质和意义，并指出绝热量子系统可近似地视为完全Berry型量子系统. 关键词：     

量子绝热定理,思想和方法

阐述了量子绝热定理和绝热近似的现状、物理概念和方法，也回溯到它们的历史渊源和演变，强调Berry相位的发现对量子绝热定理的影响．     

量子绝热定理(Ⅱ):近似和适用条件

文章首先概述了近年国际文献中关于量子绝热近似和绝热条件的不自洽性的研究．叙述了文献中关于绝热近似不自洽性的论证和争论．然后引入文章作者的观点，从不同于国外文献的角度出发指出应当正确地理解瞬时本征函数的相位问题，从这个相位的正确处理，得出结论：（1）MS不自洽的存在，不因计及几何相位而消除；（2）量子几何相位不自洽是不存在；（3）现时的标准的绝热近似条件不是充分条件．     

机器学习辅助绝热量子算法设计

量子计算在近十年取得了长足的进展.随着量子调控技术达到前所未有的高度,包括超导量子比特、光量子器件、原子系综等在内的量子实验平台都进入到了崭新的时代.目前在特定计算任务上超越经典的量子计算优势也已经被报道.其中一种可以有效运用可控量子器件的计算方案是采用绝热量子计算.绝热量子计算中算法的选择与研究至关重要,其将直接决定量子计算优势是否能够最大限度地被挖掘.本综述主要介绍近期机器学习在绝热量子算法设计方面的应用,并讲述该计算架构在3-SAT和Grover搜索等问题上的应用.通过与未经机器学习优化设计的绝热量子算法对比,研究表明机器学习方法的应用可以极大提高绝热量子算法的计算效率.     

超导量子比特的耦合研究进展

超导量子比特以其在可控性、低损耗以及可扩展性等方面的优势被认为是最有希望实现量子计算机的固态方式之一.量子比特之间的相干可控耦合是实现大规模的量子计算的必要条件.本文介绍了超导量子比特耦合方式的研究进展,包括利用电容或电感实现量子比特的局域耦合,着重介绍一维传输线谐振腔作为量子总线实现多个量子比特的可控耦合的电路量子电动力学体系,并对最新的三维腔与超导量子比特的耦合结构的研究进展进行了论述.对各种耦合体系的哈密顿量进行了比较详细的分析,并按照局域性和可控性对不同耦合机制进行了分类.     

On a Nonlinear Model in Adiabatic Evolutions

In this paper, we study a kind of nonlinear model of adiabatic evolution in quantum search problem. As will be seen here, for this problem, there always exists a possibility that this nonlinear model can successfully solve the problem, while the linear model can not. Also in the same setting, when the overlap between the initial state and the final stare is sufficiently large, a simple linear adiabatic evolution can achieve O(1) time efficiency, but infinite time complexity for the nonlinear model of adiabatic evolution is needed. This tells us, it is not always a wise choice to use nonlinear interpolations in adiabatic algorithms. Sometimes, simple linear adiabatic evolutions may be sufficient for using.     

Adiabatic Quantum Gates

We discuss the logic implementation of quantum gates in the framework of the quantum adiabatic method, which uses the language of ground states, spectral gaps and Hamiltonians instead of the standard unitary transformation language.     

Symmetry-Protected Quantum Adiabatic Evolution in Spontaneous Symmetry-Breaking Transitions

Quantum adiabatic evolution describes the dynamical evolution of a slowly driven Hamiltonian. In most systems undergoing spontaneous symmetry-breaking transitions, the symmetry-protected quantum adiabatic evolution can still appear, even when the two lowest eigenstates become degenerate. Here, a general derivation to revisit the symmetry-dependent transition and the symmetry-dependent adiabatic condition (SDAC) is given. Further, based on the SDAC, an adiabatic-parameter-fixed sweeping scheme is used for achieving fast adiabatic evolution, which is more efficient than the linear sweeping scheme. In the limit of small adiabatic parameter, an analytic inequality is obtained for the ground state fidelity only dependent on the adiabatic parameter. The general statements are then demonstrated via two typical systems. Besides, the robustness of the symmetry-dependent adiabatic evolution against weak symmetry-breaking sources is studied. The findings can be tested via the techniques in quantum annealing and may provide promising applications in practical quantum technologies.     

Maximum Speed of Quantum Evolution

In this paper, we discuss the question of the minimum time needed for any state of a given quantum system to evolve into a distinct (orthogonal) state. This problem is relevant to deriving physical limits in quantum computation and quantum information processing. Here, we consider both cases of nonadiabatic and adiabatic evolution and we derive the Hamiltonians corresponding to the minimum time evolution predicted by the Margolus–Levitin theorem.     

利用暗本征态的绝热演化实现非几何条件相位移动:一种实现量子计算的新方法

利用绝热演化，文章提出一种新的方法以实现量子相位门，这种相位移动既非源于动力学过程，也非源于几何操纵，它来源于暗态本身的演化，基于绝热演化的优点，这种量子逻辑门对实验参量的起伏不敏感，与几何相位门相比，这种相位门更简单，并且保真度可得到进一步提高。文章对这种相位门做一简述。     

Partial evolution based local adiabatic quantum search

Recently, Zhang and Lu provided a quantum search algorithm based on partial adiabatic evolution, which beats the time bound of local adiabatic search when the number of marked items in the unsorted database is larger than one. Later, they found that the above two adiabatic search algorithms had the same time complexity when there is only one marked item in the database. In the present paper, following the idea of Roland and Cerf [Roland J and Cerf N J 2002 Phys. Rev. A 65 042308], if within the small symmetric evolution interval defined by Zhang et al., a local adiabatic evolution is performed instead of the original “global” one, this “new” algorithm exhibits slightly better performance, although they are progressively equivalent with M increasing. In addition, the proof of the optimality for this partial evolution based local adiabatic search when M=1 is also presented. Two other special cases of the adiabatic algorithm obtained by appropriately tuning the evolution interval of partial adiabatic evolution based quantum search, which are found to have the same phenomenon above, are also discussed.     

A quantum search algorithm based on partial adiabatic evolution

This paper presents and implements a specified partial adiabatic search algorithm on a quantum circuit. It studies the minimum energy gap between the first excited state and the ground state of the system Hamiltonian and it finds that,in the case of M = 1,the algorithm has the same performance as the local adiabatic algorithm. However,the algorithm evolves globally only within a small interval,which implies that it keeps the advantages of global adiabatic algorithms without losing the speedup of the local adiabatic search algorithm.     

Three-Dimensional Quantum State Transferring Between Two Remote Atoms by Adiabatic Passage under Dissipation

Recently, Zhou et al. [Phys. Rev. A 79 （2009） 044304] proposed a scheme for transferring three-dimensional quantum states between remote atomic qubits confined in cavities connected by fibers through adiabatic passage. In order to avoid the decoherence due to spontaneous emission, Zhou et al. utilized the large detuning atom-field interaction. In the present paper, we discuss the influence of dissipation on the scheme in both the resonant atom-field interaction case and the large detuning case. We numerically analyze the success probability and the transferring fidelity. It is shown that the resonant case is a preferable choice for the technique of the stimulated Raman adiabatic passage （STIRAP） due to the shorter operation time and the smaller probability of dissipation.     

An Alternative Adiabatic Quantum Algorithm for the Hamiltonian Cycle Problem

We put forward an alternative quantum algorithm for finding Hamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a von Neumann measurement on the final state, one may determine whether there is a Hamiltonian cycle in the graph and pick out a cycle if there is any. Although the proposed algorithm provides a quadratic speedup, it gives an alternative algorithm based on adiabatic quantum computation, which is of interest because of its inherent robustness.