Constructing mutually unbiased bases from unextendible maximally
entangled bases
- URL: http://arxiv.org/abs/2001.09515v1
- Date: Sun, 26 Jan 2020 20:52:37 GMT
- Title: Constructing mutually unbiased bases from unextendible maximally
entangled bases
- Authors: Hui Zhao, Lin Zhang, Shao-Ming Fei, Naihuan Jing
- Abstract summary: We first present a necessary and sufficient condition of constructing a pair of MUBs in $C2 otimes C4$.
The results are generalized to $C2 otimes Cd$ $(dgeq 3)$ and a concrete example in $C2 otimes C8$ is given.
- Score: 5.184851084700687
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study mutually unbiased bases (MUBs) in which all the bases are
unextendible maximally entangled ones. We first present a necessary and
sufficient condition of constructing a pair of MUBs in $C^2 \otimes C^4$. Based
on this condition, an analytical and necessary condition for constructing MUBs
is given. Moreover we illustrate our approach by some detailed examples in $C^2
\otimes C^4$. The results are generalized to $C^2 \otimes C^d$ $(d\geq 3)$ and
a concrete example in $C^2 \otimes C^8$ is given.
Related papers
- A Theory of Interpretable Approximations [61.90216959710842]
We study the idea of approximating a target concept $c$ by a small aggregation of concepts from some base class $mathcalH$.
For any given pair of $mathcalH$ and $c$, exactly one of these cases holds: (i) $c$ cannot be approximated by $mathcalH$ with arbitrary accuracy.
We show that, in the case of interpretable approximations, even a slightly nontrivial a-priori guarantee on the complexity of approximations implies approximations with constant (distribution-free and accuracy-
arXiv Detail & Related papers (2024-06-15T06:43:45Z) - Dimension-free Remez Inequalities and norm designs [48.5897526636987]
A class of domains $X$ and test sets $Y$ -- termed emphnorm -- enjoy dimension-free Remez-type estimates.
We show that the supremum of $f$ does not increase by more than $mathcalO(log K)2d$ when $f$ is extended to the polytorus.
arXiv Detail & Related papers (2023-10-11T22:46:09Z) - Mutually unbiased maximally entangled bases from difference matrices [0.0]
Based on maximally entangled states, we explore the constructions of mutually unbiased bases in bipartite quantum systems.
We establish $q$ mutually unbiased bases with $q-1$ maximally entangled bases and one product basis in $mathbbCqotimes mathbbCq$ for arbitrary prime power $q$.
arXiv Detail & Related papers (2022-10-04T10:45:22Z) - The Approximate Degree of DNF and CNF Formulas [95.94432031144716]
For every $delta>0,$ we construct CNF and formulas of size with approximate degree $Omega(n1-delta),$ essentially matching the trivial upper bound of $n.
We show that for every $delta>0$, these models require $Omega(n1-delta)$, $Omega(n/4kk2)1-delta$, and $Omega(n/4kk2)1-delta$, respectively.
arXiv Detail & Related papers (2022-09-04T10:01:39Z) - Near-optimal fitting of ellipsoids to random points [68.12685213894112]
A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis.
We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$.
Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
arXiv Detail & Related papers (2022-08-19T18:00:34Z) - A rigidity property of complete systems of mutually unbiased bases [0.0]
We prove that for some unit vectors $b_1,ldots b_n$ in $mathbb Cd$, they can be arranged into $d+1$ orthonormal bases.
arXiv Detail & Related papers (2021-11-30T20:47:16Z) - Mutually unbiased bases: polynomial optimization and symmetry [1.024113475677323]
A set of $k$ orthonormal bases of $mathbb Cd$ is called mutually unbiased $|langle e,frangle |2 = 1/d$ whenever $e$ and $f$ are basis vectors in distinct bases.
We exploit this symmetry (analytically) to reduce the size of the semidefinite programs making them tractable.
arXiv Detail & Related papers (2021-11-10T14:14:53Z) - How to check universality of quantum gates? [0.0]
Our first criterion states that $mathcalSsubset G_d:=U(d)$ is universal if and only if $mathcalS$ forms a $delta$-approximate $t(d)$-design.
Our second universality criterion says that $mathcalSsubset G_d$ is universal if and only if the centralizer of $mathcalSt(d),t(d)=Uotimes t(d)otimes t(d)|U
arXiv Detail & Related papers (2021-11-06T11:58:32Z) - A General Derivative Identity for the Conditional Mean Estimator in
Gaussian Noise and Some Applications [128.4391178665731]
Several identities in the literature connect $E[bf X|bf Y=bf y]$ to other quantities such as the conditional variance, score functions, and higher-order conditional moments.
The objective of this paper is to provide a unifying view of these identities.
arXiv Detail & Related papers (2021-04-05T12:48:28Z) - An Optimal Separation of Randomized and Quantum Query Complexity [67.19751155411075]
We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $ellsqrtbinomdell (1+log n)ell-1,$ sum to at most $cellsqrtbinomdell (1+log n)ell-1,$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant.
arXiv Detail & Related papers (2020-08-24T06:50:57Z) - Construction of mutually unbiased maximally entangled bases in
$\mathbb{C}^{2^s}\otimes\mathbb{C}^{2^s}$ by using Galois rings [0.0]
We construct mutually unbiased maximally entangled bases in $mathbbC2s otimes mathbbC2s$ by using Galois rings.
As applications, we obtain several new types of MUMEBs in $mathbbC2sotimesmathbbC2s$ and prove that $M(2s,2s)geq 3(2s-1)$ raises the lower bound of $M(2s,2s)$ given in cite
arXiv Detail & Related papers (2019-12-28T11:20:42Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.