{"ID":2822638,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2601.02233","arxiv_id":"2601.02233","title":"PauliEngine: High-Performant Symbolic Arithmetic for Quantum Operations","abstract":"Quantum computation is inherently hybrid, and fast classical manipulation of qubit operators is necessary to ensure scalability in quantum software. We introduce PauliEngine, a high-performance C++ framework that provides efficient primitives for Pauli string multiplication, commutators, symbolic phase tracking, and structural transformations. Built on a binary symplectic representation and optimized bit-wise operations, PauliEngine supports both numerical and symbolic coefficients and is accessible through a Python interface. Runtime benchmarks demonstrate substantial speedups over state-of-the-art implementations. PauliEngine provides a scalable backend for operator-based quantum software tools and simulations.","short_abstract":"Quantum computation is inherently hybrid, and fast classical manipulation of qubit operators is necessary to ensure scalability in quantum software. We introduce PauliEngine, a high-performance C++ framework that provides efficient primitives for Pauli string multiplication, commutators, symbolic phase tracking, and st...","url_abs":"https://arxiv.org/abs/2601.02233","url_pdf":"https://arxiv.org/pdf/2601.02233v1","authors":"[\"Leon Müller\",\"Adelina Bärligea\",\"Alexander Knapp\",\"Jakob S. Kottmann\"]","published":"2026-01-05T16:00:44Z","proceeding":"quant-ph","tasks":"[\"quant-ph\",\"cs.ET\",\"cs.SE\",\"physics.comp-ph\"]","methods":"[]","has_code":false}
