arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0309104quant-ph
收藏

n比特量子计算的正则分解与并发

Canonical Decompositions of n-qubit Quantum Computations and Concurrence

Stephen S. Bullock, Gavin K. Brennen

摘要:

双量子位正则分解SU(4)= [SU(2)\otimes SU(2)] Delta [SU(2)\otimes SU(2)]将任何双量子位量子计算写成一个局域么正、一个贝尔态的相对相位和一个第二局域么正的组合。使用Lie理论,我们将其推广到n量子比特分解,即并发正则分解(C.C.D.)。SU(2^n)=KAK。群K固定了一个与并发有关的双线性形式,特别是在K中的任何计算都保持了纠缠|<phi^*|(-i sigma^y_1). (-i sigma^y_n)|Phi>| 2,n为偶数。因此,CDC。表明,任何n量子比特量子计算是一个组合的计算保持这个n-tangle,在A中的计算,它适用于一组GHZ态的相对相位,和第二个计算保持它作为一个应用程序,我们研究了在何种程度上,一个大的,随机幺正可能会改变并发。结果表明,对于在SU(2^{2 p})内A中随机选择的a,当偶数个量子比特接近无穷大时,a从纠缠态0到最大纠缠态的概率接近1。对于这样的一个\in A,任何v=k_1和k_2都具有相同的性质。最后,虽然|<phi^*|(-i sigma^y_1). (-i sigma^y_n)|Phi>|当量子位数为奇数时,^2完全消失,我们证明了一个更复杂的C.C.D.其中K是辛群。

英文摘要:

The two-qubit canonical decomposition SU(4) = [SU(2) \otimes SU(2)] Delta [SU(2) \otimes SU(2)] writes any two-qubit quantum computation as a composition of a local unitary, a relative phasing of Bell states, and a second local unitary. Using Lie theory, we generalize this to an n-qubit decomposition, the concurrence canonical decomposition (C.C.D.) SU(2^n)=KAK. The group K fixes a bilinear form related to the concurrence, and in particular any computation in K preserves the tangle |<phi^*|(-i sigma^y_1)...(-i sigma^y_n)|phi>|^2 for n even. Thus, the C.C.D. shows that any n-qubit quantum computation is a composition of a computation preserving this n-tangle, a computation in A which applies relative phases to a set of GHZ states, and a second computation which preserves it. As an application, we study the extent to which a large, random unitary may change concurrence. The result states that for a randomly chosen a in A within SU(2^{2p}), the probability that a carries a state of tangle 0 to a state of maximum tangle approaches 1 as the even number of qubits approaches infinity. Any v=k_1 a k_2 for such an a \in A has the same property. Finally, although |<phi^*|(-i sigma^y_1)...(-i sigma^y_n)|phi>|^2 vanishes identically when the number of qubits is odd, we show that a more complicated C.C.D. still exists in which K is a symplectic group.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑