20 citations · 52 across the 16 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2025
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…
quant-ph2022
Topological quantum computation is hyperbolic
Eric Samperton
We show that a topological quantum computer based on the evaluation of a Witten-Reshetikhin-Turaev TQFT invariant of knots can always be arranged so that the knot diagrams with whi…
quant-ph2018★ 12 cited
Haah codes on general three manifolds
Kevin T. Tian, Eric Samperton, Zhenghan Wang
Haah codes represent a singularly interesting gapped Hamiltonian schema that has resisted a natural generalization, although recent work shows that the closely related type I fract…