相关论文: The Gale-Berlekamp game for complex Hadamard matri…
We show that the value of a general two-prover quantum game cannot be computed by a semi-definite program ofvpolynomial size (unless P=NP), a method that has been successful in more restricted quantum games. More precisely, we show that…
Let G be a graph of given order and mu(G) be the largest eigenvalue of its adjacency matrix. We give conditions on mu(G) that imply Hamiltonicity of G and of its complement.
Motivated by recent results in random matrix theory we will study the distributions arising from products of complex Gaussian random matrices and truncations of Haar distributed unitary matrices. We introduce an appropriately general class…
We study the characteristic polynomial of Haar distributed random unitary matrices. We show that after a suitable normalization, as one increases the size of the matrix, powers of the absolute value of the characteristic polynomial as well…
Considering the problem of sampling from the output photon-counting probability distribution of a linear-optical network for input Gaussian states, we obtain results that are of interest from both quantum theory and the computational…
We introduce a class of regular unit Hadamard matrices whose entries consist of two complex numbers and their conjugates for a total of four complex numbers. We then show that these matrices are contained in the Bose-Mesner algebra of an…
Inspired by the idea of Bernoulli decomposition, we give a simple proof for a generalization of Hal\'asz anti--concentration result about random sum of vectores in $\mathbb{R}^d$. From our results, we can give one upper bound for the…
We prove that the local eigenvalue statistics in the bulk for complex random matrices with independent entries whose $r$-th absolute moment decays as $N^{-1-(r-2)\epsilon}$ for some $\epsilon>0$ are universal. This includes sparse matrices…
The Lyapunov order appeared in the study of Nevanlinna-Pick interpolation for positive real odd functions with general (real) matrix points. For real or complex matrices $A$ and $B$ it is said that $B$ Lyapunov dominates $A$ if…
Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…
Parity games are combinatorial representations of closed Boolean mu-terms. By adding to them draw positions, they have been organized by Arnold and one of the authors into a mu-calculus. As done by Berwanger et al. for the propositional…
We consider the adjacency matrix of the ensemble of Erd\H{o}s-R\'enyi random graphs which consists of graphs on $N$ vertices in which each edge occurs independently with probability $p$. We prove that in the regime $pN \gg 1$ these matrices…
We discuss the problem of adding random matrices, which enable us to study Hamiltonians consisting of a deterministic term plus a random term. Using a diagrammatic approach and introducing the concept of ``gluon connectedness," we calculate…
We introduce a notion of halfspace for Hadamard manifolds that is natural in the context of convex optimization. For this notion of halfspace, we generalize a classic result of Gr\"unbaum, which itself is a corollary of Helly's theorem.…
A trade in a complex Hadamard matrix is a set of entries which can be changed to obtain a different complex Hadamard matrix. We show that in a real Hadamard matrix of order $n$ all trades contain at least $n$ entries. We call a trade…
The concept of switching has arisen in several different areas within combinatorics. The act of switching usually transforms a combinatorial object into a non-isomorphic object of the same type, in a way that some key property is preserved.…
We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…
The singular values of products of standard complex Gaussian random matrices, or sub-blocks of Haar distributed unitary matrices, have the property that their probability distribution has an explicit, structured form referred to as a…
The main purpose of this paper of the paper is an explicite construction of generalized Gaussian process with function $t_b(V)=b^{H(V)}$, where $H(V)=n-h(V)$, $h(V)$ is the number of singletons in a pair-partition $V \in \st{P}_2(2n)$. This…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…