Related papers: The Haemers bound of noncommutative graphs
The one-shot zero-error classical capacity of a quantum channel is the amount of classical information that can be transmitted with zero probability of error by a single use. Then the one-shot zero-error classical capacity equals to the…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
We consider a random quantum channel obtained by taking a selection of $d$ independent and Haar distributed $N$ dimensional unitaries. We follow the argument of Hastings to bound the spectral gap in terms of eigenvalues and adapt it to give…
We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…
In this paper we extend the known results of analytic connectivity to non-uniform hypergraphs. We prove a modified Cheeger's inequality and also give a bound on analytic connectivity with respect to the degree sequence and diameter of a…
New lower and upper bounds on the reliability function of typewriter channels are given. Our lower bounds improve upon the (multiletter) expurgated bound of Gallager, furnishing a new and simple counterexample to a conjecture made in 1967…
Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…
We use the theory of graph limits to study several quasi-random properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the properties of (sequences of) graphs to properties of graphons,…
The zero-error capacity of quantum channels was defined as the least upper bound of rates at which classical information can be transmitted through a quantum channel with probability of error equal to zero. This paper investigates some…
The generalization of Shannon's theory to include messages with given autocorrelations is presented. The analytical calculation of the channel capacity is based on the transfer matrix method of the effective 1D Hamiltonian. This bridge…
Let $A$ and $B$ be local operators in Hamiltonian quantum systems with $N $ degrees of freedom and finite-dimensional Hilbert space. We prove that the commutator norm $\lVert [A(t),B]\rVert$ is upper bounded by a topological combinatorial…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
The dynamic capacity theorem characterizes the reliable communication rates of a quantum channel when combined with the noiseless resources of classical communication, quantum communication, and entanglement. In prior work, we proved the…
We prove Cheeger inequalities for p-Laplacians on finite and infinite weighted graphs. Unlike in previous works, we do not impose boundedness of the vertex degree, nor do we restrict ourselves to the normalized Laplacian and, more…
We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and…
The Shannon upper bound places a limit on the error-free information transmission rate (capacity) of a noisy channel. It has stood for over sixty years, and underlies both theoretical and practical work in the telecommunications industry.…
We study Gamma-convergence of graph based Ginzburg-Landau functionals, both the limit for zero diffusive interface parameter epsilon->0 and the limit for infinite nodes in the graph m -> infinity. For general graphs we prove that in the…
We study non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of classical information that can be transmitted when a quantum channel is used a finite…
In the present paper we continue our study of non-commutative operator graphs in infinite-dimensional spaces. We consider examples of the non-commutative operator graphs generated by resolutions of identity corresponding to the…
Unextendibility of quantum states and channels is inextricably linked to the no-cloning theorem of quantum mechanics, it has played an important role in understanding and quantifying entanglement, and more recently it has found applications…