7 citations · 22 across the 14 of their papers we have counts for
5 papers · 1 filter
Semi-Cliffordness of the Clifford hierarchy for a single qudit in composite dimensions
Yifei Qi, Rahul Sarkar
An important question in quantum information theory asks whether every gate in the Clifford hierarchy is semi-Clifford or not, as such gates admit resource-efficient implementation…
A finite arithmetic form of Robin's inequality and its equivalence to the Riemann hypothesis
Challenger Mishra, Rahul Sarkar
Robin's inequality reformulates the Riemann hypothesis as a bound on the sum-of-divisors function . We introduce a finite-truncation version of Robin's inequality determined int…
Constrained minimax approximation for quantum signal processing
Yulong Dong, James B. Larsen, Lin Lin +1
Quantum signal processing (QSP) provides a simple and efficient framework for implementing polynomial transformations using quantum circuits. Its classical design stage leads to a…
Quantum element-wise transforms
Zane M. Rossi, Rahul Sarkar
Quantum algorithms for basic numerical linear algebraic tasks have proven essential for translating diverse problems to a unified quantum computational context. Many of these tasks…
Overlapped groupings for quantum energy estimation: Maximal variance reduction and deterministic algorithms for reducing variance
Jeremiah Rowland, Rahul Sarkar, Nicolas PD Sawaya +2
Grouping-based measurement strategies are widely used to reduce measurement complexity in near-term quantum algorithms. While these schemes have typically produced disjoint groups,…