Indexed by:
Abstract:
In this article, we propose an efficient quantum k-collision search algorithm with low quantum memory O(n). The previous quantum k-collision algorithms can not be converted into a low quantum memory k-collision algorithm directly, because the time complexity of the converted algorithm is larger than the basic k-collision algorithm. To solve this problem, we shall not only divide our low memory quantum k-collision algorithm into several subroutines, but also need to achieve some balances between these subroutines. The time complexity of our k-collision search algorithm is (O) over tilde (2((2k-2)n/2k+1-3)), and the classical memory and quantum memory complexities are (O) over tilde (2((2k-1-1)n/2k+1-3)) and O(n) respectively. In addition, we propose an efficient k-claw search algorithm, which can output a k-claw with O(n) qubits. Given 2(s) quantum processors, we can construct our quantum k-collision and k-claw parallel algorithm with the time of (O) over tilde (2 ((2k-2)n-(2k+1-2k-1-3)s/2k+1-3)), while the classical memory and quantum memory complexities are (O) over tilde (2 ((2k-1-1)n+s.2k-2/2k+1-3)) and O(n), respectively.
Keyword:
Reprint 's Address:
Email:
Source :
IEEE ACCESS
ISSN: 2169-3536
Year: 2020
Volume: 8
Page: 181619-181628
3 . 3 6 7
JCR@2020
3 . 4 0 0
JCR@2023
ESI Discipline: ENGINEERING;
ESI HC Threshold:132
JCR Journal Grade:2
CAS Journal Grade:2
Cited Count:
SCOPUS Cited Count: 2
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: