Efficient Learning of Non-Interacting Fermion Distributions

02/20/2021
by   Scott Aaronson, et al.
0

We give an efficient classical algorithm that recovers the distribution of a non-interacting fermion state over the computational basis. For a system of n non-interacting fermions and m modes, we show that O(m^2 n^4 log(m/δ)/ ε^4) samples and O(m^4 n^4 log(m/δ)/ ε^4) time are sufficient to learn the original distribution to total variation distance ε with probability 1 - δ. Our algorithm empirically estimates the one- and two-mode correlations and uses them to reconstruct a succinct description of the entire distribution efficiently.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/23/2022

Learning and Testing Latent-Tree Ising Models Efficiently

We provide time- and sample-efficient algorithms for learning and testin...
research
08/01/2022

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions

We give a simple polynomial-time approximation algorithm for the total v...
research
07/24/2021

On the Le Cam distance between multivariate hypergeometric and multivariate normal experiments

In this short note, we develop a local approximation for the log-ratio o...
research
05/14/2013

Efficient Density Estimation via Piecewise Polynomial Approximation

We give a highly efficient "semi-agnostic" algorithm for learning univar...
research
09/04/2019

Learning Distributions Generated by One-Layer ReLU Networks

We consider the problem of estimating the parameters of a d-dimensional ...
research
04/26/2019

Sample Amplification: Increasing Dataset Size even when Learning is Impossible

Given data drawn from an unknown distribution, D, to what extent is it p...
research
12/13/2022

Queues on interacting networks

Interacting networks are different in nature to single networks. The stu...

Please sign up or login with your details

Forgot password? Click here to reset