Computer Science ›› 2015, Vol. 42 ›› Issue (7): 57-61.doi: 10.11896/j.issn.1002-137X.2015.07.013

Previous Articles     Next Articles

Three-valued Quantum Elementary and Implementation of Quantum Fourier Transform Circuit

FAN Fu-you, YANG Guo-wu, ZHANG Yan and YANG Gang   

  • Online:2018-11-14 Published:2018-11-14

Abstract: In theory,quantum elementary gates can be put together to implement any quantum circuit and build a scalable quantum computer.Because the number of quantum elementary gates required to build quantum logic circuits is too large,exactly controlling them is not easy.Therefore,how to reduce the number of quantum elementary gates to build quantum circuits is a very important and significant topic.Three-level quantum system was proposed to build quantum computer in this paper,and a set of three-valued quantum elementary gates were defined,including function,operator matrix,quantum circuit diagram.These elementary gates mainly includ e three-valued quantum NOT gate,three-valued quantum controlled-NOT gate,three-valued Hadamard gate,three-valued quantum SWAP gate and three-valued CRk gate and so on.This paper extended the quantum Fourier transform(QFT) to three-valued quantum states,and quantum circuits were successfully built to implement QFT with partial three-valued quantum elementary gates.By the quantitative analysis,the complexity of three-valued QFT circuit is lower than two-valued case at least 50%.The result indicates that the three-valued quantum elementary gates have a huge advantage in respect of reducing the circuit complexity about quantum computation.

Key words: Quantum computation,Three-valued quantum elementary gates,Quantum Fourier transform,Synthesis of quantum circuit

[1] Landauer R.Irreversibility and heat generation in the computing process[J].IBM journal of research and development,1961,5(3):183-191
[2] Feynman R P.Simulating physics with computers[J].International Journal of Theoretical Physics,1982,21(6):467-488
[3] Deutsch D.Quantum theory,the Church-Turing principle andthe universal quantum computer[J].Proceedings of the Royal Society of London,A Mathematical and Physical Sciences,1985,400(1818):97-117
[4] Deutsch D.Quantum computational networks[J].Proceedings of the Royal Society of London.A.Mathematical and Physical Sciences,1989,425(1868):73-90
[5] Muthukrishnan A,Stroud Jr C R.Multivalued logic gates forquantum computation[J].Physical Review A,2000,62(5)
[6] Di Y M,Wei H R.Elementary gates for ternary quantum logic circuit[J].arXiv preprint arXiv:1105.5485,2011
[7] Yang G,Song X,Perkowski M,et al.Realizing ternary quantum switching networks without ancilla bits[J].Journal of Physics A:Mathematical and General,2005,38(44):9689-9697
[8] Yang G,Xie F,Song X,et al.Universality of 2-qudit ternary reversible gates[J].Journal of Physics A:Mathematical and Gener-al,2006,39(24):7763-7773
[9] Di Y M,Wei H R.Synthesis of multivalued quantum logic circuits by elementary gates[J].Physical Review A,2013,87(1):1-9
[10] Klimov A B,Guzman R,Retamal J C,et al.Qutrit quantumcomputer with trapped ions[J].Physical Review A,2003,67(6):235-238
[11] Lanyon B P,Barbieri M,Almeida M P,et al.Simplifying quantum logic using higher-dimensional Hilbert spaces[J].Nature Physics,2009,5(2):134-140
[12] Nielsen M A,Chuang I L.Quantum computation and quantuminformation[M].Cambridge University Press,2010:218

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .