Skip to main content
Log in

Abstract

We prove that if \(q_1,\dots ,q_m:{\mathbb {R}}^n \rightarrow {\mathbb {R}}\) are quadratic forms in variables \(x_1,\dots ,x_n\) such that each \(q_k\) depends on at most r variables and each \(q_k\) has common variables with at most r other forms, then the average value of the product \((1+q_1)\cdots (1+q_m)\) with respect to the standard Gaussian measure in \({\mathbb {R}}^n\) can be approximated within relative error \(\epsilon >0\) in quasi-polynomial \(n^{O(1)}\hspace{0.55542pt}m^{O(\ln m-\ln \epsilon )}\) time, provided \(|q_k(x)|\leqslant \gamma \hspace{0.33325pt}\Vert x\Vert ^2 /r\) for some absolute constant \(\gamma > 0\) and \(k=1, \ldots , m\). The integral in question is viewed as the independence polynomial of an auxiliary weighted graph and then the method of polynomial interpolation is applied. When \(q_k\) are interpreted as pairwise squared distances for configurations of points in Euclidean space, the average can be interpreted as the partition function of systems of particles with mollified logarithmic potentials. We sketch possible applications to testing the feasibility of systems of real quadratic equations and to computing permanents of positive definite Hermitian matrices.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. Theory Comput. 9, 143–252 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  2. Anari, N., Gurvits, L., Oveis Gharan, S., Saberi, A.: Simply exponential approximation of the permanent of positive semidefinite matrices. In: 58th Annual IEEE Symposium on Foundations of Computer Science (Berkeley 2017), pp. 914–925. IEEE, Los Alamitos (2017)

  3. Baldoni, V., Berline, N., De Loera, J.A., Köppe, M., Vergne, M.: How to integrate a polynomial over a simplex. Math. Comp. 80(273), 297–325 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Barvinok, A.I.: Feasibility testing for systems of real quadratic equations. Discrete Comput. Geom. 10(1), 1–13 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  5. Barvinok, A.: A Course in Convexity. Graduate Studies in Mathematics, vol. 54. American Mathematical Society, Providence (2002)

  6. Barvinok, A.: Combinatorics and Complexity of Partition Functions. Algorithms and Combinatorics, vol. 30. Springer, Cham (2016)

  7. Bravyi, S., Gosset, D., Movassagh, R.: Classical algorithms for quantum mean values. Nat. Phys. 17, 337–341 (2021)

    Article  Google Scholar 

  8. Crippen, G.M., Havel, T.F.: Distance Geometry and Molecular Conformation. Chemometrics Series, vol. 15. Wiley, New York (1988)

  9. Csikvári, P., Frenkel, P.E.: Benjamini–Schramm continuity of root moments of graph polynomials. Eur. J. Comb. 52(B), 302–320 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  10. Friedli, S., Velenik, Y.: Statistical Mechanics of Lattice Systems: A Concrete Mathematical Introduction. Cambridge University Press, Cambridge (2018)

    MATH  Google Scholar 

  11. Grigoriev, D., Pasechnik, D.V.: Polynomial-time computing over quadratic maps. I. Sampling in real algebraic sets. Comput. Complex. 14(1), 20–52 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Harrow, A.W., Mehraban, S., Soleimanifar, M.: Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems. In: 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 378–386. ACM, New York (2020)

  13. Liberti, L., Lavor, C., Maculan, N., Mucherino, A.: Euclidean distance geometry and applications. SIAM Rev. 56(1), 3–69 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lovász, L., Vempala, S.: The geometry of logconcave functions and sampling algorithms. Random Struct. Algorithms 30(3), 307–358 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Marcus, M., Newman, M.: Inequalities for the permanent function. Ann. Math. 75(1), 47–62 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  16. Mehta, M.L.: Random Matrices. Pure and Applied Mathematics (Amsterdam), vol. 142. Elsevier, Amsterdam (2004)

    Google Scholar 

  17. Yang, C.N., Lee, T.D.: Statistical theory of equations of state and phase transitions. I. Theory of condensation. Phys. Rev. 87(3), 404–409 (1952)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The author is grateful to the anonymous referees for their careful reading of the paper and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Barvinok.

Additional information

Editor in Charge: János Pach

Dedicated to the memory of Eli Goodman.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This research was partially supported by NSF Grant DMS 1855428.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Barvinok, A. Integrating Products of Quadratic Forms. Discrete Comput Geom (2023). https://doi.org/10.1007/s00454-023-00550-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00454-023-00550-9

Keywords

Mathematics Subject Classification

Navigation