量子信息讲座续讲 第一讲 量子计算中的因子分解

因子分解对所有的现行计算机而言是难解的 .这是现在通用的公共加密系统的基础 .文章介绍了在量子计算机上进行的Shor量子算法 ,即利用量子态的相干叠加和纠缠特性以及量子逻辑门实现量子计算的方法 ;并着重从理论原理和实验实现这两方面说明利用余因子函数和离散傅里叶变换使这种量子算法对因子分解是有效的 .     

量子信息讲座读讲 第一讲 量子计算中的因子分解

因子分解对所有的现行计算机而言是难解的。这是现在通用的公共加密系统的基础。文章介绍了在量子计算机上的进行的Shor量子算法,即利用量子态的相干叠加和纠缠特性以及量子逻辑门实现量子计算的方法;并着重从理论原理和实验实现忱两方面说明利用余因子函数和离散傅里叶变换使这种量子算法对因子分解是有效的。     

量子逻辑网络的核磁共振实现

利用相位相反技术,设计出了实现精确的CN门的脉冲序列;构造了三量子位的双重控制相位旋转门（CCS门）,它是将核磁共振(NMR)实现Grover量子算法从二量子位推广到三量子位的关键逻辑门,而且,依此方法,可以用NMR实现N量子位的Grover量子算法;还给出了量子Toffoli门以及量子态的各种对称操作的逻辑部件。所有这些逻辑操作都是构建量子态工程的工具。文中大部分脉冲序列己经在实验中得到验证,这些结果对于量子计算的理论研究和实验实现都具有现实意义。     

核磁共振实现基本量子逻辑门和量子分立付里叶变换

本文详细研究了利用核磁共振方法实现基本量子逻辑操作,提出了实现量子分立付里叶变换的实验方案,设计了可供实验的脉冲系列,为实验研究量子分立付里叶变换提供了具体方案。     

干涉条纹快速加窗傅里叶滤波方法的研究

滤波是干涉图像处理中的关键问题之一。为解决加窗傅里叶滤波在干涉条纹处理中运行时间长的问题,采用了快速傅里叶变换算法用以减少计算时间。通过加窗傅里叶变换,克服了傅里叶变换在干涉图相位局部信息不能提取的缺点,提出了一种快速加窗傅里叶滤波方法,实现了干涉条纹的快速滤波。在保证滤波效果的同时,缩短了计算时间,大大提高了干涉条纹处理速度,从根本上解决了加窗傅里叶滤波耗时长的问题,使得加窗傅里叶滤波方法应用于散斑在线检测成为了可能。实验验证了本方法的快速性、有效性和可靠性。     

由各向异性海森伯自旋环链组成的量子位及其通用量子逻辑门

研究了各向异性耦合的三粒子海森伯自旋环链团簇在随时间变化的磁场中的运动.该系统的哈密顿量具有SU(2)代数结构.用代数动力学方法对此系统进行求解，得到了严格的解析解.基于严格解, 可以构造一位量子逻辑门.通过调节磁场强度和频率, 就可以控制该量子逻辑门, 实现一位量子逻辑门的任何操作. 关键词： 代数动力学 自旋环链团簇 一位量子逻辑门     

傅里叶变换轮廓术中基于经验模态分解抑制零频的方法

为了消除傅里叶变换轮廓术中零频成分的扩展对测量范围和精度的影响,将经验模态分解方法引入到傅里叶变换轮廓术中,对变形条纹图进行经验模态分解,将条纹图分解为一系列的从高频到低频排列的固有模态函数,达到将高频成分和低频成分相分离的目的,用以消除零频成分,提高测量范围.同采用相移消除零频成分的技术相比,此方法只需要一帧条纹图,测量装置简单、实时性强、计算速度快.文中给出了理论分析和实验验证.     

离子阱中以声子为媒介的多体量子纠缠与逻辑门

高保真度的多离子纠缠和量子逻辑门是离子阱量子计算的基础.在现有的方案中, M?lmer-S?rensen门是比较成熟的实现多离子纠缠和量子逻辑门的实验方案.近年来,还出现了通过设计超快激光脉冲序列,在Lamb-Dicke区域以外实现超快量子纠缠和量子逻辑门的方案.这些方案均借助离子链这一多体量子系统的声子能级来耦合离子之间的自旋状态,并且均通过调制激光脉冲或设计合适的脉冲序列解耦多运动模式,来提高纠缠门的保真度.本文从理论和实验层面分析了这些多体量子纠缠和量子逻辑门操作的关键技术,揭示了离子阱中利用激光场驱动离子链运动态,通过非平衡过程中的非线性相互作用,来实现量子逻辑门的基本物理过程.     

非绝热几何量子逻辑门的脉冲设计

量子逻辑门是实现量子计算的基本组件之一，而高保真度和高鲁棒性是量子逻辑门必不可少的关键性质。在实现量子逻辑门的各种方法中，利用几何相位的全局特性来构造量子逻辑门是一个有效的方法，它可以对一些局域扰动有比较好的容错性。本文在非绝热几何量子计算的框架下，在三能级系统中构造出了任意的单比特量子逻辑门，并创建出在实验中方便实现的脉冲形式。本文进一步研究了量子系统中存在频率失谐和脉冲振幅偏差的情况，并考虑量子系统与环境之间的退相干效应，以设计出具有更好鲁棒性能的脉冲波形。     

基于方向-频率分解的旋转不变性纹理分类

提出了一种用于纹理分类的旋转不变性特征提取的新算法.该算法是将一定大小的图像进行二维傅里叶变换;其次在变换后的图像中央选择一个圆盘区域,并在方向[0°,180°]内进行等间隔角度频率抽样,实现方向分解,使用一组复Morlet小波对每个方向上的映射切片进行小波变换,从而实现多通道频率分解;在各个频率通道中计算均值和方差作为特征,并利用线性回归模型计算频率通道之间的关系特征;将特征沿方向进行一维傅里叶变换并取其幅值,从而得到旋转不变性特征.实验结果表明所提取的特征具有较好的旋转不变性,与其它算法相比具有更好的分类性能,并且对无旋转纹理分类也能产生较好的分类结果.     

高维辅助的普适量子线路优化

受到Lanyon等(Lanyon B P et al 2008 Nature Physics. 5 134)利用高维Hilbert空间成功简化Toffoli门的启发, 本文将辅助维度应用到普适量子线路中, 结合Cosine-Sine Decomposition(CSD), Quantum Shannon Decomposition(QSD)等矩阵分解方法, 优化了两比特和三比特普适幺正量子线路, 给出了计算n比特普适量子线路复杂度的公式, 并利用线性光学和腔QED系统设计了实验方案. 结果表明, 两比特和三比特量子线路的复杂度已分别接近和优于目前最优结果, 且随着比特数的增加, 本方案的优势愈加明显.     

Implementation of the quantum Fourier transform

A quantum Fourier transform (QFT) has been implemented on a three qubit nuclear magnetic resonance (NMR) quantum computer to extract the periodicity of an input state. Implementation of a QFT provides a first step towards the realization of Shor's factoring and other quantum algorithms. The experimental implementation of the QFT on a periodic state is presented along with a quantitative measure of its efficiency measured through state tomography. Experimentally realizing the QFT is a clear demonstration of the ability of NMR to control quantum systems.     

Note on Implementation of Three-Qubit SWAP Gate

In this paper, the synthesis and implementation of three-qubit SWAP gate is discussed. The three-qubit SWAP gate can be decomposed into product of 2 two-qubit SWAP gates, and it can be realized by 6 CNOT gates. Research illustrated that although the result is very simple, the current methods of matrix decomposition for multi-qubit gate can not get that. Then the implementation of three-qubit SWAP gate in the three spin system with Ising interaction is investigated and the sequence of control pulse and drift process to implement the gate is given. It needs 23 control pulses and 12 drift processes. Since the interaction can not be switched on and off at will, the realization of three-qubit SWAP gate in specific quantum system also can not simply come down to 2 two-qubit SWAP gates.     

Realization of -bit semiclassical quantum Fourier transform on IBM's quantum cloud computer

To overcome the difficulty of realizing large-scale quantum Fourier transform(QFT) within existing technology, this paper implements a resource-saving method(named t-bit semiclassical QFT over Z_(2~n)), which could realize large-scale QFT using an arbitrary-scale quantum register. By developing a feasible method to realize the control quantum gate Rk, we experimentally realize the 2-bit semiclassical QFT over Z_(2~3) on IBM's quantum cloud computer, which shows the feasibility of the method. Then, we compare the actual performance of 2-bit semiclassical QFT with standard QFT in the experiments.The squared statistical overlap experimental data shows that the fidelity of 2-bit semiclassical QFT is higher than that of standard QFT, which is mainly due to fewer two-qubit gates in the semiclassical QFT. Furthermore, based on the proposed method, N = 15 is successfully factorized by implementing Shor's algorithm.     

Quantum information processing with fiber optics: Quantum Fourier transform of 1024 qubits

Among a number of candidates, photons have advantages for implementing qubits: very weak coupling to the environment, the existing single photon measurement technique, and so on. Moreover, commercially available fiber-optic devices enable us to construct quantum circuits that consist of one-qubit operations (including classically controlled gates). Fiber optics resolves the mode matching problems in conventional optics and provides mechanically stable optical circuits. A quantum Fourier transform (QFT) followed by measurement was demonstrated with a simple circuit based on fiber optics. The circuit was shown to be robust against imperfections in the rotation gate. The error probability was estimated to be 0.01 per qubit, which corresponded to error-free operation for 100 qubits. The error probability can be further reduced to achieve successful QFT of 1024 qubits by taking the majority of the accumulated results. As is well known, QFT is a key function in quantum computations such as the final part of Shor’s factorization algorithm. The present QFT circuit, in combination with controlled unitary gates, would make possible practical quantum computers. Possible schemes of realizing quantum computers in this line are explored.     

三量子比特纠缠Greenberger-Horne-Zeilinger态和W态的量子线路实现

两个简单的量子线路被提出分别用来制备三量子比特Greenberger-Horne-Zeilinger(GHZ)态和W态。众所周知,任意的多量子比特门都可以由受控非门和单量子比特门复合而成。同样,我们发现三量子比特GHZ态和W态也可以由受控非门和单量子比特门来制备。因此,从量子计算的角度来看我们的方案十分重要。由于在整个过程只用到了单量子比特操作和双量子比特操作,所以我们的方案在实验中很容易实现。     

Experimental realization of information transmission between not-directly-coupled spins on NMR quantum computers

This paper presents a simple scheme for information transmission between two non-directly interactive qubits in an n-qubit system. An example has been realized on a three-qubit nuclear magnetic resonance (NMR) spectrometer quantum computer. The experimental result successfully demonstrates that the feasible measure can also be extended to other quantum logical gates, or other quantum algorithms, where some qubits have no direct interactions in a multi-qubit system.     

Cluster 态的核磁共振实验制备

利用一种优化的幺正算符制备了一种高度纠缠态--cluster 态,这个优化的幺正算符因为只需要施加非选择性脉冲,其所用的时间被明显缩短．该文选择一个三量子位的自旋体系,在核磁共振仪器上进行了实验验证,实验过程中先制备了一个三量子位的纯态,然后通过施加优化的幺正算符即可得到三量子位的cluster 态,实验结果证明了优化幺正算符的有效性．     

Implementation of conditional phase-shift gate for quantum information processing by NMR,using transition-selective pulses

Experimental realization of quantum information processing in the field of nuclear magnetic resonance (NMR) has been well established. Implementation of conditional phase-shift gate has been a significant step, which has lead to realization of important algorithms such as Grover's search algorithm and quantum Fourier transform. This gate has so far been implemented in NMR by using coupling evolution method. We demonstrate here the implementation of the conditional phase-shift gate using transition selective pulses. As an application of the gate, we demonstrate Grover's search algorithm and quantum Fourier transform by simulations and experiments using transition selective pulses.     

Modified Khaneja--Glaser Decomposition and Realization of Three-Qubit Quantum Gate

Optimal implementation of quantum gates is crucial for realization of quantum computation. We slightly modify the Khaneja-Glaser decomposition （KGD） for n-qubits and give a new Cartan subalgbra in the second step of the decomposition. Based on this modified KGD, we investigate the realization of three-qubit logic gate and obtain the result that a general three-qubit quantum logic gate can be implemented using at most 73 one-qubit gates rotations with respect to the y and z axes and 26 CNOT gates.