Related papers: Unextendible maximally entangled bases in dxd
Mutually unbiased bases (MUB) have many applications in quantum information processing and quantum cryptography. Several complex MUB's in $\mathbb{C}^d$ for some dimension $d$ and with larger size have been constructed. On the other hand,…
All complex Hadamard matrices in dimensions two to five are known. We use this fact to derive all inequivalent sets of mutually unbiased (MU) bases in low dimensions. We find a three-parameter family of triples of MU bases in dimension four…
Let $B_n$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_n$ as many times as possible such that the subsets in different copies are incomparable. The…
We put forward a simple construction of genuinely entangled subspaces -- subspaces supporting only genuinely multipartite entangled states -- of any permissible dimensionality for any number of parties and local dimensions. The method uses…
In this paper, we mainly characterize the structure of product bases of the complex vector space $\mathbb{C}^{2}\bigotimes\mathbb{C}^{n}$. It gives an answer to the conjecture in case of $d=2n$ proposed by McNulty et al in 2016. As the…
In this contribution we relate two different key concepts: mutually unbiased bases (MUBs) and entanglement; in particular we focus on bound entanglement, i.e. highly mixed states which cannot be distilled by local operations and classical…
We consider the unextendible product bases (UPBs) of fixed cardinality $m$ in quantum systems of $n$ qubits. These UPBs are divided into finitely many equivalence classes with respect to an equivalence relation introduced by N. Johnston.…
A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of posets. We show that order complexes of thick geometric…
The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…
Rigid frameworks in some Euclidian space are embedded graphs having a unique local realization (up to Euclidian motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings…
Mutually unbiased bases (MUB) are useful in a number of research areas. The symmetry of MUB is an elusive and interesting subject. A (complete set of) MUB in dimension $d$ is sharply covariant if it can be generated by a group of order…
A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…
We consider $d$-dimensional simplicial complexes which can be PL embedded in the $2d$-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is…
We propose a Bell inequality for high-dimensional bipartite systems obtained by binning local measurement outcomes and show that it is tight. We find a binning method for even d-dimensional measurement outcomes for which this Bell…
Excluding the existence of four MUBs in $\bbC^6$ is an open problem in quantum information. We investigate the number of product vectors in the set of four mutually unbiased bases (MUBs) in dimension six, by assuming that the set exists and…
There are fairly large families of unitarily inequivalent complete sets of N+1 mutually unbiased bases (MUBs) in C^N for various prime powers N. The number of such sets is not bounded above by any polynomial as a function of N. While it is…
Akin to the idea of complete sets of Mutually Unbiased Bases for prime dimensional Hilbert spaces, $\mathcal{H}_d$, we study its analogue for a $d$ dimensional subspace of $M (d,\mathbb{C})$, i.e. Mutually Unbiased Unitary Bases (MUUBs)…
A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…
We find the exact size of a maximal non-commuting set in unipotent uppertriangular linear group $UU_4(\mathbb{F}_q)$ in terms of a non-commuting geometric structure (Refer Definition [10]), where $\mathbb{F}_q$ is the finite field with $q$…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…