Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time. This means that the increasing complexity of the graphs increased the algorithm's running time ...

The researchers have proven PLANAR's effectiveness on surface codes under particular noise conditions and plan to adapt it for non-planar graphs with finite genus, opening the door to broader use ...