Free Fermion Distributions Are Hard to Learn

06/07/2023
by   Alexander Nietner, et al.
0

Free fermions are some of the best studied quantum systems. However, little is known about the complexity of learning free-fermion distributions. In this work we establish the hardness of this task in the particle number non-preserving case. In particular, we give an information theoretical hardness result for the general task of learning from expectation values and, in the more general case when the algorithm is given access to samples, we give a computational hardness result based on the LPN assumption for learning the probability density function.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/20/2021

From Local Pseudorandom Generators to Hardness of Learning

We prove hardness-of-learning results under a well-studied assumption on...
research
04/12/2019

Complexity of full counting statistics of free quantum particles in entangled states

We study the computational complexity of quantum-mechanical expectation ...
research
04/06/2022

Continuous LWE is as Hard as LWE Applications to Learning Gaussian Mixtures

We show direct and conceptually simple reductions between the classical ...
research
03/12/2018

Quantum Supremacy and the Complexity of Random Circuit Sampling

A critical milestone on the path to useful quantum computers is quantum ...
research
10/26/2022

A super-polynomial quantum-classical separation for density modelling

Density modelling is the task of learning an unknown probability density...
research
09/12/2019

On the Hardness of Robust Classification

It is becoming increasingly important to understand the vulnerability of...
research
11/14/2019

Hardness of Learning DNFs using Halfspaces

The problem of learning t-term DNF formulas (for t = O(1)) has been stud...

Please sign up or login with your details

Forgot password? Click here to reset