Related papers: The Number Behind the Simplest SIC-POVM
We describe the sets of accumulation of secants for orbits of real analytic vector fields in dimension three having the origin as only {\omega}-limit point. It is a kind of infinitesimal Poincar\'e-Bendixson problem in dimension three.…
Since the beginning of the quest of hypercomplex numbers in the late eighteenth century, many hypercomplex number systems have been proposed but none of them succeeded in extending the concept of complex numbers to higher dimensions. This…
We associate with any simplicial complex $\K$ and any integer $m$ a system of linear equations and inequalities. If $\K$ has a simplicial embedding in $\R^m$ then the system has an integer solution. This result extends the work of I. Novik…
We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…
The abc conjecture, one of the most famous open problems in number theory, claims that three positive integers satisfying a+b=c cannot simultaneously have significant repetition among their prime factors; in particular, the product of the…
Zauner's conjecture concerns the existence of $d^2$ equiangular lines in $\mathbb{C}^d$; such a system of lines is known as a SIC. In this paper, we construct infinitely many new SICs over finite fields. While all previously known SICs…
We describe explicitly the algebra of polynomial functions on the Hilbert space of four qubit states which are invariant under the SLOCC group $SL(2,{\mathbb C})^{4}$. From this description, we obtain a closed formula for the…
Symmetry shares an entwined history with the structure of physical theory. We propose a consequence of symmetry towards the axiomatic derivation of Hilbert space quantum theory. We introduce the notion of information symmetry (IS) and show…
We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the…
This paper establishes some of the fundamental barriers in the theory of computations and finally settles the long-standing computational spectral problem. That is to determine the existence of algorithms that can compute spectra…
Recently, Zhu classified all the SIC-POVMs whose symmetry groups act doubly transitively. Lattices of integers in the complex numbers, the quaternions and the octonions yield the key parts of these symmetry groups.
Why does quantum theory need the complex numbers? With a view toward answering this question, this paper argues that the usual Hilbert-space formalism is a special case of the general method of Markovian embeddings. This paper then…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
Within the replica framework we study analytically the instance space of the number partitioning problem. This classic integer programming problem consists of partitioning a sequence of N positive real numbers $\{a_1, a_2,..., a_N}$ (the…
The theory of majorization provides a unifying account of several ways in which Symmetric Informationally Complete POVMs are extremal entities.
We introduce the notion of a pseudomultiplier of a Hilbert space $\mathcal H$ of functions on a set $\Omega$. Roughly, a pseudomultiplier of $\mathcal H$ is a function which multiplies a finite-codimensional subspace of $\mathcal H$ into…
We describe a general technique to study Dirac operators on noncommutative spaces under some additional assumptions. The main idea is to capture the compact resolvent condition in a combinatorial set up. Using this, we then prove that for a…
The isoperimetric problem is one of the oldest in geometry and it consists of finding a surface of minimum area that encloses a given volume $V$. It is particularly important in physics because of its strong relation with stability, and…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
A $(k,k-t)$-SCID (set of Subspaces with Constant Intersection Dimension) is a set of $k$-dimensional vector spaces that have pairwise intersections of dimension $k-t$. Let $\mathcal{C}=\{\pi_1,\ldots,\pi_n\}$ be a $(k,k-t)$-SCID. Define…