Speaker
Description
Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result of the ingenious thinking of a great mind. In this work, we complement human ingenuity with an algorithm. We leverage the classically efficient Clifford group to find symmetries for arbitrary many-body Hamiltonians via a graph representation. We demonstrate our method on examples including random Hamiltonians, the 2D transverse-field Ising model, and the Toric code. We consider instances with several hundreds of qubits and demonstrate how our approach can provide deeper understanding of the model. For instance, for all sizes of the 2D transverse-field Ising model, we determine a symmetry that, to our knowledge,was unknown