Abstract: Although NP-complete problems have solutions that can be verified in polynomial time, their exponential computational complexity presents significant challenges for classical computing ...

Abstract: This study addresses the Most Frequent Item (MFI) problem with respect to noisy comparisons, which has implications of a quantum speed-up for this problem. We introduce two variants of noisy ...