Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Symbolic solution for computational quantum many-body theory development

Jinmo Zhao

Published Mar 2, 2018• 3 citations
OpenAlex

Abstract

Computational many-body theories in quantum chemistry, condensed matter, and nuclear physics aim to provide sufficiently accurate description of and insights into the motion of many interacting particles. Due to their intrinsic complexity, the development of such theories generally involves very complex, tedious, and error-prone symbolic manipulations. Here a complete solution to automate the symbolics in many-body theory development is attempted. General data structures based on an existing computer algebra system are designed to specifically address the symbolic problems for which there is currently no satisfactory handling. Based on the data structures, algorithms are given to accomplish common symbolic manipulations and simplifications. Noncommutative algebraic systems, tensors with symmetry, and symbolic summations can all enjoy deep simplifications efficient enough for theories of very complex form. After the symbolic derivation, novel algorithms for automatic optimization of tensor contractions and their sums are devised, which can be used together with automatic code generation tools. In this way, the burden of symbolic tasks in theory development can be vastly reduced, with the potential to spare scientists more time and energy for the actual art and science of many-body theories.

Related papers

Symmetry reduction of tensor networks in many-body theory I. Automated symbolic evaluation of $SU(2)$ algebra

A. Tichai, R. Wirth, Ripoche, Julien +1 more

The ongoing progress in (nuclear) many-body theory is accompanied by an ever-rising increase in complexity of the underlying formalisms used to solve the stationary Schrödinger equation. The associated working equations at play in state-of-the-art ab initio nuclear many-body methods can be analytically reduced with respect to angular-momentum, i.e. $SU(2)$, quantum numbers whenever they are effectively employed in a symmetry-restricted context. The corresponding procedure constitutes a tedious and error-prone but yet an integral part of the implementation of those many-body frameworks. Indeed, this symmetry reduction is a key step to advance modern simulations to higher accuracy since the use of symmetry-adapted tensors can decrease the computational complexity by orders of magnitude. While attempts have been made in the past to automate the (anti-) commutation rules linked to Fermionic and Bosonic algebras at play in the derivation of the working equations, there is no systematic account to achieve the same goal for their symmetry reduction. In this work, the first version of an automated tool performing graph-theory-based angular-momentum reduction is presented. Taking the symmetry-unrestricted expressions of a generic tensor network as an input, the code provides their angular-momentum-reduced form in an error-safe way in a matter of seconds. Several state-of-the-art many-body methods serve as examples to demonstrate the generality of the approach and to highlight the potential impact on the many-body community.

arXiv:2002.05011•Feb 12, 2020•3 citations

Automated symbolic algebra for quantum chemistry

So Hirata

Today, state-of-the-art computational methods and programs for quantum theory for electron correlation may not be developed entirely manually. They are often constructed with the essential aid of symbolic algebra systems automating lengthy and error-prone mathematical derivation and computer implementation, inevitable in these developments. Recent progress in this new paradigm of chemical theory development—complete automation—is reviewed.

Journal of Physics Conference Series•Sep 1, 2006•8 citations

Symmetry reduction of tensor networks in many-body theory

A. Tichai, R. Wirth, J. Ripoche +1 more

Abstract The ongoing progress in (nuclear) many-body theory is accompanied by an ever-rising increase in complexity of the underlying formalisms used to solve the stationary Schrödinger equation. The associated working equations at play in state-of-the-art ab initio nuclear many-body methods can be analytically reduced with respect to angular-momentum, i.e. SU(2), quantum numbers whenever they are effectively employed in a symmetry-restricted context. The corresponding procedure constitutes a tedious and error-prone but yet an integral part of the implementation of those many-body frameworks. Indeed, this symmetry reduction is a key step to advance modern simulations to higher accuracy since the use of symmetry-adapted tensors can decrease the computational complexity by orders of magnitude. While attempts have been made in the past to automate the (anti-) commutation rules linked to Fermionic and Bosonic algebras at play in the derivation of the working equations, there is no systematic account to achieve the same goal for their symmetry reduction. In this work, the first version of an automated tool performing graph-theory-based angular-momentum reduction is presented. Taking the symmetry-unrestricted expressions of a generic tensor network as an input, the code provides their angular-momentum-reduced form in an error-safe way in a matter of seconds. Several state-of-the-art many-body methods serve as examples to demonstrate the generality of the approach and to highlight the potential impact on the many-body community.

The European Physical Journal A•Oct 1, 2020•16 citations

Automated Implementation of Advanced Electronic Structure Methods

Bimal Gaudel

The continuous demand for higher accuracy in computational chemistry necessitates the development of advanced many-body electronic structure methods. However, the derivation and efficient implementation of these theories constitute a significant bottleneck. As the rank of the associated tensors increases, the governing equations explode in complexity, rendering manual implementation labor-intensive, error-prone, and difficult to optimize for modern hardware. To address this challenge, this dissertation presents SeQuant, a comprehensive framework for the automated derivation and parallel implementation of many-body quantum chemistry methods. Built upon a robust symbolic algebra engine, SeQuant allows for the expression of theories in the natural language of second quantization. It automates the transformation of high-level theoretical ansatzes into explicit tensor contraction expressions and subsequently generates optimized, high-performance C++ code. A central innovation of this work is the extension of automated implementation to reduced-scaling methods, which exploit the sparsity inherent in electronic correlation. We introduce a novel "tensor-of-tensors" data structure designed to manage the irregular sparsity patterns of Pair Natural Orbital (PNO) formulations. This development enables the first fully automated implementation of PNO-Coupled Cluster (PNO-CC) methods, bridging the gap between symbolic abstraction and the runtime requirements of sparse tensor algebra. The results demonstrate that SeQuant not only reproduces established dense methods (such as CCSD and CCSDT) with high fidelity but also effectively handles the complexity of sparse, local correlation approaches. By decoupling the complexity of the physics from the details of the implementation, this framework establishes a new paradigm for method development, dramatically accelerating the translation of theoretical insights into computational reality.

•Feb 4, 2026•0 citations

DiracQ: A Package for Algebraic Manipulation of Non-Commuting Quantum Variables

John G. Wright, B. Sriram Shastry

In several problems of quantum many body physics, one is required to handle complex expressions originating in the non-commutative nature of quantum operators. Their manipulation requires precise ordering and application of simplification rules. This can be cumbersome, tedious and error prone, and often a challenge to the most expert researcher. In this paper we present a software package DiracQ to facilitate such manipulations. The package DiracQ consists of functions based upon and extending considerably the symbolic capabilities of Mathematica. With DiracQ, one can proceed with large scale algebraic manipulations of expressions containing combinations of ordinary numbers or symbols (the c-numbers) and arbitrary sets of non-commuting variables (the q-numbers) with user defined properties. The DiracQ package is user extendable and comes encoded with the algebraic properties of several standard operators in popular usage. These include Fermionic and Bosonic creation and annihilation operators, spin operators, and canonical position and momentum operators. An example book is provided with some suggestive calculations of large-scale algebraic manipulations.

Journal of Open Research Software•Nov 20, 2015•2 citations

Post-Wick theorems for symbolic manipulation of second-quantized expressions in atomic many-body perturbation theory

Andrei Derevianko

Manipulating expressions in many-body perturbation theory becomes unwieldily with increasing order of the perturbation theory. Here I derive a set of theorems for efficient simplification of such expressions. The derived rules are specifically designed for implementing with symbolic algebra tools. As an illustration, we count the numbers of Brueckner-Goldstone diagrams in the first several orders of many-body perturbation theory for matrix elements between two states of a mono-valent system.

arXiv:0910.3613•Journal of Physics B Atomic Molecular and Optical Physics•Mar 19, 2010•3 citations
Computational many-body theories in quantum chemistry, condensed matter, and nuclear physics aim to provide sufficiently accurate description of and insights into the motion of many interacting particles. Due to their intrinsic complexity, the development of such theories generally involves very complex, tedious, and error-prone symbolic manipulations. Here a complete solution to automate the symbolics in many-body theory development is attempted. General data structures based on an existing computer algebra system are designed to specifically address the symbolic problems for which there is currently no satisfactory handling. Based on the data structures, algorithms are given to accomplish common symbolic manipulations and simplifications. Noncommutative algebraic systems, tensors with symmetry, and symbolic summations can all enjoy deep simplifications efficient enough for theories of very complex form. After the symbolic derivation, novel algorithms for automatic optimization of tensor contractions and their sums are devised, which can be used together with automatic code generation tools. In this way, the burden of symbolic tasks in theory development can be vastly reduced, with the potential to spare scientists more time and energy for the actual art and science of many-body theories.
Symmetry reduction of tensor networks in many-body theory I. Automated symbolic evaluation of SU(2)SU(2)SU(2) algebra
The ongoing progress in (nuclear) many-body theory is accompanied by an ever-rising increase in complexity of the underlying formalisms used to solve the stationary Schrödinger equation. The associated working equations at play in state-of-the-art ab initio nuclear many-body methods can be analytically reduced with respect to angular-momentum, i.e. SU(2)SU(2)SU(2), quantum numbers whenever they are effectively employed in a symmetry-restricted context. The corresponding procedure constitutes a tedious and error-prone but yet an integral part of the implementation of those many-body frameworks. Indeed, this symmetry reduction is a key step to advance modern simulations to higher accuracy since the use of symmetry-adapted tensors can decrease the computational complexity by orders of magnitude. While attempts have been made in the past to automate the (anti-) commutation rules linked to Fermionic and Bosonic algebras at play in the derivation of the working equations, there is no systematic account to achieve the same goal for their symmetry reduction. In this work, the first version of an automated tool performing graph-theory-based angular-momentum reduction is presented. Taking the symmetry-unrestricted expressions of a generic tensor network as an input, the code provides their angular-momentum-reduced form in an error-safe way in a matter of seconds. Several state-of-the-art many-body methods serve as examples to demonstrate the generality of the approach and to highlight the potential impact on the many-body community.
Abstract The ongoing progress in (nuclear) many-body theory is accompanied by an ever-rising increase in complexity of the underlying formalisms used to solve the stationary Schrödinger equation. The associated working equations at play in state-of-the-art ab initio nuclear many-body methods can be analytically reduced with respect to angular-momentum, i.e. SU(2), quantum numbers whenever they are effectively employed in a symmetry-restricted context. The corresponding procedure constitutes a tedious and error-prone but yet an integral part of the implementation of those many-body frameworks. Indeed, this symmetry reduction is a key step to advance modern simulations to higher accuracy since the use of symmetry-adapted tensors can decrease the computational complexity by orders of magnitude. While attempts have been made in the past to automate the (anti-) commutation rules linked to Fermionic and Bosonic algebras at play in the derivation of the working equations, there is no systematic account to achieve the same goal for their symmetry reduction. In this work, the first version of an automated tool performing graph-theory-based angular-momentum reduction is presented. Taking the symmetry-unrestricted expressions of a generic tensor network as an input, the code provides their angular-momentum-reduced form in an error-safe way in a matter of seconds. Several state-of-the-art many-body methods serve as examples to demonstrate the generality of the approach and to highlight the potential impact on the many-body community.
The continuous demand for higher accuracy in computational chemistry necessitates the development of advanced many-body electronic structure methods. However, the derivation and efficient implementation of these theories constitute a significant bottleneck. As the rank of the associated tensors increases, the governing equations explode in complexity, rendering manual implementation labor-intensive, error-prone, and difficult to optimize for modern hardware. To address this challenge, this dissertation presents SeQuant, a comprehensive framework for the automated derivation and parallel implementation of many-body quantum chemistry methods. Built upon a robust symbolic algebra engine, SeQuant allows for the expression of theories in the natural language of second quantization. It automates the transformation of high-level theoretical ansatzes into explicit tensor contraction expressions and subsequently generates optimized, high-performance C++ code. A central innovation of this work is the extension of automated implementation to reduced-scaling methods, which exploit the sparsity inherent in electronic correlation. We introduce a novel "tensor-of-tensors" data structure designed to manage the irregular sparsity patterns of Pair Natural Orbital (PNO) formulations. This development enables the first fully automated implementation of PNO-Coupled Cluster (PNO-CC) methods, bridging the gap between symbolic abstraction and the runtime requirements of sparse tensor algebra. The results demonstrate that SeQuant not only reproduces established dense methods (such as CCSD and CCSDT) with high fidelity but also effectively handles the complexity of sparse, local correlation approaches. By decoupling the complexity of the physics from the details of the implementation, this framework establishes a new paradigm for method development, dramatically accelerating the translation of theoretical insights into computational reality.
In several problems of quantum many body physics, one is required to handle complex expressions originating in the non-commutative nature of quantum operators. Their manipulation requires precise ordering and application of simplification rules. This can be cumbersome, tedious and error prone, and often a challenge to the most expert researcher. In this paper we present a software package DiracQ to facilitate such manipulations. The package DiracQ consists of functions based upon and extending considerably the symbolic capabilities of Mathematica. With DiracQ, one can proceed with large scale algebraic manipulations of expressions containing combinations of ordinary numbers or symbols (the c-numbers) and arbitrary sets of non-commuting variables (the q-numbers) with user defined properties. The DiracQ package is user extendable and comes encoded with the algebraic properties of several standard operators in popular usage. These include Fermionic and Bosonic creation and annihilation operators, spin operators, and canonical position and momentum operators. An example book is provided with some suggestive calculations of large-scale algebraic manipulations.