1 citations · 1 across the 9 of their papers we have counts for
12 papers
A noise-level-free parameter-choice rule for iterated Lavrentiev regularization of nonlinear potential monotone ill-posed problems
Ankit singh, Hemant Sharma
We consider nonlinear ill-posed operator equations in a Hilbert space, where is monotone with a Lipschitz continuous Fréchet derivative that is self-adjoint near the s…
Iterated Lavrentiev regularization under random noise: variational source conditions and rates in expectation
Ankit Singh, Hemant Sharma, Kiran Davuluri
The convergence theory of iterated Lavrentiev regularization for nonlinear monotone ill-posed equations is deterministic: the data error is bounded by a known level that the discre…
Logical information localisation in stabiliser codes via single-qubit measurements
Jelena Mackeprang, Hemant Sharma, Jonas Helsen
Stabiliser path finding (SPF) has previously been introduced as a method to localise logical information in a stabiliser code undergoing loss onto a single pre-specified target qub…
Sharp Spectral Bounds for Symmetric Positive Definite Tensors via Multiple Algebraic Invariants
Hemant Sharma, Snigdhashree Nayak, Ankit Singh
We extend the trace--determinant framework of Nayak, Sharma, and Mishra~\cite{nayak2026} for bounding the H-eigenvalues of symmetric positive definite tensors. First, we replace th…
Randomized Estimation of T-Eigenvalues of T-SPD Tensors: A Two-Sided Bracket
Hemant Sharma, Nachiketa Mishra
In earlier work \cite{sharma2025} we developed deterministic analytical bounds on the T-eigenvalues of symmetric positive definite (SPD) third-order tensors under the Kilmer--Marti…
CVEvolve: Autonomous Algorithm Discovery for Unstructured Scientific Data Processing
Ming Du, Xiangyu Yin, Yanqi Luo +4
Scientific data processing often requires task-specific algorithms or AI models, creating a barrier for domain scientists who need to analyze their data but may not have extensive…
Sharp Convergence Rates and Optimal Weights for Cimmino's Reflection Algorithm
Hemant Sharma
In this paper, Cimmino's classical reflection algorithm for solving the nonsingular linear system $A\bx=\bb$ is analysed through the lens of spectral theory. Reformulat…
Spectral Bounds for Tensors Derived from Trace Functionals and Wasserstein Distance in Tensor Spaces
Hemant Sharma, Nachiketa Mishra
This article introduces a trace-based metric on the space of positive semi-definite (PSD) tensors, offering a geometric perspective that connects their algebraic structure to their…
Eigenbounds of symmetric positive definite tensors
Snigdhashree Nayak, Hemant Sharma, Nachiketa Mishra
This article introduces an algebraic framework for establishing eigenvalue bounds for symmetric positive definite tensors by leveraging intrinsic invariants, specifically the trace…
Iterative Methods for Computing the T-Square Root of Third-Order Tensors
Hemant Sharma, Nachiketa Mishra
We develop and analyze iterative methods for computing the principal square root of third-order tensors under the T-product framework. Tensor extensions of the Newton iteration (qu…
Minimising the number of edges in LC-equivalent graph states
Hemant Sharma, Kenneth Goodenough, Johannes Borregaard +2
Graph states are a powerful class of entangled states with numerous applications in quantum communication and quantum computation. Local Clifford (LC) operations that map one graph…
Catalytic entanglement transformations with noisy hardware
Hemant Sharma, Aleksandr Mokeev, Jonas Helsen +1
The availability of certain entangled resource states (catalyst states) can enhance the rate of converting several less entangled states into fewer highly entangled states in a pro…