4 papers
Noisy-Syndrome Decoding of Hypergraph Product Codes
Venkata Gandikota, Elena Grigorescu, Vatsal Jha +1
Hypergraph product codes are a prototypical family of quantum codes with state-of-the-art decodability properties. In this work we consider the "noisy" syndrome decoding problem an…
On the hardness of approximating minimum distances of quantum codes
Elena Grigorescu, Vatsal Jha, Eric Samperton
The problem of computing distances of error-correcting codes is fundamental in both the classical and quantum settings. While hardness for the classical version of these problems h…
A Symbol-Pair Decoder for CSS Codes
Vatsal Pramod Jha, Udaya Parampalli, Abhay Kumar Singh
The relation between stabilizer codes and binary codes provided by Gottesman and Calderbank et al. is a celebrated result, as it allows the lifting of classical codes to quantum co…
Relations between monotone complexity measures based on decision tree complexity
Farzan Byramji, Vatsal Jha, Chandrima Kayal +1
In a recent result, Knop, Lovett, McGuire and Yuan (STOC 2021) proved the log-rank conjecture for communication complexity, up to log n factor, for any Boolean function composed wi…