English
Related papers

Related papers: Boolean functions: noise stability, non-interactiv…

200 papers

For a quantum computer acting on d-dimensional systems, we analyze the computational power of circuits wherein stabilizer operations are perfect and we allow access to imperfect non-stabilizer states or operations. If the noise rate…

Quantum Physics · Physics 2011-03-21 Wim van Dam , Mark Howard

The archetypal system demonstrating stochastic resonance is nothing more than a threshold triggered device. It consists of a periodic modulated input and noise. Every time an output crosses the threshold the signal is recorded. Such a…

Statistical Mechanics · Physics 2014-01-10 Krzysztof Szczepaniec , Bartlomiej Dybiec

Uncertainty estimation for unlabeled data is crucial to active learning. With a deep neural network employed as the backbone model, the data selection process is highly challenging due to the potential over-confidence of the model…

Machine Learning · Computer Science 2024-02-14 Xingjian Li , Pengkun Yang , Yangcheng Gu , Xueying Zhan , Tianyang Wang , Min Xu , Chengzhong Xu

Statistic dynamics of financial systems is investigated, basing on a model of randomly coupled equation system driven by stochastic Langevin force. It is found that in stable regime the noise power spectrum of the system is of 1/f^alpha…

Disordered Systems and Neural Networks · Physics 2008-12-02 Kestutis Staliunas

Dephasing noise is a ubiquitous source of decoherence in current atomic sensors. We address the problem of entanglement-assisted frequency estimation subject to classical dephasing noise with full spatial correlations (collective) and…

Quantum Physics · Physics 2026-03-26 Francisco Riberi , Gerardo Paz-Silva , Lorenza Viola

We address the problem of finding optimal strategies for computing Boolean symmetric functions. We consider a collocated network, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and we…

Information Theory · Computer Science 2009-11-18 Hemant Kowshik , P. R. Kumar

We study the problem of black-box optimization of a function f of any dimension, given function evaluations perturbed by noise. The function is assumed to be locally smooth around one of its global optima, but this smoothness is unknown.…

Machine Learning · Statistics 2026-05-05 Jean-Bastien Grill , Michal Valko , Rémi Munos

A time-dependent bias voltage on a tunnel junction generates a time-dependent modulation of its current fluctuations, and in particular of its variance. This translates into an excitation at frequency $\tilde{f}$ generating correlations…

Mesoscale and Nanoscale Physics · Physics 2024-03-27 Clovis Farley , Edouard Pinsolle , Bertrand Reulet

We show that all non-negative submodular functions have high {\em noise-stability}. As a consequence, we obtain a polynomial-time learning algorithm for this class with respect to any product distribution on $\{-1,1\}^n$ (for any constant…

Machine Learning · Computer Science 2011-06-14 Mahdi Cheraghchi , Adam Klivans , Pravesh Kothari , Homin K. Lee

In this paper we study functions with low influences on product probability spaces. The analysis of boolean functions with low influences has become a central problem in discrete Fourier analysis. It is motivated by fundamental questions…

Probability · Mathematics 2007-05-23 Elchanan Mossel , Ryan O'Donnell , Krzysztof Oleszkiewicz

We study the fine structure of long-time quantum noise in correlation functions of AdS/CFT systems. Under standard assumptions of quantum chaos for the dynamics and the observables, we estimate the size of exponentially small oscillations…

High Energy Physics - Theory · Physics 2016-01-20 Jose L. F. Barbon , Eliezer Rabinovici

We study noisy computation in randomly generated k-ary Boolean formulas. We establish bounds on the noise level above which the results of computation by random formulas are not reliable. This bound is saturated by formulas constructed from…

Disordered Systems and Neural Networks · Physics 2014-11-21 Alexander Mozeika , David Saad

The subject of this textbook is the analysis of Boolean functions. Roughly speaking, this refers to studying Boolean functions $f : \{0,1\}^n \to \{0,1\}$ via their Fourier expansion and other analytic means. Boolean functions are perhaps…

Discrete Mathematics · Computer Science 2021-05-24 Ryan O'Donnell

In \cite{js2006}, Jonasson and Steif conjectured that no non-degenerate sequence of transitive Boolean functions $ (f_n)_{n \geq 1}$ with $ \lim_{n \to \infty} I(f_n)= \infty $ could be tame (with respect to some $ (p_n)_{n \geq 1} $). In a…

Probability · Mathematics 2021-11-05 Malin Palö Forsström

We investigate the current noise of nanoelectromechanical systems close to a continuous mechanical instability. In the vicinity of the latter, the vibrational frequency of the nanomechanical system vanishes, rendering the system very…

Mesoscale and Nanoscale Physics · Physics 2012-03-30 Jochen Brüggemann , Guillaume Weick , Fabio Pistolesi , Felix von Oppen

We investigate the static and the dynamical behavior of localizable entanglement and its lower bounds on nontrivial loops of topological quantum codes with parallel magnetic field. Exploiting the connection between the stabilizer states and…

Quantum Physics · Physics 2022-06-03 Harikrishnan K. J. , Amit Kumar Pal

The noise of signals or currents consisting from a sequence of pulses, elementary events or moving discrete objects (particles) is analyzed. A simple analytically solvable model is investigated in detail both analytically and numerically.…

adap-org · Physics 2009-10-30 B. Kaulakys , T. Meskauskas

Quantum noise in a model of singly resonant frequency doubling including phase mismatch and driving in the harmonic mode is analyzed. The general formulae about the fixed points and their stability as well as the squeezing spectra…

Quantum Physics · Physics 2007-05-23 C. Cabrillo , J. L. Roldan , P. Garcia-Fernandez

Let $R_\epsilon(\cdot)$ stand for the bounded-error randomized query complexity with error $\epsilon > 0$. For any relation $f \subseteq \{0,1\}^n \times S$ and partial Boolean function $g \subseteq \{0,1\}^m \times \{0,1\}$, we show that…

Computational Complexity · Computer Science 2018-11-28 Dmitry Gavinsky , Troy Lee , Miklos Santha , Swagato Sanyal

Auditory processing difficulties involve challenges in understanding speech in noisy environments despite normal hearing. However, the neural mechanisms remain unclear, and standardized diagnostic criteria are lacking. This study examined…

Neurons and Cognition · Quantitative Biology 2025-06-18 Azuki Onaya , Hiroki Tanaka