Skip to content

Author

R. Ostrovsky

4 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Sep 2026

Metric Self-Dual Completion and Optimal Additive Hardness for Quantum and Graph-State Distance

We prove that the quantum code distance is NP-hard to approximate within an additive error of $c N$, for some constant $c>0$, where $N$ is the number of qubits. Our reductions are deterministic. This improves the previous square-root additive gap to $\Omega(N)$ and resolves the explicitly stated linear-gap question of...

R. Ostrovsky · 1 citation

UvA-DARE (Digital

Harrybuhrman, Nishanthchandran, Sergefehr et al. · 0 citations

Succinct Arguments for

Y. Ishai, R. Ostrovsky, Akash Shah · 0 citations

with Dishonest Majority for Long Messages

The result shortens the gap between the information-theoretic setting and the computational setting, and between the optimal communication protocol and the optimal round protocol in the information-theoretic setting for t < n .

Wutichai Chongchitmate, R. Ostrovsky · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.