Sidhant Saraogi

activity

20212026

most citedPulse-level noisy quantum circuits with QuTiP

56 citations · 56 across the 4 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

cs.CC2026

Improved Subexponential Upper Bounds for $3$ -Restricted Matching Vector Families

Sidhant Saraogi

Matching Vector families (MVFs) are defined by two ordered lists of vectors in $Z_{m}^{n}$ whose inner products satisfy specific residue patterns modulo an integer $m$ . Most f…

cs.DS2026

Online Orthogonal Vectors Revisited

Karthik Gajulapalli, Alexander Golovnev, Samuel King +1

We prove new upper and lower bounds for the Online Orthogonal Vectors Problem ( $OnlineOV_{n, d}$ ). In this problem, a preprocessing algorithm receives $n$ vectors $x_1,\ldo…

Improved Subexponential Upper Bounds for 3-Restricted Matching Vector Families

Online Orthogonal Vectors Revisited

Improved Subexponential Upper Bounds for $3$ -Restricted Matching Vector Families