Related papers: Mutually Unbiased Weighing Matrices
Two orthonormal bases B and B' of a d-dimensional complex inner-product space are called mutually unbiased if and only if |<b|b'>|^2=1/d holds for all b in B and b' in B'. The size of any set containing (pairwise) mutually unbiased bases of…
This paper is dedicated to the problem of verification of matrices for unitary similarity. For the case of nonderogatory matrices, we have been able to present the new solution for this problem based on geometric approach. The main…
Quantum systems with variables in ${\mathbb Z}(d)$ are considered. The properties of lines in the ${\mathbb Z}(d)\times {\mathbb Z}(d)$ phase space of these systems, are studied. Weak mutually unbiased bases in these systems are defined as…
Mutual unbiasedness of the eigenstates of phase-space operators-such as position and momentum, or their standard coarse grained versions-exists only in the limiting case of infinite squeezing. In [Phys. Rev. Lett. 120, 040403 (2018)] it was…
An uncomplicated and easily handling prescription that converts the task of checking the unitarity of massive, topologically massive, models into a straightforward algebraic exercise, is developed. The algorithm is used to test the…
A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and…
Given two matroids $\mathcal{M}_1$ and $\mathcal{M}_2$ over the same ground set, the matroid intersection problem is to find the maximum cardinality common independent set. In the weighted version of the problem, the goal is to find a…
Matrices are built and designed by applying procedures from lower order matrices. Matrix tensor products, direct sums or multiplication of matrices are such procedures and a matrix built from these is said to be a {\em separable} matrix. A…
We show that k=w+2 mutually unbiased bases can be constructed in any square dimension d=s^2 provided that there are w mutually orthogonal Latin squares of order s. The construction combines the design-theoretic objects (k,s)-nets (which can…
The complete classification of all 6x6 complex Hadamard matrices is an open problem. The 3-parameter Karlsson family encapsulates all Hadamards that have been parametrised explicitly. We prove that such matrices satisfy a non-trivial…
The paper gives a short introduction to mutually unbiased bases and the Welch bounds and demonstrates that the latter is a good technical tool to explore the former. In particular, a criterion for a system of vectors to satisfy the Welch…
An equiangular tight frame (ETF) yields a type of optimal packing of lines in a Euclidean space. ETFs seem to be rare, and all known infinite families of them arise from some type of combinatorial design. In this paper, we introduce a new…
A collection of orthonormal bases for a complex dXd Hilbert space is called mutually unbiased (MUB) if for any two vectors v and w from different bases the square of the inner product equals 1/d: |<v,w>| ^{2}=1/d. The MUB problem is to…
We study the matrix completion problem when the observation pattern is deterministic and possibly non-uniform. We propose a simple and efficient debiased projection scheme for recovery from noisy observations and analyze the error under a…
Constructing four six-dimensional mutually unbiased bases (MUBs) is an open problem in quantum physics and measurement. We investigate the existence of four MUBs including the identity, and a complex Hadamard matrix (CHM) of Schmidt rank…
Mutually unbiased bases which is also maximally entangled bases is called mutually unbiased maximally entangled bases (MUMEBs). We study the construction of MUMEBs in bipartite system. In detail, we construct 2(p^a-1) MUMEBs in C^d\otimes…
A set of mutually unbiased bases (MUBs) is said to be unextendible if there does not exist another basis that is unbiased with respect to the given set. Here, we prove the existence of smaller sets of MUBs in prime-squared dimensions…
We show how positive unital linear maps can be used to obtain lower bounds for the maximum distance between the eigenvalues of two normal matrices. Some related bounds for the spread and condition number of Hermitian matrices are also…
Mutually unbiased bases are an important tool in many applications of quantum information theory. We present a new algorithm for finding the mutually unbiased bases for two-qubit systems. We derive a system of four equations in the Galois…
Graphs are very important mathematical structures used in many applications, one of which is transportation science. When dealing with transportation networks, one deals not only with the network structure, but also with information related…