Majorana fermions and the Sensitivity Conjecture

08/17/2019
by   Yingfei Gu, et al.
0

Recently, Hao Huang proved the Sensitivity Conjecture, an important result about complexity measures of Boolean functions. We will discuss how this simple and elegant proof turns out to be closely related to physics concepts of the Jordan-Wigner transformation and Majorana fermions. This note is not intended to contain original results. Instead, it is a translation of the math literature in a language that is more familiar to physicists, which helps our understanding and hopefully may inspire future works along this direction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2019

On the Resolution of the Sensitivity Conjecture

The Sensitivity Conjecture is a long-standing problem in theoretical com...
research
05/01/2020

Relationships between the number of inputs and other complexity measures of Boolean functions

We generalize and extend the ideas in a recent paper of Chiarelli, Hatam...
research
12/15/2017

Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps

The well-known Sensitivity Conjecture states that for any Boolean funct...
research
07/01/2019

Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture

In this paper, we show that every (2^n-1+1)-vertex induced subgraph of t...
research
08/30/2018

Sensitivity, Affine Transforms and Quantum Communication Complexity

We study the Boolean function parameters sensitivity (s), block sensiti...
research
03/26/2021

Toward a deeper understanding of a basic cascade

Towards the end of the last century, B. Mandelbrot saw the importance, r...
research
04/16/2019

One-adhesive polymatroids

Adhesive polymatroids were defined by F. Matúš motivated by entropy func...

Please sign up or login with your details

Forgot password? Click here to reset