English
Related papers

Related papers: Almost Perfect Mutually Unbiased Bases that are Sp…

200 papers

When an optimal measurement is made on a qubit and what we call an Unbiased Mixture of the resulting ensembles is taken, then the post measurement density matrix is shown to be related to the pre-measurement density matrix through a simple…

Quantum Physics · Physics 2009-11-10 Chirag Dhara , N. D. Hari Dass

The construction of optimal line packings in real or complex Euclidean spaces has shown to be a tantalizingly difficult task, because it includes the problem of finding maximal sets of equiangular lines. In the regime where equiangular…

Functional Analysis · Mathematics 2016-07-18 Bernhard G. Bodmann , John I. Haas

We prove a Tb theorem on quasimetric spaces equipped with what we call an upper doubling measure. This is a property that encompasses both the doubling measures and those satisfying the upper power bound \mu(B(x,r)) \le Cr^d. Our spaces are…

Functional Analysis · Mathematics 2013-01-14 Tuomas Hytönen , Henri Martikainen

The purpose of this paper is to introduce techniques of obtaining optimal ways to determine a d-level quantum state or distinguish such states. It entails designing constrained elementary measurements extracted from maximal abelian subsets…

Quantum Physics · Physics 2021-04-28 S. Chaturvedi , Sibasish Ghosh , K. R. Parthasarathy , Ajit Iqbal Singh

For a system of N qubits, spanning a Hilbert space of dimension d=2^N, it is known that there exists d+1 mutually unbiased bases. Different construction algorithms exist, and it is remarkable that different methods lead to sets of bases…

Quantum Physics · Physics 2009-11-11 J. L. Romero , G. Bjork , A. B. Klimov , L. L. Sanchez-Soto

It is conjectured that the question of the existence of projective planes whose order is not a power of prime is intimately linked with the problem whether there exists a set of d+1 mutually unbiased bases in a d-dimensional Hilbert space…

Mathematical Physics · Physics 2009-11-10 Metod Saniga , Michel Planat , Haret Rosu

Toric $t$-designs, or equivalently $t$-designs on the diagonal subgroup of the unitary group, are sets of points on the torus over which sums reproduce integrals of degree $t$ monomials over the full torus. Motivated by the projective…

Quantum Physics · Physics 2024-12-10 Joseph T. Iosue , T. C. Mooney , Adam Ehrenberg , Alexey V. Gorshkov

An important problem in quantum information is to construct multiqubit unextendible product bases (UPBs). By using the unextendible orthogonal matrices, we construct a 7-qubit UPB of size 11. It solves an open problem in [Quantum…

Quantum Physics · Physics 2021-02-24 Yize Sun , Lin Chen

We give a synthetic construction of a complete system of mutually unbiased bases in $\mathbb{C}^3$.

Differential Geometry · Mathematics 2024-06-03 Mikhail G. Katz

An orthogonal product basis (OPB) of a finite-dimensional Hilbert space $H=H_1\otimes H_2\otimes\cdots\otimes H_n$ is an orthonormal basis of $H$ consisting of product vectors $x_1\otimes x_2\otimes\cdots\otimes x_n$. We show that the…

Quantum Physics · Physics 2017-09-06 Lin Chen , Dragomir Z Djokovic

Efficient understanding of a quantum system fundamentally relies on the selection of observables. Pauli observables and mutually unbiased bases (MUBs) are widely used in practice and are often regarded as theoretically optimal for quantum…

Quantum Physics · Physics 2024-11-28 Yu Wang , Hanru Jiang , Yongxiang Liu , Keren Li

We study three fundamental three-dimensional (3D) geometric packing problems: 3D (Geometric) Bin Packing (3D-BP), 3D Strip Packing (3D-SP), and Minimum Volume Bounding Box (3D-MVBB), where given a set of 3D (rectangular) cuboids, the goal…

Computational Geometry · Computer Science 2025-04-22 Debajyoti Kar , Arindam Khan , Malin Rau

Stochastic programming is often challenged by epistemic uncertainty, where critical probability distributions are poorly characterized or unknown due to a lack of data. To address this, we pioneer a novel framework for stochastic…

Optimization and Control · Mathematics 2026-05-19 Shixin Liu , Ming Gao , Jian Hu

Optimal policies in Markov decision processes (MDPs) are very sensitive to model misspecification. This raises serious concerns about deploying them in high-stake domains. Robust MDPs (RMDP) provide a promising framework to mitigate…

Machine Learning · Computer Science 2019-12-06 Reazul Hasan Russel , Bahram Behzadian , Marek Petrik

An analytical method for getting new complex Hadamard matrices by using mutually unbiased bases and a nonlinear doubling formula is provided. The method is illustrated with the n=4 case that leads to a rich family of eight-dimensional…

Mathematical Physics · Physics 2010-11-02 Petre Dita

We relate the construction of a complete set of cyclic mutually unbiased bases, i. e., mutually unbiased bases generated by a single unitary operator, in power-of-two dimensions to the problem of finding a symmetric matrix over F_2 with an…

Quantum Physics · Physics 2015-05-27 Ulrich Seyfarth , Kedar S. Ranade

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.…

Quantum Physics · Physics 2018-09-05 Lin Chen , Dragomir Z. Djokovic

Mutually unbiased bases (MUBs) and symmetric informationally complete (SIC) positive operator-valued measurements (POVMs) are two related topics in quantum information theory. They are generalized to mutually unbiased measurements (MUMs)…

Quantum Physics · Physics 2017-09-07 Lu Liu , Ting Gao , Fengli Yan

We solved the unextendible maximally entangled basis (UMEB) problem in $\mathbb{C}^{d}\bigotimes\mathbb{C}^{d'}(d\neq d')$,the results turn out to be that there always exist a UMEB.In addition,there might be two sets of UMEB with different…

Quantum Physics · Physics 2014-07-10 Mao-Sheng Li , Yan-Ling Wang , Zhu-Jun Zheng

Complicated generative models often result in a situation where computing the likelihood of observed data is intractable, while simulating from the conditional density given a parameter value is relatively easy. Approximate Bayesian…

Machine Learning · Statistics 2015-12-29 Mijung Park , Wittawat Jitkrittum , Dino Sejdinovic