Related papers: Capacity lower bound for the Ising perceptron

Generic models for the origin of structure predict a spectrum of initial fluctuations with a mixture of adiabatic and isocurvature perturbations. Using the observed anisotropies of the cosmic microwave backgound, the matter power spectra…

Bi-quadratic programming over unit spheres is a fundamental problem in quantum mechanics introduced by pioneer work of Einstein, Schr\"odinger, and others. It has been shown to be NP-hard; so it must be solve by efficient heuristic…

A \emph{covering array} is an $N \times k$ array of elements from a $v$-ary alphabet such that every $N \times t$ subarray contains all $v^t$ tuples from the alphabet of size $t$ at least $\lambda$ times; this is denoted as $\CA_\lambda(N;…

The study of transversal fluctuation of the optimal path has been a crucial aspect of the Kadar-Parisi-Zhang (KPZ) universality class. In this paper, we establish a new probability lower bound, with optimal exponential order, for the rare…

A Blume-Emery-Griffiths perceptron model is introduced and its optimal capacity is calculated within the replica-symmetric Gardner approach, as a function of the pattern activity and the imbedding stability parameter. The stability of the…

This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under the peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly…

We will show in this paper that if $\lambda$ is very close to 1, then $$I(M,\lambda,m)= \sup_{u\in H^{1,n}_0(M) ,\int_M|\nabla u|^ndV=1}\int_\Omega (e^{\alpha_n |u|^\frac{n}{n-1}}-\lambda\sum\limits_{k=1}^m\frac{|\alpha_nu^\frac{n}{n-1}|^k}…

In the present paper we give proof that the information-transmission capacity of the approximate position measurement with the oscillator energy constraint, which underlies noisy Gaussian homodyning in quantum optics, is attained on…

Consider the Ising model on $([1,2N]\times[1,2M])\cap\mathbb{Z}^2$ at critical temperature with periodic boundary condition in the horizontal direction and free boundary condition in the vertical direction. Let $E_{M,N}$ be its total energy…

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

As a means to solve optimization problems using quantum computers, the problem is typically recast into a Ising spin model whose ground-state is the solution of the optimization problem. An alternative to the Ising formulation is the…

There are now several works on the use of the additive inverse Gaussian noise (AIGN) model for the random transit time in molecular communication~(MC) channels. The randomness invariably causes inter-symbol interference (ISI) in MC, an…

Let $M$ be an $n\times n$ random i.i.d. matrix. This paper studies the deviation inequality of $s_{n-k+1}(M)$, the $k$-th smallest singular value of $M$. In particular, when the entries of $M$ are subgaussian, we show that for any…

Given $\epsilon \in (0,1)$, a probability measure $\mu$ on $\Omega\subset\mathbb{R}^p$ and a semi-algebraic set $K\subset X\times\Omega$, we consider the feasible set $X^*_\epsilon=\{x\in X:{\rm Prob}[(x,\omega)\in K]\geq 1-\epsilon\}$…

Let $(X,d,\mu)$ be a metric measure space. For $\emptyset\neq R\subseteq (0,\infty)$ consider the Hardy-Littlewood maximal operator $$ M_R f(x) \stackrel{\mathrm{def}}{=} \sup_{r \in R} \frac{1}{\mu(B(x,r))} \int_{B(x,r)} |f| d\mu.$$ We…

In the current world, the use of artificial intelligence is penetrating every aspect of human life. The basic element of any artificial intelligence is a digital neuron, called a perceptron, while its quantum analogue is called a quantum…

The purpose of this paper is to estimate the intensity of a Poisson process $N$ by using thresholding rules. In this paper, the intensity, defined as the derivative of the mean measure of $N$ with respect to $ndx$ where $n$ is a fixed…

We consider large Information-Plus-Noise type matrices of the form $M_N=(\sigma \frac{X_N}{\sqrt{N}}+A_N)(\sigma \frac{X_N}{\sqrt{N}}+A_N)^*$ where $X_N$ is an $n \times N$ ($n\leq N)$ matrix consisting of independent standardized complex…

Let $f$ be an $L^2$-normalized Hecke--Maass cuspidal newform of level $N$, character $\chi$ and Laplace eigenvalue $\lambda$. Let $N_1$ denote the smallest integer such that $N|N_1^2$ and $N_0$ denote the largest integer such that $N_0^2…

Motivated by a greedy approach for generating {\it{information stable}} processes, we prove a universal maximum likelihood (ML) upper bound on the capacities of discrete information stable channels, including the binary erasure channel…