Operator-Schmidt decomposition of the quantum Fourier transform on CN1 ⊗ CN2

被引:12
作者
Tyson, J [1 ]
机构
[1] Harvard Univ, Jefferson Lab, Cambridge, MA 02138 USA
来源
JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL | 2003年 / 36卷 / 24期
关键词
D O I
10.1088/0305-4470/36/24/317
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Operator-Schmidt decompositions of the quantum Fourier transform on C-N1 circle times C-N2 are computed for all N-1, N-2 greater than or equal to, 2. The decomposition is shown to be completely degenerate when N-1 is a factor of N-2 and when N-1 > N-2. The first known special case, N-1 = N-2 = 2(n), was computed by Nielsen in his study of the communication cost of computing the quantum Fourier transform of a collection of qubits equally distributed between two parties (M A Nielsen 1998 PhD Thesis University of New Mexico ch 6 Preprint quant-ph/0011036). More generally, the special case N-1 = 2(n1) less than or equal to 2(n2) = N-2 was computed by Nielsen et al in their study of strength measures of quantum operations (M A Nielsen et al 2002 Preprint quant-ph/0208077 (2003 Phys. Rev. A at press)). Given the Schmidt decompositions presented here, it follows that in all cases the bipartite communication cost of exact computation of the quantum Fourier transform is maximal.
引用
收藏
页码:6813 / 6819
页数:7
相关论文
共 8 条
[1]   Time optimal control in spin systems [J].
Khaneja, N. ;
Brockett, R. ;
Glaser, S.J. .
Physical Review A. Atomic, Molecular, and Optical Physics, 2001, 63 (03) :323081-320811
[2]   Optimal creation of entanglement using a two-qubit gate [J].
Kraus, B ;
Cirac, JI .
PHYSICAL REVIEW A, 2001, 63 (06) :8
[3]  
MAKHLIN Y, 2000, QUANTPH0002045
[4]  
Nielsen M.A., 2000, Quantum Computation and Quantum Information, P109
[5]  
NIELSEN MA, 2002, PHYS REV A
[6]  
NIELSEN MA, 2000, BEN CTR PHYS 19 JUL
[7]  
Nielsen S, 1998, EUR EAT DISORD REV, V6, P4, DOI 10.1002/(SICI)1099-0968(199803)6:1<4::AID-ERV237>3.3.CO
[8]  
2-G