Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

Journal of Applied Probability, Vol. 58, No. 2 (JUNE 2021), pp. 394-410 (17 pages) We analyze average-based distributed algorithms relying on simple and pairwise random interactions among a large and ...

This approach enables block encoding of any sparse matrix with a clear gate-level construction, significantly reducing circuit complexity and control overhead, bringing quantum algorithms closer ...