相关论文: n-Channel Asymmetric Multiple-Description Lattice …
We experimentally demonstrate PT-symmetric optical lattices with periodical gain and loss profiles in a coherently-prepared four-level N-type atomic system. By appropriately tuning the pertinent atomic parameters, the onset of PT-symmetry…
The capability to temporarily arrest the propagation of optical signals is one of the main challenges hampering the ever more widespread use of light in rapid long-distance transmission as well as all-optical on-chip signal processing or…
We provide a comprehensive analysis of the two-parameter Beta distributions seen from the perspective of second-order stochastic dominance. By changing its parameters through a bijective mapping, we work with a bounded subset D instead of…
In this paper, we consider a recently-proposed model of teaching and learning under uncertainty, in which a teacher receives independent observations of a single bit corrupted by binary symmetric noise, and sequentially transmits to a…
Standard communication systems have transmission spectra that characterize their ability to perform frequency multiplexing over a finite bandwidth. Realistic quantum signals in quantum communication systems like transducers are inherently…
In this note we give a combinatorial and non-computational proof of the asymptotics of the integer moments of the moments of the characteristic polynomials of Haar distributed unitary matrices as the size of the matrix goes to infinity.…
We introduce a definition of perfect and quasi-perfect codes for symmetric channels parametrized by an auxiliary output distribution. This notion generalizes previous definitions of perfect and quasi-perfect codes and encompasses maximum…
We study a multi-particle quantum graph with random potential. Taking the approach of multiscale analysis we prove exponential and strong dynamical localization of any order in the Hilbert-Schmidt norm near the spectral edge. Apart from the…
We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions…
We develop a novel connection between discrepancy minimization and (quantum) communication complexity. As an application, we resolve a substantial special case of the Matrix Spencer conjecture. In particular, we show that for every…
Estimating the orientations of nodes in a pose graph from relative angular measurements is challenging because the variables live on a manifold product with nontrivial topology and the maximum-likelihood objective function is non-convex and…
We construct families of symmetric, antisymmetric, and asymmetric solitary modes in one-dimensional bichromatic lattices with the second-harmonic-generating ($\chi ^{(2)}$) nonlinearity concentrated at a pair of sites placed at distance…
We suggest that a certain one-to-one parametrization of completely positive maps on the matrix algebra might be useful in the study of quantum channels. This is illustrated in the case of binary quantum channels. While the algorithm is…
We provide a method for designing an optimal index assignment for scalar K-description coding. The method stems from a construction of translated scalar lattices, which provides a performance advantage by exploiting a so-called staggered…
The nonparametric volatility estimation problem of a scalar diffusion process observed at equidistant time points is addressed. Using the spectral representation of the volatility in terms of the invariant density and an eigenpair of the…
Incorporating graph side information into recommender systems has been widely used to better predict ratings, but relatively few works have focused on theoretical guarantees. Ahn et al. (2018) firstly characterized the optimal sample…
A full-rank lattice in the Euclidean space is a discrete set formed by all integer linear combinations of a basis. Given a probability distribution on $\mathbb{R}^n$, two operations can be induced by considering the quotient of the space by…
We study a quantity called discrete layered entropy, which approximates the Shannon entropy within a logarithmic gap. Compared to the Shannon entropy, the discrete layered entropy is piecewise linear, approximates the expected length of the…
Quantized neural networks with low-bit weights and activations are attractive for developing AI accelerators. However, the quantization functions used in most conventional quantization methods are non-differentiable, which increases the…
We consider the role of non-triviality resulting from a non-Hermitian Hamiltonian that conserves twofold PT-symmetry assembled by interconnections between a PT-symmetric lattice and its time reversal partner. Twofold PT-symmetry in the…