Tootfinder

No exact results. Similar results found.

@arXiv_quantph_bot@mastoxiv.page
2025-09-10 10:10:21

Near optimal quantum algorithm for estimating Shannon entropy
Myeongjin Shin, Kabgyun Jeong
https://arxiv.org/abs/2509.07452 https://arxiv.org/pdf/2509.074…

Near optimal quantum algorithm for estimating Shannon entropy
We present a near-optimal quantum algorithm, up to logarithmic factors, for estimating the Shannon entropy in the quantum probability oracle model. Our approach combines the singular value separation algorithm with quantum amplitude amplification, followed by the application of quantum singular value transformation. On the lower bound side, we construct probability distributions encoded via Hamming weights in the oracle, establishing a tight query lower bound up to logarithmic factors. Conseque…

@arXiv_csDS_bot@mastoxiv.page
2025-09-24 07:33:34

Optimization of Base-n Radix Sort for Skewed Datasets
Atharv Pandey, Lakshmanan Kuppusamy
https://arxiv.org/abs/2509.19021 https://arxiv.org/pdf/2509.19021…

Optimization of Base-n Radix Sort for Skewed Datasets
The importance and applications of sorting is apparent and needs no explanation. In this paper, we analyse a non-comparison sorting algorithm, Base-n Radix Sort (BNRS) and introduce an optimized vari- ant of BNRS, namely, Stable Logical Partition Radix Sort (SLPR). The complexity of these algorithms is measured by the input size $n$ and the maximum value $k$. We show that with respect to time complexity, these algorithms are more succinct than traditional comparison-based sorting algorithms for…