English
Related papers

Related papers: Finitary Boolean functions

200 papers

We study the asymptotic decay of the Fourier spectrum of real functions $f\colon \{-1,1\}^N \rightarrow \mathbb{R}$ in the spirit of Bohr's phenomenon from complex analysis. Every such function admits a canonical representation through its…

Functional Analysis · Mathematics 2017-07-31 Andreas Defant , Mieczysław Mastyło , Antonio Pérez

This paper focuses on a relation between the growth of harmonic functions and the Hausdorff measure of their zero sets. Let $u$ be a real-valued harmonic function in $\mathbb{R}^n$ with $u(0)=0$ and $n\geq 3$. We prove…

Analysis of PDEs · Mathematics 2023-03-14 Alexander Logunov , Lakshmi Priya , Andrea Sartori

For many implementations of quantum computing, 1/f and other types of broad-spectrum noise are an important source of decoherence. An important step forward would be the ability to back out the characteristics of this noise from qubit…

Quantum Physics · Physics 2011-07-15 Robert Joynt , Dong Zhou , Qiang-Hua Wang

It is shown that a class of optical physical unclonable functions (PUFs) can be learned to arbitrary precision with arbitrarily high probability, even in the presence of noise, given access to polynomially many challenge-response pairs and…

Machine Learning · Computer Science 2023-09-08 Apollo Albright , Boris Gelfand , Michael Dixon

Imaginary-time response functions of finite-temperature quantum systems are often obtained with methods that exhibit stochastic or systematic errors. Reducing these errors comes at a large computational cost -- in quantum Monte Carlo…

Strongly Correlated Electrons · Physics 2025-07-11 Yang Yu , Alexander F. Kemper , Chao Yang , Emanuel Gull

Attempts to separate the power of classical and quantum models of computation have a long history. The ultimate goal is to find exponential separations for computational problems. However, such separations do not come a dime a dozen: while…

Quantum Physics · Physics 2013-12-05 Martin Roetteler

Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is…

Computational Complexity · Computer Science 2014-11-14 Andris Ambainis , Mohammad Bavarian , Yihan Gao , Jieming Mao , Xiaoming Sun , Song Zuo

We consider the Courtade-Kumar most informative Boolean function conjecture for balanced functions, as well as a conjecture by Li and M\'edard that dictatorship functions also maximize the $L^\alpha$ norm of $T_pf$ for $1\leq\alpha\leq2$…

Information Theory · Computer Science 2020-04-06 Leighton Pate Barnes , Ayfer Özgür

For each non-constant $q$ in the set of $n$-variable Boolean functions, the {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable from $q$ by nonsingular linear change of…

Cryptography and Security · Computer Science 2017-11-09 Zhixiong Chen , Ting Gu , Andrew Klapper

A key fact in the theory of Boolean functions $f : \{0,1\}^n \to \{0,1\}$ is that they often undergo sharp thresholds. For example: if the function $f : \{0,1\}^n \to \{0,1\}$ is monotone and symmetric under a transitive action with…

Combinatorics · Mathematics 2010-11-17 Gil Kalai , Elchanan Mossel

We study Gaussian random functions on the complex plane whose stochastics are invariant under the Weyl-Heisenberg group (twisted stationarity). The theory is modeled on translation invariant Gaussian entire functions, but allows for…

Probability · Mathematics 2022-05-11 Antti Haimi , Günther Koliander , José Luis Romero

Bernstein's theorem (also called Hausdorff--Bernstein--Widder theorem) enables the integral representation of a completely monotonic function. We introduce a finite completely monotonic function, which is a completely monotonic function…

Numerical Analysis · Mathematics 2023-07-25 Yohei M. Koyama

The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound

Information Theory · Computer Science 2024-11-19 Vladimir N. Potapov

Continuously monitored atomic spin-ensembles allow, in principle, for real-time sensing of external magnetic fields beyond classical limits. Within the linear-Gaussian regime, thanks to the phenomenon of measurement-induced spin-squeezing,…

Quantum Physics · Physics 2021-12-21 Julia Amoros-Binefa , Jan Kolodynski

The Fourier Entropy-Influence (FEI) Conjecture of Friedgut and Kalai states that ${\bf H}[f] \leq C \cdot {\bf I}[f]$ holds for every Boolean function $f$, where ${\bf H}[f]$ denotes the spectral entropy of $f$, ${\bf I}[f]$ is its total…

Computational Complexity · Computer Science 2019-01-25 Guy Shalev

$k$th-order sum-free functions are a natural generalization of APN functions using the concept of (non)vanishing flats. In this paper, we introduce a new combinatorial technique to study the nonvanishing flats of Boolean functions. This…

Combinatorics · Mathematics 2026-03-31 Christian Kaspers

This paper investigates the concept of harmonic functions of bounded mean oscillation, starting from John-Nirenberg's pioneering studies, under a renewed formalism, suitable for bringing out some fundamental properties inherent in it. In…

Functional Analysis · Mathematics 2023-02-08 Edoardo Niccolai

A classical result of Rothschild and van Lint asserts that if every non-zero Fourier coefficient of a Boolean function $f$ over $\mathbb{F}_2^{n}$ has the same absolute value, namely $|\hat{f}(\alpha)|=1/2^k$ for every $\alpha$ in the…

Computational Complexity · Computer Science 2021-04-01 Ning Xie , Shuai Xu , Yekun Xu

The first part of this thesis proposes a general approach to infinite dimensional non-Gaussian analysis, including the Poissonian case. In particular distribution theory is developed. Using appropriate integral transformations, generalized…

Mathematical Physics · Physics 2007-05-23 Werner Westerkamp

The query model (or black-box model) has attracted much attention from the communities of both classical and quantum computing. Usually, quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity…

Quantum Physics · Physics 2020-12-14 Zekun Ye , Lvzhou Li