SYMMETRIC TERNARY QUANTUM FOURIER TRANSFORM AND ITS APPLICATION

被引:0
作者
Dong H. [1 ]
Lu D. [1 ]
Sun X. [2 ]
机构
[1] School of Mathematics and Statistics, Henan University, Kaifeng
[2] College of Information and Management Science, Henan Agricultural University, Zhengzhou
关键词
quantum adder; quantum computing; quantum Fourier transform; symmetric ternary quantum system; universal quantum gate;
D O I
10.26421/QIC22.9-10-2
中图分类号
学科分类号
摘要
The research of ternary quantum system has gradually come into the attention of scholars in recent years. In 2018, Guangcan Guo and his colleagues showed that in a qutrit-qutrit system they can observe quantum nonlocality and quantum contextuality at the same time. In 2019, international cooperation team led by Anton Zelinger of Austrian Academy of Sciences and Jianwei Pan of University of science and technology of China, they have succeeded in teleporting complex high-dimensional quantum states. The work of the above scholars makes us clearly realize the importance of the study of ternary quantum system, but there is a few research results on this aspect. Furthermore, the quantum Fourier transform (QFT) offers an interesting way to perform arithmetic operations on a quantum computer. So, the paper extends the QFT to symmetric ternary quantum system and gives its application. First, a set of quantum gates is defined for symmetric ternary quantum system. It is worth noting that in binary system, qubit flipping is realized by Not gate. Therefore, we need to extend Not gate to symmetric ternary system to realize qutrit flipping, which is called M-S gate. And then, by decomposing single-qutrit unitary gate in symmetric ternary quantum system, the universal gates are given. It means that any unitary operation on n qutrits can be accurately implemented by single-qutrit symmetric ternary quantum gates and two-qutrit symmetric ternary M-S gates. By extending the QFT to the symmetric ternary quantum system, the paper successfully use some symmetric ternary quantum gates to construct the circuit which can realize symmetric ternary quantum Fourier transform (STQFT). Finally, the circuit of adder in symmetric ternary quantum system are designed based on the STQFT and the universal quantum gates. © Rinton Press.
引用
收藏
页码:733 / 754
页数:21
相关论文
共 26 条
[11]  
Mosca M., Zalka C., Exact quantum Fourier transforms and discrete logarithm algorithms, International Journal of Quantum Information, 2, pp. 91-100, (2003)
[12]  
Shor P.W., Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, Siam Review, 41, pp. 303-332, (1999)
[13]  
Lesovik G.B., Quantum counting algorithm and its application in mesoscopic physics, Physical Review A, 82, pp. 331-336, (2010)
[14]  
Radhakrishnan J., Roetteler M., Sen P., Random measurement bases, quantum state distinction and applications to the hidden subgroup problem, Algorithmica, 55, pp. 490-516, (2005)
[15]  
Dai K.Z., Zhao P., Li M.M., Et al., Demonstration of quantum permutation parity determine algorithm in a superconducting qutrit, Chinese Physics B, (2018)
[16]  
Le P.Q., Iliyasu A.M., Dong F., Et al., A flexible representation of quantum images for polynomial preparation, image compression and processing operations, Quantum Information Processing, 10, pp. 63-84, (2011)
[17]  
Zhang Y., Lu K., Gao Y., Et al., A novel enhanced quantum representation of digital images, Quantum Information Processing, 12, pp. 2833-2860, (2013)
[18]  
Li P., Liu X., Xiao H., Quantum image median filtering in the spatial domain, Quantum Information Processing, 17, (2018)
[19]  
Ruiz-Perez L., Garcia-Escartin J.C., Quantum arithmetic with the quantum Fourier transform, Quantum Information Processing, 16, (2017)
[20]  
Draper T.G., Addition on a quantum computer, (2000)