analiza aiqbench
This research proposes novel neural network architectures designed specifically to simulate quantum many-body systems by overcoming the high computational costs and discontinuities found in existing antisymmetric models. By leveraging bi-Lipschitz embeddings and modular projection frameworks, the study achieves universal approximation guarantees with polynomial complexity while ensuring continuity for Lipschitz functions. These advances directly address critical bottlenecks in using machine learning to model complex quantum states efficiently.
Bi-Lipschitz Ansatz for Anti-Symmetric Functions
arXiv:2503.04263v2 Announce Type: replace-cross Abstract: Motivated by applications to the simulation of quantum many-body systems by neural networks, researchers have suggested several models which are antisymmetric by construction, and can approximate all antisymmetric functions. However, these works either require very high computational complexity to attain universal approximation, or suffer from discontinuities. In this paper, we introduce two antisymmetric ansatzes which do not suffer from these disadvantages. The first is based on a bi-Lipschitz embedding with respect to a naturally defined metric. The second is a modular anti-symmetrizing projection framework based on the frame-averaging methodology. Both approaches yield continuous antisymmetric models which attain universal approximation guarantees with a polynomial complexity in problem size. Moreover, for both approaches, we obtain quantitative approximation results that bound the number of parameters required to approximate Lipschitz antisymmetric functions to a given accuracy $\epsilon$. We also provide preliminary experimental evidence suggesting improved performance in learning antisymmetric functions.
Abstract:Motivated by applications to the simulation of quantum many-body systems by neural networks, researchers have suggested several models which are antisymmetric by construction, and can approximate all antisymmetric functions. However, these works either require very high computational complexity to attain universal approximation, or suffer from discontinuities. In this paper, we introduce two antisymmetric ansatzes which do not suffer from these disadvantages. The first is based on a bi-Lipschitz embedding with respect to a naturally defined metric. The second is a modular anti-symmetrizing projection framework based on the frame-averaging methodology. Both approaches yield continuous antisymmetric models which attain universal approximation guarantees with a polynomial complexity in problem size. Moreover, for both approaches, we obtain quantitative approximation results that bound the number of parameters required to approximate Lipschitz antisymmetric functions to a given accuracy $\epsilon$. We also provide preliminary experimental evidence suggesting improved performance in learning antisymmetric functions.
Machine Learning (cs.LG); Classical Analysis and ODEs (math.CA); Quantum Physics (quant-ph)
G.1.2; I.5.1; G.1.10; I.5.4
arXiv:2503.04263 [cs.LG]
(or arXiv:2503.04263v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2503.04263 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 250 cuvinte
Subiecte conexe
Exact and Efficient Representation of Totally Anti-Symmetric Functions
arXiv · 6 aug. 2026
Sharp Root Anti-Concentration via Projective Incidence and Ordered Root Laws
arXiv · 4 aug. 2026
Modular Self-Duality, Symmetrized Relative Entropy, and Bogoliubov--Kubo--Mori Susceptibility in Quantum Field Theory
arXiv · 31 aug. 2026
Links #3: 2026/06 Part 1
LessWrong · 15 iun. 2026