An Efficient Quantum Multi-Collision Search Algorithm
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...
Main Authors: | Jian Zou, Yongyang Liu, Le Dong |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9212378/ |
Similar Items
-
Hermite-Hadamard Type Inequalities via Exponentially (p, h)-Convex Functions
by: N. Mehreen, et al.
Published: (2020-01-01) -
On a Family of Quantum Synchronizable Codes Based on the <inline-formula> <tex-math notation="LaTeX">$(\lambda(u + v)|u - v)$ </tex-math></inline-formula> Construction
by: Chao Du, et al.
Published: (2020-01-01) -
A Certain Class of <italic>t</italic>-Intuitionistic Fuzzy Subgroups
by: Muhammad Gulzar, et al.
Published: (2020-01-01) -
<inline-formula> <tex-math notation="LaTeX">$\ell m_p$ </tex-math></inline-formula>: A Novel Similarity Measure for Matching Local Image Descriptors
by: Guohua Lv
Published: (2018-01-01) -
Antimagicness of <inline-formula> <tex-math notation="LaTeX">$mC_n$ </tex-math></inline-formula>-Path and Its Disjoint Union
by: Yi Hu, et al.
Published: (2019-01-01)