Qing Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Qing Zhou has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Songfeng Lu
Huazhong University of Science and Technology
4 shared publications - Hao Yang
Hubei Key Laboratory of Distributed System Security, Hubei Engineering Research Center on Big Data Security, School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China
2 shared publications Jie Sun
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
1 shared publication- Xueming Tang
Hubei Key Laboratory of Distributed System Security, Hubei Engineering Research Center on Big Data Security, School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan, China
1 shared publication - Zhigang Zhang
State Key Laboratory of Advanced Optical Communication Systems and Networks, School of Electronics, Peking University, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 12 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Hash Function Based on Quantum Walks with Two-Step Memory
We propose a new quantum-walk-based hash function QHF2M by combining two types of quantum walks with two-step memory and numerically test its statistical performance. The test result shows that QHF2M is on a par with the state-of-the-art hash functions based on discrete quantum walks in terms of sensitivity of hash value to message, diffusion and confusion properties, uniform distribution property, and collision resistance property. Moreover, both unequal and equivalent coin angles used by the underlying quantum walks can lead to near-ideal statistical performance. This result indicates that neither using quantum walks with different memory length nor adopting distinct coin angles is a necessary condition for constructing good quantum-walk-with-memory-based hash functions.
- 12 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessHash Function Based on Quantum Walks with Two-Step Memory
We propose a new quantum-walk-based hash function QHF2M by combining two types of quantum walks with two-step memory and numerically test its statistical performance. The test result shows that QHF2M is on a par with the state-of-the-art hash functions based on discrete quantum walks in terms of sensitivity of hash value to message, diffusion and confusion properties, uniform distribution property, and collision resistance property. Moreover, both unequal and equivalent coin angles used by the underlying quantum walks can lead to near-ideal statistical performance. This result indicates that neither using quantum walks with different memory length nor adopting distinct coin angles is a necessary condition for constructing good quantum-walk-with-memory-based hash functions.
- Open Access
- 21 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 5, 1-13
A Stable Hash Function Based on Parity-Dependent Quantum Walks With Memory (August 2023)
In this paper, we develop a generic controlled alternate quantum-walk model (called CQWMP) by combining parity-dependent quantum walks with distinct arbitrary memory lengths and propose a hash function (called QHFM-P) based on this model. The statistical properties of the proposed scheme are stable with respect to the coin parameters of the underlying controlled quantum walks; with certain parameter values, the collision resistance property of QHFM-P is better than that of the state-of-the-art hash functions based on discrete quantum walks. Moreover, the proposed hash function can also maintain near-ideal statistical performance when the input message is of small length. Additionally, we derive a type of inappropriate initial states of hash functions based on one-dimensional one-particle quantum walks (with ordinary shift operator) on cycles, with which all messages will be mapped to the same hash value, regardless of the angles adopted by the coin parameters.
- 21 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 5, 1-13
Open AccessA Stable Hash Function Based on Parity-Dependent Quantum Walks With Memory (August 2023)
In this paper, we develop a generic controlled alternate quantum-walk model (called CQWMP) by combining parity-dependent quantum walks with distinct arbitrary memory lengths and propose a hash function (called QHFM-P) based on this model. The statistical properties of the proposed scheme are stable with respect to the coin parameters of the underlying controlled quantum walks; with certain parameter values, the collision resistance property of QHFM-P is better than that of the state-of-the-art hash functions based on discrete quantum walks. Moreover, the proposed hash function can also maintain near-ideal statistical performance when the input message is of small length. Additionally, we derive a type of inappropriate initial states of hash functions based on one-dimensional one-particle quantum walks (with ordinary shift operator) on cycles, with which all messages will be mapped to the same hash value, regardless of the angles adopted by the coin parameters.
- Open Access
- 24 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 3, 1-10
Hash Function Based on Controlled Alternate Quantum Walks With Memory (September 2021)
We propose a new hash function QHFM based on controlled alternate quantum walks with memory on cycles, where the jth message bit decides whether to run quantum walk with one-step memory or to run quantum walk with two-step memory at the jth time step, and the hash value is calculated from the resulting probability distribution of the walker. Numerical simulation shows that the proposed hash function has near-ideal statistical performance and is at least on a par with the state-of-the-art hash functions based on quantum walks in terms of sensitivity of hash value to message, diffusion and confusion properties, uniform distribution property, and collision resistance property; and theoretical analysis indicates that the time and space complexity of the new scheme are not greater than those of its peers. The good performance of QHFM suggests that quantum walks that differ not only in coin operators but also in memory lengths can be combined to build good hash functions, which, in turn, enriches the construction of controlled alternate quantum walks.
- 24 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 3, 1-10
Open AccessHash Function Based on Controlled Alternate Quantum Walks With Memory (September 2021)
We propose a new hash function QHFM based on controlled alternate quantum walks with memory on cycles, where the jth message bit decides whether to run quantum walk with one-step memory or to run quantum walk with two-step memory at the jth time step, and the hash value is calculated from the resulting probability distribution of the walker. Numerical simulation shows that the proposed hash function has near-ideal statistical performance and is at least on a par with the state-of-the-art hash functions based on quantum walks in terms of sensitivity of hash value to message, diffusion and confusion properties, uniform distribution property, and collision resistance property; and theoretical analysis indicates that the time and space complexity of the new scheme are not greater than those of its peers. The good performance of QHFM suggests that quantum walks that differ not only in coin operators but also in memory lengths can be combined to build good hash functions, which, in turn, enriches the construction of controlled alternate quantum walks.
- 1 October 2016
- Published by American Scientific Publishers in Journal of Computational and Theoretical Nanoscience
- Vol. 13 (10) , 7262-7265
The Constant Speedup Mechanism on Adiabatic Quantum Computation
In the adiabatic quantum computation model, a computational procedure is described by the continuous time evolution of a time dependent Hamiltonian. Classically, the unstructured search problem can be solved only in a running time of order O(G). However, by modifying the structure of local Hamiltonian or using specific interpolating functions, it is possible to do the calculation in constant time for a quantum computer. This paper reveals the cause that lead to the speedup. We analyze two kinds of specific adiabatic quantum models, and conclude that the value of relevant elements in back-diagonal of the local Hamiltonian is the main factors affecting the time complexity of adiabatic quantum algorithms. According to the speedup mechanism, we have proposed two kinds of adiabatic quantum algorithms to make a constant time complexity.
- 1 October 2016
- Published by American Scientific Publishers in Journal of Computational and Theoretical Nanoscience
- Vol. 13 (10) , 7262-7265
The Constant Speedup Mechanism on Adiabatic Quantum Computation
In the adiabatic quantum computation model, a computational procedure is described by the continuous time evolution of a time dependent Hamiltonian. Classically, the unstructured search problem can be solved only in a running time of order O(G). However, by modifying the structure of local Hamiltonian or using specific interpolating functions, it is possible to do the calculation in constant time for a quantum computer. This paper reveals the cause that lead to the speedup. We analyze two kinds of specific adiabatic quantum models, and conclude that the value of relevant elements in back-diagonal of the local Hamiltonian is the main factors affecting the time complexity of adiabatic quantum algorithms. According to the speedup mechanism, we have proposed two kinds of adiabatic quantum algorithms to make a constant time complexity.