Feng-Guang Li
Feng-Guang Li has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Xiang-Qun Fu
Zhengzhou Information Science and Technology Institute
3 shared publicationsHe-Liang Huang
Zhengzhou Information Science and Technology Institute
2 shared publicationsShuo Zhang
Zhengzhou Information Science and Technology Institute
2 shared publicationsTan Li
Zhengzhou Information Science and Technology Institute
2 shared publications- Wan-Su Bao
Zhengzhou Informat Sci & Technol Inst, Henan Key Lab Quantum Informat & Cryptog, Zhengzhou 450001, Henan, Peoples R China
2 shared publications Bo-Wen Ma
Zheng-zhou Information Science and Technology Institute Zheng-zhou 450004 China
1 shared publication
Latest Publications
- 18 December 2018
- Published by Springer Nature in International Journal of Theoretical Physics
- Vol. 58 (3) , 939-949
Nonadiabatic Quantum Search Algorithm with Analytical Success Rate
- 18 December 2018
- Published by Springer Nature in International Journal of Theoretical Physics
- Vol. 58 (3) , 939-949
Nonadiabatic Quantum Search Algorithm with Analytical Success Rate
- 1 September 2018
- Published by Elsevier in Physics Letters A
- Vol. 382 (38) , 2709-2714
Role of coherence in adiabatic search algorithms
- 1 September 2018
- Published by Elsevier in Physics Letters A
- Vol. 382 (38) , 2709-2714
Role of coherence in adiabatic search algorithms
- Open Access
Research on phases of Grover-type algorithms
When applying Grover's algorithm to an unordered database, the probability of obtaining correct results usually decreases as the quantity of target increases. To amend the limitation, numbers of improved schemes are proposed. In this paper, we focus on four improved schemes from phases, and find that they are just differed by a global phase. Based on this conclusion, the extensive researches on one scheme can be easily generated to other three schemes, and some examples are presented to indicate the correctness.
Open AccessResearch on phases of Grover-type algorithms
When applying Grover's algorithm to an unordered database, the probability of obtaining correct results usually decreases as the quantity of target increases. To amend the limitation, numbers of improved schemes are proposed. In this paper, we focus on four improved schemes from phases, and find that they are just differed by a global phase. Based on this conclusion, the extensive researches on one scheme can be easily generated to other three schemes, and some examples are presented to indicate the correctness.
- Open Access
Realization of t-bit semiclassical quantum Fourier transform on IBM's quantum cloud computer
To overcome the difficulty of realizing large-scale quantum Fourier transform (QFT) within existing technology, this paper presents a resource-saving method, namely t-bit semiclassical QFT over (Z_(2^n)), which could realize large-scale QFT using arbitrary-scale quantum register. Using our method, the scale of quantum register can be determined flexibility according to the scale of quantum system, enabling the quantum resource and speed of realizing QFT to be optimal. By developing a feasible method to realize the control quantum gate R_k, we experimentally demonstrate the 2-bit semiclassical QFT over (Z_(2^3)) on IBM's quantum cloud computer, showing the feasibility of our proposed method. Then, we compare the actual performance of 2-bit semiclassical QFT and standard QFT in the experiments. Experimental data show that the fidelity of the result of 2-bit semiclassical QFT is higher than that of standard QFT, which is mainly due to less two-qubit controlled gates are required in the semiclassical QFT. Furthermore, based on the proposed method, we successfully implement the Shor's algorithm to factorize N=15.
Open AccessRealization of t-bit semiclassical quantum Fourier transform on IBM's quantum cloud computer
To overcome the difficulty of realizing large-scale quantum Fourier transform (QFT) within existing technology, this paper presents a resource-saving method, namely t-bit semiclassical QFT over (Z_(2^n)), which could realize large-scale QFT using arbitrary-scale quantum register. Using our method, the scale of quantum register can be determined flexibility according to the scale of quantum system, enabling the quantum resource and speed of realizing QFT to be optimal. By developing a feasible method to realize the control quantum gate R_k, we experimentally demonstrate the 2-bit semiclassical QFT over (Z_(2^3)) on IBM's quantum cloud computer, showing the feasibility of our proposed method. Then, we compare the actual performance of 2-bit semiclassical QFT and standard QFT in the experiments. Experimental data show that the fidelity of the result of 2-bit semiclassical QFT is higher than that of standard QFT, which is mainly due to less two-qubit controlled gates are required in the semiclassical QFT. Furthermore, based on the proposed method, we successfully implement the Shor's algorithm to factorize N=15.