Towards Antisymmetric Neural Ansatz Separation

08/05/2022
by   Aaron Zweig, et al.
0

We study separations between two fundamental models (or Ansätze) of antisymmetric functions, that is, functions f of the form f(x_σ(1), …, x_σ(N)) = sign(σ)f(x_1, …, x_N), where σ is any permutation. These arise in the context of quantum chemistry, and are the basic modeling tool for wavefunctions of Fermionic systems. Specifically, we consider two popular antisymmetric Ansätze: the Slater representation, which leverages the alternating structure of determinants, and the Jastrow ansatz, which augments Slater determinants with a product by an arbitrary symmetric function. We construct an antisymmetric function that can be more efficiently expressed in Jastrow form, yet provably cannot be approximated by Slater determinants unless there are exponentially (in N^2) many terms. This represents the first explicit quantitative separation between these two Ansätze.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2022

Exponential Separations in Symmetric Neural Networks

In this work we demonstrate a novel separation between symmetric neural ...
research
02/27/2017

Depth Separation for Neural Networks

Let f:S^d-1×S^d-1→S be a function of the form f(x,x') = g(〈x,x'〉) for g:...
research
03/22/2023

Anti-symmetric Barron functions and their approximation with sums of determinants

A fundamental problem in quantum physics is to encode functions that are...
research
03/23/2021

Separations between Combinatorial Measures for Transitive Functions

The role of symmetry in Boolean functions f:{0,1}^n →{0,1} has been exte...
research
02/02/2021

Depth separation beyond radial functions

High-dimensional depth separation results for neural networks show that ...
research
05/11/2023

Rethink Depth Separation with Intra-layer Links

The depth separation theory is nowadays widely accepted as an effective ...
research
01/15/2020

Exponential quantum communication reductions from generalizations of the Boolean Hidden Matching problem

In this work we revisit the Boolean Hidden Matching communication proble...

Please sign up or login with your details

Forgot password? Click here to reset