首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
In most of the proposals for quantum computers, a common feature is that the quantum circuits are expected to be made of cascades of unitary transformations acting on the quantum states. Such unitary gates are normally assumed to belong to a given discrete set of transformations. However, arbitrary superposition of quantum states may be achieved by utilizing a fixed number of transformations, each depending on a parameter. A framework is proposed to dynamically express these parameters directly in terms of the control inputs entering into the continuous time forced Schrouml;dinger equation. PACS: 03.67.Lx; 03.65.Fd; 02.30.Mv; 02.30.Xy  相似文献   

2.
We introduce a measure of quantum correlations in the N-qubit quantum system which is invariant with respect to the SU(2 N ) group of transformations of this system. This measure is a modification of the quantum discord introduced earlier and is referred to as the unitary or SU(2 N )-invariant discord. Since the evolution of a quantum system is equivalent to the proper unitary transformation, the introduced measure is an integral of motion and is completely defined by eigenvalues of the density matrix. As far as the calculation of the unitary invariant discord is rather complicated computational problem, we propose its modification which may be found in a simpler way. The case N?=?2 is considered in details. In particular, it is shown that the modified SU(4)-invariant discord reaches the maximum value for a pure state. A geometric measure of the unitary invariant discord of an N-qubit state is introduced and a simple formula for this measure is derived, which allows one to consider this measure as a witness of quantum correlations. The relation of the unitary invariant discord with the quantum state transfer along the spin chain is considered. We also compare the modified SU(4)-invariant discord with the geometric measure of SU(4)-invariant discord of the two-qubit systems in the thermal equilibrium states governed by the different Hamiltonians.  相似文献   

3.
Quantum Fisher information plays a central role in the field of quantum metrology. In this paper, we study the problem of quantum Fisher information of unitary processes. Associated with each parameter \(\theta _i\) of unitary process \(U(\varvec{\theta })\), there exists a unique Hermitian matrix \(M_{\theta _i}=i(U^\dagger \partial _{\theta _i} U)\). Except for some simple cases, such as when the parameter under estimation is an overall multiplicative factor in the Hamiltonian, calculation of these matrices is not an easy task to treat even for estimating a single parameter of qubit systems. Using the Bloch vector \(\varvec{m}_{\theta _i}\), corresponding to each matrix \(M_{\theta _i}\), we find a closed relation for the quantum Fisher information matrix of the SU(2) processes for an arbitrary number of estimation parameters and an arbitrary initial state. We extend our results and present an explicit relation for each vector \(\varvec{m}_{\theta _i}\) for a general Hamiltonian with arbitrary parametrization. We illustrate our results by obtaining the quantum Fisher information matrix of the so-called angle-axis parameters of a general SU(2) process. Using a linear transformation between two different parameter spaces of a unitary process, we provide a way to move from quantum Fisher information of a unitary process in a given parametrization to the one of the other parametrizations. Knowing this linear transformation enables one to calculate the quantum Fisher information of a composite unitary process, i.e., a unitary process resulted from successive action of some simple unitary processes. We apply this method for a spin-half system and obtain the quantum Fisher matrix of the coset parameters in terms of the one of the angle-axis parameters.  相似文献   

4.
5.
This letter treats the quantum random walk on the line determined by a 2 × 2 unitary matrix U. A combinatorial expression for the mth moment of the quantum random walk is presented by using 4 matrices, P, Q, R and S given by U. The dependence of the mth moment on U and initial qubit state is clarified. A new type of limit theorems for the quantum walk is given. Furthermore necessary and sufficient conditions for symmetry of distribution for the quantum walk is presented. Our results show that the behavior of quantum random walk is striking different from that of the classical ramdom walk. PACS: 03.67.Lx; 05.40.Fb; 02.50.Cw  相似文献   

6.
目的针对传统量子遗传算法无法充分利用种群中未成熟个体信息的不足,提出了基于交互更新模式的量子遗传算法(IUMQGA)并应用于几何约束求解中。方法几何约束问题的约束方程组可转化为优化模型,因此约束求解问题可以转化为优化问题。采用将遗传算法与量子理论相结合的量子遗传算法,使用双串量子染色体结构,使用交互更新策略将遗传算法中的交叉操作利用量子门变换来实现,根据不同情况采用不同的交互更新策略。这里的交互,指的是两个个体进行信息交换的过程,该过程用以产生新的个体。这不仅增加了个体间信息的交换而且充分利用了种群中未成熟个体的信息,提高了算法的收敛速度。结果通过非线性方程实例和几何约束实例测试并与其他方法比较表明,基于交互更新模式的量子遗传算法求解几何约束问题具有更好的求解精度和求解速率。双圆外公切线问题实例中,IUMQGA算法比QGA算法稳定;单圆填充问题和双圆外公切线问题实例中,通过实验求得各变量的最优值与其相应的精确值的误差在1E-2以下。结论采用交互更新模式的量子遗传算法可以很好地求解几何约束问题。  相似文献   

7.
张国帅  许道云 《软件学报》2019,30(12):3579-3589
EPR态作为最基本的量子纠缠态,在量子隐形传态中起着重要作用.研究适应任意类型EPR通道的单量子比特隐形传送通用线路,并推广到任意N比特量子隐形传送通用线路.首先设计出4种EPR态,分别作为量子通道的单比特量子隐形传态,通过分析EPR量子通道与量子操作门之间的关系,设计一种单比特通用线路;然后,设计两比特的标准量子隐形传态线路,并用Mathematica进行仿真验证线路的正确性,再把它推广到N比特量子隐形传送线路;最后,将单量子比特通用线路与N比特量子隐形传送线路进行融合,最终设计出任意N比特量子隐形传送通用线路.N粒子量子比特通用线路通过信息接受者进行带参数的幺正变换,其中,参数由制备出的EPR对类型确定,解决了因EPR制备中心出错导致的信息传送失败问题.  相似文献   

8.
In both the equations for matter and light wave propagation, the momentum of the electromagnetic fields P e reflects the relevant electromagnetic interaction. As a review of possible applications of wave propagation properties in the scenarios of standard and stochastic electrodynamics, some relevant experiments are described. Moreover, P e is also the link to the unitary vision of the quantum effects of the Aharonov-Bohm (AB) type, which provide a useful quantum approach for the limit of the photon mass m ph . A bench-top experiment based on effects of the AB type that exploit new interferometric techniques, is foreseen to yield the limit m ph ≃ 10−54 g, a value that improves upon the results achieved with other approaches.  相似文献   

9.
Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphic encryption (QFHE). Then, based on quantum one-time pad (QOTP), we construct a symmetric QFHE scheme, where the evaluate algorithm depends on the secret key. This scheme permits any unitary transformation on any $n$ -qubit state that has been encrypted. Compared with classical homomorphic encryption, the QFHE scheme has perfect security. Finally, we also construct a QOTP-based symmetric QHE scheme, where the evaluate algorithm is independent of the secret key.  相似文献   

10.
In this paper, we determine all unitary solutions to the Yang–Baxter equation in dimension four. Quantum computation motivates this study. This set of solutions will assist in clarifying the relationship between quantum entanglement and topological entanglement. We present a variety of facts about the Yang–Baxter equation for the reader unfamiliar with the equation. PACS: 02.10.Yn; 02.10.Kn; 03.65.Ud; 03.67.Hk  相似文献   

11.
Tavakoli等人利用无偏基的有关循环性质给出了奇素数维上的量子秘密共享方案。针对[9]维上的量子系统给出了相应无偏基,基于这些无偏基的性质构造了相应酉变换,进而构造了一个[(N,N)]门限秘密共享方案,并分析了方案的安全性。  相似文献   

12.
彭家寅 《计算机应用研究》2020,37(12):3731-3735
为了解决任意二量子通信问题,首先给出了五粒子和七粒子纠缠态的构造方法,并提供了它们的量子线路图。其次,以该五粒子纠缠态为量子信道,提出一个任意二粒子未知量子态的受控隐形传态协议。该协议在监察者Charlie的控制下,Alice进行四粒子投影测量和经典通信,Bob采用简单酉变换就能以100%的概率成功重构一个任意二粒子纠缠态。最后,利用七粒子纠缠态为量子信道,提出了任意二粒子纠缠态的联合受控远程制备方案。在此方案中,发送者Alice用自己掌握被制备态的部分信息构造测量基,发送者Bob采用前馈测量策略,接收者Diana在监控者Charlie的帮助下,通过简单幺正变换就能确定性地恢复原始态。  相似文献   

13.
Cluster态的量子签名方案   总被引:1,自引:0,他引:1       下载免费PDF全文
提出一种利用Cluster state纠缠态实现的量子签名方案。该方案中用Cluster态作为量子信道,每一组量子比特串分别分发给消息拥有和签名者Alice、公证人TA、验签名者Bob。加载消息的方法是Alice在TA规定量子比特串序列下,分别对拥有的量子比特对的第一个量子比特进行幺正变换操作而进行。对拥有的量子比特对进行的Bell测量结果是消息的签名。Bob对拥有的对应的两个量子比特对进行Bell测量来验证签名,但要得到公证人TA对其约束才能完成。Cluster state纠缠态在纠缠特性、局域操作保真性和安全性有较好的性能。  相似文献   

14.
Abstract This paper concerns the study of a unitary transformation of a generic real symmetric matrix A into a semiseparable matrix. The problem is studied both theoretically and from an algorithmic point of view. In particular, we first give a formal proof of the existence of such a transformation and then we discuss its uniqueness, proving an implicit-Q theorem for semiseparable matrices. Lastly, we study structural properties of the factors of the QR-decomposition of a semiseparable matrix. These properties allow us to design a method based on QR iterations applied to a semiseparable matrix for reducing a symmetric matrix to semiseparable form. This method has the same asymptotic cost of the reduction of a symmetric matrix to tridiagonal form. Once the transformation is accomplished, to compute the eigenvalues each further QR iteration can be done in linear time.  相似文献   

15.
核磁共振(NMR)技术目前是能有效实现量子计算的物理体系之一。多量子算符代数理论可以将幺正变换分解为一系列有限的单量子门和对角双量子门的组合。本文以核磁共振和多量子算符代数理论为基础,提出了实现多量子位Grover量子搜索算法的核磁共振脉冲序列设计方法,并在量子计算仿真程序上进行了3量子位的Grover量子搜索算法的实验验证。  相似文献   

16.
杨新元  马智  吕欣 《计算机科学》2009,36(10):68-71
提出了一种新的两方量子安全直接通信协议。该方案利用有序的四粒子W态作为信息载体,利用幺正变换对秘密消息进行编码,通过当地Bell基测量和经典通信直接传递秘密消息。在理想信道下,协议对于非相干攻击是安全的。该方案的优点在于利用W态作为信息载体,较GHZ态而言,损耗要小得多,并且不需要在量子信道中传输载有秘密消息的量子比特。  相似文献   

17.
Werner derivatives are a special kind of mixing states transformed from Werner states by unitary operations (Hiroshima and Ishizaka in Phys Rev A 62:044302, 2000). In this paper, the inherent quantum correlations in Werner derivatives are quantified by two different quantifiers, i.e., quantum discord and geometric discord. Different analytic expressions of the two discords in Werner derivatives are derived out. Some distinct features of the discords and their underlying physics are exposed via discussions and analyses. Moreover, it is found that the amount of quantum correlations quantified by either quantifier in each derivative cannot exceed that in the original Werner state. In other words, no unitary operation can increase quantum correlation in a Werner state as far as the two quantifiers are concerned.  相似文献   

18.
We prove that majorization relations hold step by step in the Quantum Fourier Transformation (QFT) for phase-estimation algorithms. Our result relies on the fact that states which are mixed by Hadamard operators at any stage of the computation only differ by a phase. This property is a consequence of the structure of the initial state and of the QFT, based on controlled-phase operators and a single action of a Hadamard gate per qubit. The detail of our proof shows that Hadamard gates sort the probability distribution associated to the quantum state, whereas controlled-phase operators carry all the entanglement but are immaterial to majorization. We also prove that majorization in phase-estimation algorithms follows in a most natural way from unitary evolution, unlike its counterpart in Grover's algorithm. PACS: 03.67.-a, 03.67.Lx  相似文献   

19.
多值逻辑量子置换门的酉矩阵表示   总被引:1,自引:0,他引:1  
理论上量子可逆电路不存在能量耗散问题,因此量子计算系统对环境产生的负面影响可以达到最低.多值逻辑量子置换门是构建多值逻辑量子电路的基本单元.该文从数学的角度研究多值逻辑量子置换门的酉矩阵,提出了一种构造多值逻辑量子置换门酉矩阵的方法,并对其正确性进行了讨论.在此基础之上,又给出了构造混合多值逻辑量子置换门酉矩阵的框架,利用此框架可以方便地构造任何混合逻辑量子置换门的酉矩阵.酉矩阵是量子门的数学模型,可以清晰地反映出量子门的数学性质.研究量子门的酉矩阵对验证量子门的正确性和可靠性,分析量子状态在电路中的演化过程及发展趋势具有一定的意义.  相似文献   

20.
孙力  须文波 《计算机科学》2006,33(9):250-252
核磁共振(NMR)技术被认为是最为有效的实现量子计算的物理体系之一。多量子算符代数理论可以将幺正变换分解为一系列有限的单量子门和对角双量子门的组合。本文以核磁共振和多量子算符代数理论为基础,提出了实现任意相位旋转角度的一般化量子搜索算法的核磁共振脉冲序列设计方法,并在量子计算仿真程序上进行了双量子位的不同相位旋转角度的量子搜索算法的实验验证。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号