Catharine Lo

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In computational complexity, a significant amount of useful theory is built on a foundation of widely-believed conjectures about the separation of complexity classes, the most famous of which is P = NP. In this work, we examine the consequences of one such conjecture on the combinatorics of 3-manifold diagrams. We use basic tools from quantum computation to(More)
  • 1