A High-Performance Pauli-Algebra Framework for Large-Scale Quantum Simulations

• URL: http://arxiv.org/abs/2606.28952v1
• Date: Sat, 27 Jun 2026 14:51:19 GMT
• Title: A High-Performance Pauli-Algebra Framework for Large-Scale Quantum Simulations
• Abstract summary: We present a high-performance Pauli-algebra framework tailored to quantum many-body and quantum-chemical simulations.<n>The framework combines compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse operator representations.<n>The resulting Julia/Ctexttt++ implementation accelerates Pauli multiplication, Hamiltonian construction, and operator--state multiplication in sparse and symmetry-adapted many-electron spaces.
• Score: 17.193239183791277
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficient manipulation of Pauli-algebraic objects is a key bottleneck in the classical emulation and benchmarking of quantum algorithms for chemistry and many-body physics. This bottleneck appears in Hamiltonian construction, variational ansatz preparation, expectation-value and gradient evaluation, and real-time propagation, all of which require repeated Pauli-algebra operations. Here, we present a high-performance Pauli-algebra framework tailored to quantum many-body and quantum-chemical simulations. The framework combines compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse operator representations that exploit shared bit-flip patterns among Pauli strings. The resulting Julia/C\texttt{++} implementation accelerates Pauli multiplication, Hamiltonian construction, and operator--state multiplication in sparse and symmetry-adapted many-electron spaces. Benchmarks demonstrate efficient Hamiltonian construction, large-active-space VQE and ADAPT-VQE calculations, and real-time variational dynamics on modern multicore CPU and GPU architectures. These results show that structure-aware Pauli-algebra engines provide a scalable classical backend for developing and benchmarking quantum algorithms in quantum chemistry and many-body simulation.

Related papers

• GadIR: A Spatial-Topology Preserving Compiler for Quantum Many-Body Systems Simulation [36.60979754972173]
  We introduce a spatial-topology preserving compiler for quantum many-body simulation.<n>Using Pauli gadgets as the representations of the Hamiltonian, we preserve the spatial-topology information of original physical models.<n>Our compiler backend performs trotterization and scheduling on Pauli gadgets, then synthesizes the Pauli gadgets into hardware-native quantum programs.
  arXiv  Detail & Related papers  (2026-09-01T18:42:13Z)
• Matrix Product Operators In The Age of Block Encoding [0.0]
  We develop a block-encoding compiler that speeds up linear combination of unitaries Hamiltonian simulation programs by treating matrix product operators as compressed, virtual-path LCU programs.<n>Our algorithms show how classical pre-processing in terms of tensor network data structures opens new avenues to accelerate quantum algorithms.
  arXiv  Detail & Related papers  (2026-06-17T13:53:02Z)
• On Performance and Limitations of NISQ Hardware for Simulations of Quantum Wave Packet Dynamics [2.1204495827342438]
  We investigate one-dimensional wave packet dynamics using a grid-based encoding of wave function onto qubit registers.<n>Time evolution is implemented via split-operator approach, with kinetic energy operator applied.<n>We benchmark this approach on classical simulators and quantum hardware.
  arXiv  Detail & Related papers  (2026-05-19T16:33:26Z)
• PauliEngine: High-Performant Symbolic Arithmetic for Quantum Operations [39.36424353588699]
  We introduce PauliEngine, a high-performance C++ framework that provides efficient primitives for Pauli string, commutators, symbolic phase tracking, and structural transformations.<n>PauliEngine supports both numerical and symbolic coefficients and is accessible through a Python interface.
  arXiv  Detail & Related papers  (2026-01-05T16:00:44Z)
• Pauli Propagation: A Computational Framework for Simulating Quantum Systems [0.0]
  We provide a comprehensive account of Pauli propagation, tracing its algorithmic structure from its bit-level implementation to its high-level user applications.<n>We present Pauli propagation.jl, a Julia software package that can perform rapid Pauli propagation simulation straight out-of-the-box.
  arXiv  Detail & Related papers  (2025-05-27T17:52:57Z)
• Quantum many-body simulations with PauliStrings.jl [0.0]
  We present the Julia package PauliStrings for quantum many-body simulations.<n>It performs fast operations on the Pauli group by encoding Pauli strings in binary.<n>We show that this representation allows for easy encoding of any geometry.
  arXiv  Detail & Related papers  (2024-10-12T21:18:47Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• Fast Classical Simulation of Hamiltonian Dynamics by Simultaneous Diagonalization Using Clifford Transformation with Parallel Computation [0.8206877486958002]
  We propose a technique to accelerate simulation of quantum dynamics via simultaneous diagonalization of mutually commuting Pauli groups. Compared to an implementation using one of the fastest simulators of quantum computers, our method provides a few tens of times acceleration.
  arXiv  Detail & Related papers  (2022-06-23T12:39:54Z)
• QuaSiMo: A Composable Library to Program Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-05-17T16:17:57Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Composable Programming of Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-01-20T14:20:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.