research
∙
06/21/2023
Single-shot decoding of good quantum LDPC codes
Quantum Tanner codes constitute a family of quantum low-density parity-c...
share
research
∙
10/06/2022
NLTS Hamiltonians from classical LTCs
We provide a completely self-contained construction of a family of NLTS ...
research
∙
09/23/2022
Quantum Locally Testable Code with Exotic Parameters
In this paper, we present a few simple constructions of quantum locally ...
research
∙
11/05/2021
Breaking the n^k Barrier for Minimum k-cut on Simple Graphs
In the minimum k-cut problem, we want to find the minimum number of edge...
research
∙
11/26/2020
Tight Bound on Vertex Cut Sparsifiers in Directed Acyclic Graphs
For an unweighted graph on k terminals, Kratsch and Wahlström constructe...
research
∙
02/28/2018