Yanyan Hou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yanyan Hou has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
Jian Li
School of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing 100876, People’s Republic of China
3 shared publications- Chong-Qiang Ye
Hangzhou City University
2 shared publications Hengji Li
Beijing University of Posts and Telecommuncations
2 shared publications- Jian Li
School of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing, China
2 shared publications - Chaoyang Li
College of Software Engineering, Zhengzhou University of Light Industry, Zhengzhou 450001, China
1 shared publication Chuan-Dong Song
College of Information Science and Engineering, ZaoZhuang University, ZaoZhuang, Shandong 277160, People’s Republic of China
1 shared publication
Latest Publications
- 4 November 2026
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 8 (2) , 122
Feature–adaptive fusion in hybrid quantum–classical neural networks for robust biomedical image classification
- 4 November 2026
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 8 (2) , 122
Feature–adaptive fusion in hybrid quantum–classical neural networks for robust biomedical image classification
- 22 August 2023
- Published by IOP Publishing in Laser Physics Letters
- Vol. 20 (10) , 105203
Quantum canonical correlation analysis algorithm
Canonical correlation analysis (CCA) is a fundamental technique used to analyze data correlation in various fields, including video and medical data analysis. In this paper, we propose a quantum canonical correlation analysis (QCCA) algorithm. First, we introduce a combined density matrix representation method that transforms CCA into generalized eigenvalue decomposition. Moreover, to address the challenge of performing generalized eigenvalue decomposition in high-dimensional scenarios, we propose a quantum method for extracting the canonical principal axes. In this method, two sets of variables are transformed into a reduced density matrix, so that the product of variable matrices can be accelerated by phase estimation and controlled rotation. Complexity analysis shows that the QCCA algorithm achieves exponential acceleration in variable dimensions n, p and variable size m compared to classical algorithms. The QCCA algorithm serves as a foundation for the subsequent development of quantum algorithms for classification, regression, and other machine learning tasks.
- 22 August 2023
- Published by IOP Publishing in Laser Physics Letters
- Vol. 20 (10) , 105203
Quantum canonical correlation analysis algorithm
Canonical correlation analysis (CCA) is a fundamental technique used to analyze data correlation in various fields, including video and medical data analysis. In this paper, we propose a quantum canonical correlation analysis (QCCA) algorithm. First, we introduce a combined density matrix representation method that transforms CCA into generalized eigenvalue decomposition. Moreover, to address the challenge of performing generalized eigenvalue decomposition in high-dimensional scenarios, we propose a quantum method for extracting the canonical principal axes. In this method, two sets of variables are transformed into a reduced density matrix, so that the product of variable matrices can be accelerated by phase estimation and controlled rotation. Complexity analysis shows that the QCCA algorithm achieves exponential acceleration in variable dimensions n, p and variable size m compared to classical algorithms. The QCCA algorithm serves as a foundation for the subsequent development of quantum algorithms for classification, regression, and other machine learning tasks.
- 11 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 26 (6) , 1226-1230
An Efficient Semi-Quantum Key Distribution Protocol and Its Security Proof
The idea of semi-quantum communication protocols provides a theoretical solution for the high costs of quantum resources. In this study, we propose an efficient semi-quantum key distribution protocol that allows Alice and quantum-capable restricted Bob to establish a secure key. Then, we demonstrate that the protocol is information-theoretic secure in the asymptotic scenario. As long as the channel noise is less than the noise tolerance of the protocol, Alice and Bob can withdraw a secure key. The proposed protocol has advantages over previous protocols regarding qubit efficiency and communication cost. Besides, our efficiency analysis is more fair and practical because noise factors are taken into account. Based on these features, it may have potential applications in future quantum communications.
- 11 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 26 (6) , 1226-1230
An Efficient Semi-Quantum Key Distribution Protocol and Its Security Proof
The idea of semi-quantum communication protocols provides a theoretical solution for the high costs of quantum resources. In this study, we propose an efficient semi-quantum key distribution protocol that allows Alice and quantum-capable restricted Bob to establish a secure key. Then, we demonstrate that the protocol is information-theoretic secure in the asymptotic scenario. As long as the channel noise is less than the noise tolerance of the protocol, Alice and Bob can withdraw a secure key. The proposed protocol has advantages over previous protocols regarding qubit efficiency and communication cost. Besides, our efficiency analysis is more fair and practical because noise factors are taken into account. Based on these features, it may have potential applications in future quantum communications.
- Open Access
- 23 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 120006-120013
One Step Quantum Key Distribution Protocol Based on the Hyperentangled Bell State
Considering the security and efficiency of quantum communication system, one step quantum key distribution protocol based on hyperentangled Bell state is proposed. Every 6 classical bits are divided into a group, which are encoded by single particle and hyperentangled Bell state, the sender Alice sends them to receiver Bob, Bob randomly selects the position of hyperentangled Bell state to measure and detects the existence of eavesdropper Eve by comparing measurement results in his hand and transmitted by Alice. Quantum key distribution protocol based on grouping is proposed to solve the storage problem of quantum information and improve the maneuverability, a security analysis is calculated under the intercept-measureresend attack which introduce at least an error rate of 46.875%, if Eve wants to get all the information, the probability of detection eavesdropping under the entanglement-measure attack is 93.75%, so it proves that proposed protocol does not need to store the quantum state and asymptotically secure under interceptmeasure-resend attack and entanglement-measure attack.
- 23 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 120006-120013
Open AccessOne Step Quantum Key Distribution Protocol Based on the Hyperentangled Bell State
Considering the security and efficiency of quantum communication system, one step quantum key distribution protocol based on hyperentangled Bell state is proposed. Every 6 classical bits are divided into a group, which are encoded by single particle and hyperentangled Bell state, the sender Alice sends them to receiver Bob, Bob randomly selects the position of hyperentangled Bell state to measure and detects the existence of eavesdropper Eve by comparing measurement results in his hand and transmitted by Alice. Quantum key distribution protocol based on grouping is proposed to solve the storage problem of quantum information and improve the maneuverability, a security analysis is calculated under the intercept-measureresend attack which introduce at least an error rate of 46.875%, if Eve wants to get all the information, the probability of detection eavesdropping under the entanglement-measure attack is 93.75%, so it proves that proposed protocol does not need to store the quantum state and asymptotically secure under interceptmeasure-resend attack and entanglement-measure attack.
- Open Access
- 1 January 2016
- Published by Korea Information Processing Society in Journal of Information Processing Systems
A Multiple Features Video Copy Detection Algorithm Based on a SURF Descriptor
Journal of Information Processing Systems
- 1 January 2016
- Published by Korea Information Processing Society in Journal of Information Processing Systems
Open AccessA Multiple Features Video Copy Detection Algorithm Based on a SURF Descriptor
Journal of Information Processing Systems