activity
20092026
most citedA family of optimal locally recoverable codes

618 citations · 1.2k across the 56 of their papers we have counts for

collaborators

69 papers

quant-ph2026

Improved Transversal Non-Clifford Gates from Cup Products

Louis Golowich, Itzhak Tamo, Guanyu Zhu

It is a major challenge in quantum fault-tolerance to obtain low-overhead protocols for performing non-Clifford gates. In this vein, we construct quantum codes with low-weight stab…

cs.IT2026

Quantum Codes with Transversal Gates and Sublinear -Stabilizers

Ohad Elishco, Itzhak Tamo

We construct asymmetric quantum CSS codes with transversal \(CCZ\) gates from algebraic expander codes \cite{KT26}. For every fixed \(m\ge 3\), our growing-alphabet codes have leng…

quant-ph2026

Breaking the bicycle frame: Coset-based quantum LDPC codes

Arda Aydin, Itzhak Tamo, Alexander Barg

Generalizing the construction of two-block group algebra (2BGA) codes, we introduce a family of two-block quantum LDPC codes constructed using the action of a group on the cosets o…

cs.IT2026

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds

Amit Berman, Yaron Shany, Itzhak Tamo

Products of MDS codes are of major practical importance; for a recent example, they are used in Data Availability Sampling (DAS) in blockchain networks such as Celestia and as part…

cs.IT2026

Algebraic Expander Codes

Swastik Kopparty, Itzhak Tamo

Expander (Tanner) codes combine sparse graphs with local constraints, enabling linear-time decoding and asymptotically good distance--rate tradeoffs. A standard constraint-counting…

quant-ph2025

Pure-State Quantum Tomography with Minimal Rank-One POVMs

Dan Edidin, Ivan Gonzalez, Itzhak Tamo

Quantum state tomography seeks to reconstruct an unknown state from measurement statistics. A finite measurement (POVM) is \emph{pure-state informationally complete} (PSI-Complete)…