Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Abstract--We consider visible compression for discrete memoryless sources of mixed quantum states when only classical information can be sent from Alice to Bob. We assume that Bob ...