From the 1 of 11 linked papers with an AI index.
11 papers
Quantum Codes with Transversal Gates and Sublinear -Stabilizers
Ohad Elishco, Itzhak Tamo
The paper presents a construction of asymmetric quantum CSS codes that support transversal CCZ gates, using algebraic expander codes to achieve linear X-distance and sublinear Z-di…
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…
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…
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…
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)…
Making it to First: The Random Access Problem in DNA Storage
Avital Boruchovsky, Ohad Elishco, Ryan Gabrys +3
In this paper, we study the Random Access Problem in DNA storage, which addresses the challenge of retrieving a specific information strand from a DNA-based storage system. In this…