The $2\times3$ magic rectangle is a nonlocal game in which two players match entries subject to incompatible parity constraints. We prove that its quantum value is $(1+\sqrt{2/3})/2$ and classify all optimal strategies in arbitrary finite local dimensions, allowing general measurements. Every optimal strategy contains...
Isaac Barouch Essayag, Aryeh Lev Zabokritskiy· 0 citations
We study leakage from Shamir secret sharing when each device uses its share to produce one qubit from an initial quantum resource independent of the secret and sharing randomness. We prove exponentially small trace distance between the leakage states of any two secrets, when reconstruction requires a sufficiently large...
Isaac Barouch Essayag, Aryeh Lev Zabokritskiy· 0 citations
Quantum-hardware scores vary across workloads and execution times through repeated communication and deletion-recovery experiments on superconducting and trapped-ion hardware, and these measurements characterize complete compiled workloads at dated executions.
Isaac Barouch Essayag, Aryeh Lev Zabokritskiy· 0 citations
Let $C_m:=\mathrm{BCH}(3,m)$ be the binary primitive triple-error-correcting BCH code of length $2^m-1$. We determine its second generalized covering radius exactly: $R_2(C_m)=8$ for every $m\geq5$. Equivalently, every two-dimensional syndrome subspace is contained in the binary span of at most eight parity-check colum...
Isaac Barouch Essayag, Aryeh Lev Zabokritskiy· 6 citations
The generalized packing--covering conjecture asks whether, at every order, the packing radius of a linear code is at most its covering radius. We prove the conjecture for every linear code of redundancy at most fourteen over every finite field, extending the previously established range of redundancies at most seven. W...
Isaac Barouch Essayag, Aryeh Lev Zabokritskiy· 2 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
