2026-08-14 –, Muschel — N3
I will present PauliStrings.jl, a package for quantum many-body simulations, which performs fast operations on the Pauli group by encoding Pauli strings in binary. When combined with various truncation methods, this representation provides performance advantages for solving certain kinds of problems.
PauliStrings.jl also allows for symbolic calculations, is a natural platform to take advantage of symmetries and is a fun and pedagogical tool to visualize quantum algebra.
PauliStrings.jl provides a competitive platform for studying quantum many-body dynamics by representing operators as sets of Pauli strings encoded in binary.
We have shown that this encoding can be advantageous for numerical simulation of quantum dynamics. The advantage arises from two key features: (i) The Pauli string algebra is encoded in low-level logic operations on integers, making it very efficient to numerically store and multiply strings together. (ii) Operators can be systematically truncated to some precision by discarding strings with negligibly small weight. This allows one to keep the number of strings manageable at the cost of some incurred error.
We will present examples of this for Heisenberg time evolution and Krylov subspace expansion through the recursion method. One of the important strengths of Pauli strings is that they provide a natural framework to take advantage of noise to make simulations tractable. In addition, though tensor network methods quickly break down with increasing long-range entanglement, some systems with this type of entanglement can still be decomposed into a small number of strings, making Pauli strings more efficient for these kinds of systems. Furthermore, Pauli string methods are not as limited in spatial dimension and geometry, and arbitrary geometries are easy to implement.
In this talk I will focus on new features of PauliStrings.jl : symbolic calculations and exploitation of translation symmetries.
Postdoc researcher at Niels Bohr Institute, Copenhagen