3 papers
quant-ph2026
Constraints on recovering quantum information after erasure
Mohammad A. Alhejji, Noah Lordi, Omkar Baraskar +2
Suppose that we encode quantum information into physical carriers. With what probabilities can we perfectly recover the quantum information after sets of carriers have been e…
math.NT2025
Bounds for sets of remainders
Omkar Baraskar, Ingrid Vukusic
Let be the number of different remainders , where . This rather natural sequence is sequence A283190 in the OEIS and while some…
cs.CC2024
NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
Omkar Baraskar, Agrim Dewan, Chandan Saha +1
An -sparse polynomial has at most monomials with nonzero coefficients. The Equivalence Testing problem for sparse polynomials (ETsparse) asks to decide if a given polynomial…