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 in ...

For non-planar graphs, such solutions are computationally intractable," explained the researchers. The algorithm relies on the Kac-Ward formalism, a mathematical method that allows exact computation ...