English
Related papers

Related papers: Mutually Unbiased Weighing Matrices

200 papers

We study entanglement witness and present a construction of entanglement witnesses in terms of the mutually unbiased measurements (MUMs). These witnesses include the entanglement witnesses constructed from mutually unbiased bases (MUBs) as…

Quantum Physics · Physics 2019-12-05 Tao Li , Le-Min Lai , Shao-Ming Fei , Zhi-Xi Wang

We show how positive unital linear maps can be used to obtain some bounds for the eigenvalues of nonnegative matrices.

Functional Analysis · Mathematics 2020-02-04 R. Sharma , M. Pal , A. Sharma

The structural characterization of high-dimensional mutually unbiased bases (MUBs) by classifying MUBs subsets remains a major open problem. The existing methods not only fail to conclude on the exact classification, but also are severely…

Quantum Physics · Physics 2025-12-05 Jianxin Song , Zhen-Peng Xu , Changliang Ren

Linear mixed models (LMMs) are used extensively to model dependecies of observations in linear regression and are used extensively in many application areas. Parameter estimation for LMMs can be computationally prohibitive on big data.…

Machine Learning · Statistics 2019-03-08 Zilong Tan , Kimberly Roche , Xiang Zhou , Sayan Mukherjee

We report on a search for mutually unbiased bases (MUBs) in 6 dimensions. We find only triplets of MUBs, and thus do not come close to the theoretical upper bound 7. However, we point out that the natural habitat for sets of MUBs is the set…

Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…

Representation Theory · Mathematics 2014-03-12 Tatiana G. Gerasimova , Roger A. Horn , Vladimir V. Sergeichuk

We tabulate bounds on the optimal number of mutually unbiased bases in R^d. For most dimensions d, it can be shown with relatively simple methods that either there are no real orthonormal bases that are mutually unbiased or the optimal…

Quantum Physics · Physics 2007-05-23 P. Oscar Boykin , Meera Sitharam , Mohamad Tarifi , Pawel Wocjan

A set of $k$ orthonormal bases of $\mathbb C^d$ is called mutually unbiased if $|\langle e,f\rangle |^2 = 1/d$ whenever $e$ and $f$ are basis vectors in distinct bases. A natural question is for which pairs $(d,k)$ there exist~$k$ mutually…

Optimization and Control · Mathematics 2024-05-01 Sander Gribling , Sven Polak

Mutually unbiased bases (MUBs) are a primitive used in quantum information processing to capture the principle of complementarity. While constructions of maximal sets of d+1 such bases are known for systems of prime power dimension d, it is…

Quantum Physics · Physics 2023-11-27 Andreas Klappenecker , Martin Roetteler

There has been great interest in finding sets of $m$ mutually unbiased bases which are compatible with a given space $\mathbb{C}^d$, specially in physics due to their interesting applications in quantum information theory. Several general…

Quantum Physics · Physics 2014-01-08 J. Batle

We derive a framework for quantifying entanglement in multipartite and high dimensional systems using only correlations in two unbiased bases. We furthermore develop such bounds in cases where the second basis is not characterized beyond…

Quantum Physics · Physics 2017-07-31 Paul Erker , Mario Krenn , Marcus Huber

We investigate weighted settings of popular matching problems with matroid constraints. The concept of popularity was originally defined for matchings in bipartite graphs, where vertices have preferences over the incident edges. There are…

Computer Science and Game Theory · Computer Science 2024-07-16 Gergely Csáji , Tamás Király , Kenjiro Takazawa , Yu Yokoi

We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classical problem with applications in many fields, in particular,…

Data Structures and Algorithms · Computer Science 2007-05-23 Benjamin Doerr , Tobias Friedrich , Christian Klein , Ralf Osbild

Very recently, Bai [Linear Algebra Appl., 681:150-186, 2024 \& Appl. Math. Lett., 166:109510, 2025] studied some concrete structures, and obtained essential algebraic and computational properties of the one-dimensional, two-dimensional and…

Rings and Algebras · Mathematics 2025-06-19 Aaisha Be , Nachiketa Mishra , Debasisha Mishra

In this paper we present an unsupervised method to learn the weights with which the scores of multiple classifiers must be combined in classifier fusion settings. We also introduce a novel metric for ranking instances based on an index…

Machine Learning · Computer Science 2015-02-09 Anurag Kumar , Bhiksha Raj

Unbinned maximum likelihood is a common procedure for parameter estimation. After parameters have been estimated, it is crucial to know whether the fit model adequately describes the experimental data. Univariate Goodness of Fit procedures…

Applications · Statistics 2011-02-14 Giulio Palombo

Mutually unbiased bases (MUB) are an elusive discrete structure in Hilbert spaces. Many (complete sets of) MUB are group covariant, but little is known whether they can be sharply covariant in the sense that the generating groups can have…

Quantum Physics · Physics 2015-03-03 Huangjun Zhu

An efficient method for assessing the quality of quantum state tomography is developed. Special attention is paid to the tomography of multipartite systems in terms of unbiased measurements. Although the overall reconstruction errors of…

Quantum Physics · Physics 2013-11-19 J. Rehacek , Z. Hradil , A. B. Klimov , G. Leuchs , L. L. Sanchez-Soto

This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…

Multiagent Systems · Computer Science 2022-01-13 Pedro M. Sequeira , António P. Aguiar , João Hespanha

We prove an upper bound on sums of squares of minors of {+1, -1} matrices. The bound is sharp for Hadamard matrices, a result due to de Launey and Levin (2009), but our proof is simpler. We give several corollaries relevant to minors of…

Combinatorics · Mathematics 2013-09-10 Richard P. Brent , Judy-anne H. Osborn
‹ Prev 1 3 4 5 6 7 10 Next ›