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

Bulletin of the American Physical Society

Channel-decomposed solution of the parquet equations in the two-dimensional Hubbard model

Christian Eckhardt, G. A. H. Schober, Carsten Honerkamp A

Published Mar 8, 2018• 0 citations
OpenAlex

Related papers

Self-consistent solution of the Hubbard model on a 4x4 cluster with the parquet formalism

Herbert F. Fotso, Shuxiang Yang, Jun Liu +6 more

Bulletin of the American Physical Society•Mar 15, 2010•0 citations

Parquet approximation calculation for the 2D Hubbard model

Shuxiang Yang, Herbert F. Fotso, Jun Liu +6 more

Bulletin of the American Physical Society•Mar 17, 2009•0 citations

Self-consistent solution for the Hubbard model at the two-particle and one-particle level using the parquet formalism.

Herbert F. Fotso, Shuxiang Yang, Jun Liu +5 more

Bulletin of the American Physical Society•Mar 17, 2009•0 citations

Conserving approximations for strongly fluctuating electron systems. II. Numerical results and parquet extension

N. E. Bickers, Steven R. White

We describe an iterative technique for solution of the de Dominicis--Martin parquet equations for lattice electrons and state the relationship of this approach to conserving extensions of Hartree-Fock theory. We propose a physically motivated and computationally feasible pseudopotential approximation, which allows the solution of the parquet equations for the two-dimensional Hubbard model. We present calculations of static and dynamic Hubbard-model correlation functions based on the pseudopotential parquet and a simpler conserving approximation. For a wide parameter range the pseudopotential parquet results are in nearly quantitative agreement with finite-lattice quantum Monte Carlo results.

Physical review. B, Condensed matter•Apr 1, 1991•319 citations

Truncated-unity parquet equations: Application to the repulsive Hubbard model

Christian Eckhardt, G. A. H. Schober, Jannis Ehrlich +1 more

The parquet equations are a self-consistent set of equations for the effective two-particle vertex of an interacting many-fermion system. The application of these equations to bulk models is, however, demanding due to the complex emergent momentum and frequency structure of the vertex. Here, we show how a channel decomposition by means of truncated unities, which was developed in the context of the functional renormalization group to efficiently treat the momentum dependence, can be transferred to the parquet equations. This leads to a significantly reduced complexity and memory consumption scaling only linearly with the number of discrete momenta. We apply this technique to the half-filled repulsive Hubbard model on the square lattice and present approximate solutions for the channel-projected vertices and the full reducible vertex.

arXiv:1802.09797•Physical review. B./Physical review. B•Aug 24, 2018•26 citations

Two-particle calculations with quantics tensor trains: Solving the parquet equations

Stefan Rohshap, Marc K. Ritter, Hiroshi Shinaoka +3 more

We present an application of quantics tensor trains (QTTs) and tensor cross interpolation (TCI) to the solution of a full set of self-consistent equations for multivariate functions, the so-called parquet equations. We show that the steps needed to evaluate the equations (Bethe-Salpeter equations, parquet equation, and Schwinger-Dyson equation) can be decomposed into basic operations on the QTT-TCI compressed objects. The repeated application of these operations does not lead to a loss of accuracy beyond a specified tolerance and the iterative scheme converges even for numerically demanding parameters. As examples, we take the Hubbard model in the atomic limit and the single impurity Anderson model, where the basic objects in parquet equations, the two-particle vertices, depend on three frequencies, but not on momenta. The results show that this approach is able to overcome major computational bottlenecks of standard numerical methods. The applied methods allow for an exponential increase of the number of grid points included in the calculations, and a corresponding exponential reduction of the computational error, for a linear increase in computational cost.

arXiv:2410.22975•Physical Review Research•Apr 24, 2025•17 citations
We describe an iterative technique for solution of the de Dominicis--Martin parquet equations for lattice electrons and state the relationship of this approach to conserving extensions of Hartree-Fock theory. We propose a physically motivated and computationally feasible pseudopotential approximation, which allows the solution of the parquet equations for the two-dimensional Hubbard model. We present calculations of static and dynamic Hubbard-model correlation functions based on the pseudopotential parquet and a simpler conserving approximation. For a wide parameter range the pseudopotential parquet results are in nearly quantitative agreement with finite-lattice quantum Monte Carlo results.
The parquet equations are a self-consistent set of equations for the effective two-particle vertex of an interacting many-fermion system. The application of these equations to bulk models is, however, demanding due to the complex emergent momentum and frequency structure of the vertex. Here, we show how a channel decomposition by means of truncated unities, which was developed in the context of the functional renormalization group to efficiently treat the momentum dependence, can be transferred to the parquet equations. This leads to a significantly reduced complexity and memory consumption scaling only linearly with the number of discrete momenta. We apply this technique to the half-filled repulsive Hubbard model on the square lattice and present approximate solutions for the channel-projected vertices and the full reducible vertex.
We present an application of quantics tensor trains (QTTs) and tensor cross interpolation (TCI) to the solution of a full set of self-consistent equations for multivariate functions, the so-called parquet equations. We show that the steps needed to evaluate the equations (Bethe-Salpeter equations, parquet equation, and Schwinger-Dyson equation) can be decomposed into basic operations on the QTT-TCI compressed objects. The repeated application of these operations does not lead to a loss of accuracy beyond a specified tolerance and the iterative scheme converges even for numerically demanding parameters. As examples, we take the Hubbard model in the atomic limit and the single impurity Anderson model, where the basic objects in parquet equations, the two-particle vertices, depend on three frequencies, but not on momenta. The results show that this approach is able to overcome major computational bottlenecks of standard numerical methods. The applied methods allow for an exponential increase of the number of grid points included in the calculations, and a corresponding exponential reduction of the computational error, for a linear increase in computational cost.