pith. sign in

arxiv: 2606.18397 · v1 · pith:HGBXLTQAnew · submitted 2026-06-16 · 🌀 gr-qc · hep-th· physics.comp-ph

A matrix free action of the Ashtekar-Lewandowski volume operator of loop quantum gravity

Waleed Sherif This is my paper

Pith reviewed 2026-06-26 23:17 UTC · model grok-4.3

classification 🌀 gr-qc hep-thphysics.comp-ph
keywords Ashtekar-Lewandowski volume operatorloop quantum gravitymatrix-free methodsshifted-resolvent quadraturerecoupling theoryvolume densityHamiltonian constraintkinematical Hilbert space
0
0 comments X

The pith

The Ashtekar-Lewandowski volume operator admits a matrix-free action through shifted-resolvent quadrature on its oriented density.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper develops a matrix-free method to apply the Ashtekar-Lewandowski volume operator in loop quantum gravity. It uses the Brunnemann-Thiemann expression for the volume density whose elements are generated locally via recoupling theory, combined with a shifted-resolvent quadrature approximation for the fourth root. The approach avoids forming dense matrices, which previously limited computations to small spin values. It exactly preserves the kernel of the operator and includes error estimates. This enables numerical work on larger graphs and higher spins, including Monte Carlo estimates at spin cutoffs where exact methods fail.

Core claim

We formulate a matrix free action of the SU(2) AL vertex volume operator in standard recoupling basis, making use of the Brunnemann-Thiemann expression for the oriented AL volume density Q_v whose matrix elements can be generated locally from recoupling theory without forming the full matrix. Based on the Balakrishnan-Stieltjes representation of (Q_v²)^{1/4} we approximate the volume by shifted-resolvent quadrature (SRQ). We prove exact preservation of the volume kernel, provide operator-norm and residual error estimates, discuss sector-wise scaling bounds, and validate the method on an embedded K_5 graph at small spin cutoffs against exact dense local-block operators.

What carries the argument

shifted-resolvent quadrature (SRQ) applied to the Balakrishnan-Stieltjes representation of (Q_v²)^{1/4}, where Q_v is the Brunnemann-Thiemann oriented volume density with locally generated recoupling matrix elements

Load-bearing premise

The chosen quadrature nodes and weights together with the sector-wise bound parameters accurately reproduce the action of the fourth-root operator on the relevant subspace without introducing errors that accumulate under repeated application.

What would settle it

Apply both the SRQ method and an exact dense-matrix computation to the same embedded graph state at a moderate spin cutoff where the full local blocks still fit in memory, then verify whether the difference in output vectors lies inside the stated residual and operator-norm error bounds.

Figures

Figures reproduced from arXiv: 2606.18397 by Waleed Sherif.

Figure 1
Figure 1. Figure 1: Vertex-resolved convergence of the SRQ approximation on the fixed [PITH_FULL_IMAGE:figures/full_fig_p010_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Entrywise dense-block validation of the SRQ volume action in a homogeneous [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Matrix free SRQ Monte Carlo estimates of high-cutoff [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Sensitivity of the Ashtekar-Lewandowski vertex-volume expectation values to [PITH_FULL_IMAGE:figures/full_fig_p014_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Kernel preservation of the SRQ vertex-volume approximation on [PITH_FULL_IMAGE:figures/full_fig_p015_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Direct SRQ-SLQ spectral-density estimate for a homogeneous 5-valent spin-12 [PITH_FULL_IMAGE:figures/full_fig_p017_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Probe dependence of the direct SRQ-SLQ spectral-density estimate for a [PITH_FULL_IMAGE:figures/full_fig_p018_7.png] view at source ↗
read the original abstract

The Ashtekar-Lewandowski (AL) volume operator of loop quantum gravity is central to the Hamiltonian constraint, but its vertex action is usually obtained from dense spectral decompositions of finite recoupling matrices, obstructing numerical analysis on large kinematical Hilbert spaces or high-valence vertices. We formulate a matrix free action of the $SU(2)$ AL vertex volume operator in standard recoupling basis, making use of the Brunnemann-Thiemann expression for the oriented AL volume density $Q_{v}$ whose matrix elements can be generated locally from recoupling theory without forming the full matrix. Based on the Balakrishnan-Stieltjes representation of $(Q_{v}^{2})^{1/4}$ we approximate the volume by shifted-resolvent quadrature (SRQ). The resulting action uses only repeated applications of $Q_{v}$ and shifted positive linear solves, making it compatible with multi-shift Krylov methods. We prove exact preservation of the volume kernel, provide operator-norm and residual error estimates, discuss sector-wise scaling bounds, and validate the method on an embedded $K_{5}$ graph at small spin cutoffs against exact dense local-block operators. Numerical simulations show rapid convergence of vertex expectation values, controlled dependence on bound parameters, and exact preservation of zero-volume modes. We further demonstrate matrix free Monte Carlo estimates at doubled-spin cutoff $2j=250000$ beyond dense materialisation, and show that SRQ can be combined with stochastic Lanczos quadrature to estimate fixed-sector volume spectral measures without dense volume matrices.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The manuscript develops a matrix-free action for the SU(2) Ashtekar-Lewandowski volume operator in the standard recoupling basis. It employs the Brunnemann-Thiemann expression for the oriented volume density Q_v (whose matrix elements are generated locally) and approximates (Q_v²)^{1/4} via shifted-resolvent quadrature (SRQ) based on the Balakrishnan-Stieltjes representation. The paper proves exact kernel preservation, supplies operator-norm and residual error estimates, discusses sector-wise scaling bounds, validates the approach on an embedded K_5 graph at small spin cutoffs against dense local-block operators, demonstrates Monte Carlo estimates at 2j=250000, and combines SRQ with stochastic Lanczos quadrature for fixed-sector spectral measures.

Significance. If the error control and sector-wise bounds hold with the stated accuracy at high spins and valences, the method would enable numerical exploration of the volume operator on kinematical Hilbert spaces far beyond the reach of dense-matrix techniques, which is a concrete advance for LQG Hamiltonian-constraint studies. The explicit proofs of kernel preservation, the operator-norm/residual estimates, and the compatibility with multi-shift Krylov and stochastic Lanczos methods are genuine strengths that distinguish the work from purely numerical proposals.

major comments (1)
  1. [Numerical results and Monte Carlo demonstration] The operator-norm and residual error estimates, together with the sector-wise scaling bounds, are validated only against exact dense local-block operators on the embedded K_5 graph at small spin cutoffs. The Monte Carlo estimates at doubled-spin cutoff 2j=250000 and the stochastic Lanczos spectral measures therefore rest on the assumption that the same quadrature-node count and bound parameters remain sufficient when spin values increase, without an independent check that the spectrum of Q_v (or the required number of nodes) does not degrade. This verification gap is load-bearing for the central claim of controlled dependence and rapid convergence in the high-spin regime advertised as the method's primary utility.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the positive overall assessment and for identifying this important point about validation scope. We address the major comment below.

read point-by-point responses

  1. Referee: The operator-norm and residual error estimates, together with the sector-wise scaling bounds, are validated only against exact dense local-block operators on the embedded K_5 graph at small spin cutoffs. The Monte Carlo estimates at doubled-spin cutoff 2j=250000 and the stochastic Lanczos spectral measures therefore rest on the assumption that the same quadrature-node count and bound parameters remain sufficient when spin values increase, without an independent check that the spectrum of Q_v (or the required number of nodes) does not degrade. This verification gap is load-bearing for the central claim of controlled dependence and rapid convergence in the high-spin regime advertised as the method's primary utility.

    Authors: The operator-norm and residual error bounds are obtained directly from the Balakrishnan-Stieltjes representation and the shifted-resolvent quadrature analysis; they depend on the operator-norm bounds for Q_v and on the sector-wise spectral scaling, both of which are proven to hold uniformly for any admissible spin labels (with constants that scale explicitly with the representation labels and valence). The K_5 validation at small cutoffs therefore serves only to confirm that the chosen node count saturates the a-priori error estimate in practice; it is not required for the validity of the bounds themselves. Because an exact dense reference is unavailable precisely in the 2j=250000 regime, the Monte Carlo and stochastic Lanczos results necessarily rely on these general bounds. We will add a short clarifying paragraph in Section 4.3 that explicitly states the spin-independence of the error constants and reiterates that the node count was selected from the worst-case sector bound rather than from the small-spin data alone. revision: partial

Circularity Check

0 steps flagged

No significant circularity in the derivation chain

full rationale

The paper's central construction uses the external Brunnemann-Thiemann expression for the oriented volume density Q_v (whose matrix elements are generated locally from recoupling theory) and the external Balakrishnan-Stieltjes representation of (Q_v²)^{1/4}. It then introduces an independent shifted-resolvent quadrature (SRQ) approximation whose nodes, weights, and sector bounds are chosen for numerical stability. The paper supplies a mathematical proof of exact kernel preservation, operator-norm and residual error estimates, and sector-wise scaling bounds that do not reduce to the input expressions by construction. Numerical validation is performed against exact dense local-block operators on an embedded K_5 graph at small spin cutoffs, providing an independent benchmark. No step equates a fitted parameter to a prediction, renames a known result, or relies on a load-bearing self-citation chain; the derivation remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on two established domain assumptions from prior LQG literature and one mathematical representation whose accuracy for the operator in question is taken as given.

axioms (2)
  • domain assumption The Brunnemann-Thiemann expression correctly gives the matrix elements of the oriented volume density Q_v from recoupling theory.
    Invoked in the abstract as the starting point for local generation of matrix elements.
  • domain assumption The Balakrishnan-Stieltjes representation applies to the operator (Q_v²)^{1/4} in the recoupling basis.
    Used to justify the quadrature approximation of the volume operator.

pith-pipeline@v0.9.1-grok · 5813 in / 1527 out tokens · 31255 ms · 2026-06-26T23:17:58.710415+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

49 extracted references · 23 linked inside Pith

  1. [1]

    Rel.11 (PreprintarXiv:gr-qc/9710008)

    Rovelli C 1998 Loop quantum gravityLiving Rev. Rel.11 (PreprintarXiv:gr-qc/9710008)

    Pith/arXiv arXiv 1998

  2. [2]

    Thiemann T 2001Introduction to Modern Canonical Quantum General Relativity(PreprintarXiv: gr-qc/0110034)

    Pith/arXiv arXiv

  3. [3]

    Thiemann T 2007Modern Canonical Quantum General RelativityCambridge Monographs on Mathematical Physics (Cambridge University Press) ISBN 978-0-511-75568-2, 978-0-521-84263-1

  4. [4]

    Ashtekar A and Lewandowski J 2004 Background independent quantum gravity: A Status reportClass. Quant. Grav.21R53 (PreprintarXiv:gr-qc/0404018)

    Pith/arXiv arXiv 2004

  5. [5]

    Ashtekar A and Bianchi E 2021 A short review of loop quantum gravityRept. Prog. Phys.84042001 (PreprintarXiv:2104.04394)

    arXiv 2021

  6. [6]

    Rovelli C and Smolin L 1995 Discreteness of area and volume in quantum gravityNucl. Phys. B442 593–622 [Erratum: Nucl.Phys.B 456, 753–754 (1995)] (PreprintarXiv:gr-qc/9411005)

    Pith/arXiv arXiv 1995

  7. [7]

    1: Area operatorsClass

    Ashtekar A and Lewandowski J 1997 Quantum theory of geometry. 1: Area operatorsClass. Quant. Grav.14A55–A82 (PreprintarXiv:gr-qc/9602046)

    Pith/arXiv arXiv 1997

  8. [8]

    Ashtekar A and Lewandowski J 1998 Quantum theory of geometry. 2. Volume operatorsAdv. Theor. Math. Phys.1388–429 (PreprintarXiv:gr-qc/9711031)

    Pith/arXiv arXiv 1998

  9. [9]

    Thiemann T 1996 Anomaly-free formulation of non-perturbative, four-dimensional Lorentzian quantum gravityPhys. Lett. B380257–264 (PreprintarXiv:gr-qc/9606088)

    Pith/arXiv arXiv 1996

  10. [10]

    Thiemann T 1998 Quantum spin dynamics (QSD)Class. Quant. Grav.15839–873 (PreprintarXiv: gr-qc/9606089)

    Pith/arXiv arXiv 1998

  11. [11]

    Thiemann T 1998 Quantum spin dynamics (QSD). II. The kernel of the Wheeler-Dewitt constraint operatorClass. Quant. Grav.15875–905 (PreprintarXiv:gr-qc/9606090)

    Pith/arXiv arXiv 1998

  12. [12]

    Thiemann T 1998 Closed formula for the matrix elements of the volume operator in canonical quantum gravityJ. Math. Phys.393347–3371 (PreprintarXiv:gr-qc/9606091)

    Pith/arXiv arXiv 1998

  13. [13]

    De Pietri R and Rovelli C 1996 Geometry eigenvalues and scalar product from recoupling theory in loop quantum gravityPhys. Rev. D542664–2690 (PreprintarXiv:gr-qc/9602023)

    Pith/arXiv arXiv 1996

  14. [14]

    Guedes T L M, Mena Marug´ an G A, M¨ uller M and Vidotto F 2025 Taming thiemann’s hamiltonian constraint in canonical loop quantum gravity: Reversibility, eigenstates, and graph-change analysis Phys. Rev. D112026024 (PreprintarXiv:2412.20272)

    arXiv 2025

  15. [15]

    Guedes T L M, Mena Marug´ an G A, Vidotto F and M¨ uller M 2025 Computing the graph-changing dynamics of loop quantum gravityUniverse11387

    2025

  16. [16]

    Sahlmann H and Sherif W 2024 Towards quantum gravity with neural networks: solving the quantum Hamilton constraint of U(1) BF theoryClass. Quant. Grav.41225014 (PreprintarXiv:2402.10622)

    arXiv 2024

  17. [17]

    Sahlmann H and Sherif W 2024 Towards quantum gravity with neural networks: solving quantum Hamilton constraints of 3d Euclidean gravity in the weak coupling limitClass. Quant. Grav.41215006 (PreprintarXiv:2405.00661) 21

    arXiv 2024

  18. [18]

    Sahlmann H and Sherif W 2026 Finding and characterising physical states of Euclidean Abelianized loop quantum gravity using neural quantum states (PreprintarXiv:2604.14067)

    Pith/arXiv arXiv 2026

  19. [19]

    M¨ akinen I, Sahlmann H and Sherif W 2026 Emergent Thiemann coherent states in the near-kernel sector of quantum reduced loop gravity (PreprintarXiv:2605.18625)

    Pith/arXiv arXiv 2026

  20. [20]

    Brunnemann J and Thiemann T 2006 Simplification of the spectral analysis of the volume operator in loop quantum gravityClass. Quant. Grav.231289–1346 (PreprintarXiv:gr-qc/0405060)

    Pith/arXiv arXiv 2006

  21. [21]

    Brunnemann J and Rideout D 2008 Properties of the volume operator in loop quantum gravity. I. Results Class. Quant. Grav.25065001 (PreprintarXiv:0706.0469)

    Pith/arXiv arXiv 2008

  22. [22]

    Sahlmann H and Thiemann T 2006 Towards the QFT on curved space-time limit of QGR. 2. A concrete implementationClass. Quant. Grav.23909–954 (PreprintarXiv:gr-qc/0207031)

    Pith/arXiv arXiv 2006

  23. [23]

    Giesel K and Thiemann T 2007 Algebraic Quantum Gravity (AQG). III. Semiclassical perturbation theoryClass. Quant. Grav.242565–2588 (PreprintarXiv:gr-qc/0607101)

    Pith/arXiv arXiv 2007

  24. [24]

    Brunnemann J and Rideout D 2008 Properties of the volume operator in loop quantum gravity. II. Detailed presentationClass. Quant. Grav.25065002 (PreprintarXiv:0706.0382)

    Pith/arXiv arXiv 2008

  25. [25]

    Sorella S 1998 Green function Monte Carlo with stochastic reconfigurationPhys. Rev. Lett.804558–4561 (PreprintarXiv:cond-mat/9803107)

    Pith/arXiv arXiv 1998

  26. [26]

    Sorella S 2001 Generalized Lanczos algorithm for variational quantum Monte CarloPhys. Rev. B64 024512 (PreprintarXiv:cond-mat/0009149)

    Pith/arXiv arXiv 2001

  27. [27]

    Carleo G and Troyer M 2017 Solving the quantum many-body problem with artificial neural networks Science355602–606 (PreprintarXiv:1606.02318)

    Pith/arXiv arXiv 2017

  28. [28]

    Baydin A G, Pearlmutter B A, Radul A A and Siskind J M 2018 Automatic differentiation in machine learning: a surveyJ. Mach. Learn. Res.181–43 (PreprintarXiv:1502.05767)

    Pith/arXiv arXiv 2018

  29. [29]

    Bradbury J, Frostig R, Hawkins P, Johnson M J, Leary C, Maclaurin D, Necula G, Paszke A, VanderPlas J, Wanderman-Milne S and Zhang Q 2018 JAX: Composable transformations of Python+NumPy programs

    2018

  30. [30]

    Amari S i 1998 Natural gradient works efficiently in learningNeural Comput.10251–276

    1998

  31. [31]

    Math.10419–437

    Balakrishnan A V 1960 Fractional powers of closed operators and the semigroups generated by them Pacific J. Math.10419–437

    1960

  32. [32]

    Higham N J 2008Functions of Matrices: Theory and Computation(Philadelphia, PA: Society for Industrial and Applied Mathematics) ISBN 978-0-898716-46-7

  33. [33]

    Hale N, Higham N J and Trefethen L N 2008 Computing Aα, log(A), and related matrix functions by contour integralsSIAM J. Numer. Anal.462505–2523

    2008

  34. [34]

    Trefethen L N and Weideman J A C 2014 The exponentially convergent trapezoidal ruleSIAM Rev.56 385–458

    2014

  35. [35]

    Hestenes M R and Stiefel E 1952 Methods of conjugate gradients for solving linear systemsJ. Res. Natl. Bur. Stand.49409–436

    1952

  36. [36]

    Saad Y 2003Iterative Methods for Sparse Linear Systems2nd ed (Philadelphia, PA: Society for Industrial and Applied Mathematics) ISBN 978-0-898715-34-7

  37. [37]

    Jegerlehner B 1996 Krylov space solvers for shifted linear systems (PreprintarXiv:hep-lat/9612014)

    Pith/arXiv arXiv 1996

  38. [38]

    Frommer A and Gl¨ assner U 1998 Restarted GMRES for shifted linear systemsSIAM J. Sci. Comput.19 15–26

    1998

  39. [39]

    Baumann M and van Gijzen M B 2015 Nested Krylov methods for shifted linear systemsSIAM J. Sci. Comput.37S90–S112

    2015

  40. [40]

    Hutchinson M F 1990 A stochastic estimator of the trace of the influence matrix for laplacian smoothing splinesCommunications in Statistics - Simulation and Computation19433–450

    1990

  41. [41]

    Golub G H and Meurant G 1994 Matrices, moments and quadratureNumerical Analysis 1993(Pitman Research Notes in Mathematics Seriesvol 303) ed Griffiths D F and Watson G A (Harlow: Longman Scientific & Technical) pp 105–156

    1994

  42. [42]

    Ubaru S, Chen J and Saad Y 2017 Fast estimation of tr(f(a)) via stochastic lanczos quadratureSIAM Journal on Matrix Analysis and Applications381075–1099 22

    2017

  43. [43]

    Horn R A and Johnson C R 2012Matrix Analysis2nd ed (Cambridge University Press) ISBN 978-0-521- 83940-2

  44. [44]

    Lanczos C 1950 An iteration method for the solution of the eigenvalue problem of linear differential and integral operatorsJ. Res. Natl. Bur. Stand.45255–282

    1950

  45. [45]

    Saad Y 2011Numerical Methods for Large Eigenvalue Problemsrevised ed (Philadelphia: Society for Industrial and Applied Mathematics)

  46. [46]

    G¨ uttel S 2013 Rational krylov approximation of matrix functions: Numerical methods and optimal pole selectionGAMM-Mitteilungen368–31

    2013

  47. [47]

    Knyazev A V 2001 Toward the optimal preconditioned eigensolver: locally optimal block preconditioned conjugate gradient methodSIAM J. Sci. Comput.23517–541

    2001

  48. [48]

    Sleijpen G L G and van der Vorst H A 1996 A jacobi–davidson iteration method for linear eigenvalue problemsSIAM Journal on Matrix Analysis and Applications17401–425

    1996

  49. [49]

    Convergence, error bounds and parameter selection This appendix presents the standard scalar and operator estimates used to choose the SRQ parameters

    Nakatsukasa Y and Freund R W 2016 Computing fundamental matrix decompositions accurately via the matrix sign function in two iterations: The power of zolotarev’s functionsSIAM Review58461–493 Appendix A. Convergence, error bounds and parameter selection This appendix presents the standard scalar and operator estimates used to choose the SRQ parameters. Th...

    2016