On the continuous Zauner conjecture

• URL: http://arxiv.org/abs/2112.05875v1
• Date: Sat, 11 Dec 2021 00:14:35 GMT
• Title: On the continuous Zauner conjecture
• Authors: Danylo Yakymenko
• Abstract summary: In this paper we prove that for any $t in [-frac1d2-1, frac1d+1] setminus0$ the equality $textebr(Phi_t)=d2$ is equivalent to the existence of a pair of informationally complete unit norm tight frames.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In a recent paper by S.Pandey, V.Paulsen, J.Prakash, and M.Rahaman, the authors studied the entanglement breaking quantum channels $\Phi_t:\mathbb{C}^{d\times d} \to \mathbb{C}^{d \times d}$ for $t \in [-\frac{1}{d^2-1}, \frac{1}{d+1}]$ defined by $\Phi_t(X) = tX+ (1-t)\text{Tr}(X) \frac{1}{d}I$. They proved that Zauner's conjecture is equivalent to the statement that entanglement breaking rank of $\Phi_{\frac{1}{d+1}}$ is $d^2$. The authors made the extended conjecture that $\text{ebr}(\Phi_t)=d^2$ for every $t \in [0, \frac{1}{d+1}]$ and proved it in dimensions 2 and 3. In this paper we prove that for any $t \in [-\frac{1}{d^2-1}, \frac{1}{d+1}] \setminus\{0\}$ the equality $\text{ebr}(\Phi_t)=d^2$ is equivalent to the existence of a pair of informationally complete unit norm tight frames $\{|x_i\rangle\}_{i=1}^{d^2}, \{|y_i\rangle\}_{i=1}^{d^2}$ in $\mathbb{C}^d $ which are mutually unbiased in a certain sense. That is, for any $i\neq j$ it holds that $|\langle x_i|y_j\rangle|^2 = \frac{1-t}{d}$ and $|\langle x_i|y_i\rangle|^2 = \frac{t(d^2-1)+1}{d}$ (also it follows that $|\langle x_i|x_j\rangle\langle y_i|y_j\rangle|=|t|$). Though, our numerical searches for solutions were not successful in dimensions 4 and 5 for values of $t$ other than $0$ or $\frac{1}{d+1}$.

Related papers

• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• A class of ternary codes with few weights [0.0]
  In this paper, we investigate a ternary code $mathcalC$ of length $n$, defined by $mathcalC$ := (textTr) := (textTr(dx), dots, dots, d_n$. Using recent results on explicit evaluations of exponential sums, we determine the Weil bound, and techniques, we show that the dual code of $mathcalC$ is optimal with respect to the Hamming bound.
  arXiv  Detail & Related papers  (2024-10-05T16:15:50Z)
• Efficient Continual Finite-Sum Minimization [52.5238287567572]
  We propose a key twist into the finite-sum minimization, dubbed as continual finite-sum minimization. Our approach significantly improves upon the $mathcalO(n/epsilon)$ FOs that $mathrmStochasticGradientDescent$ requires. We also prove that there is no natural first-order method with $mathcalOleft(n/epsilonalpharight)$ complexity gradient for $alpha 1/4$, establishing that the first-order complexity of our method is nearly tight.
  arXiv  Detail & Related papers  (2024-06-07T08:26:31Z)
• Dimension Independent Disentanglers from Unentanglement and Applications [55.86191108738564]
  We construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input. We show that to capture NEXP, it suffices to have unentangled proofs of the form $| psi rangle = sqrta | sqrt1-a | psi_+ rangle where $| psi_+ rangle has non-negative amplitudes.
  arXiv  Detail & Related papers  (2024-02-23T12:22:03Z)
• 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)
• On Outer Bi-Lipschitz Extensions of Linear Johnson-Lindenstrauss Embeddings of Low-Dimensional Submanifolds of $\mathbb{R}^N$ [0.24366811507669117]
  Let $mathcalM$ be a compact $d$-dimensional submanifold of $mathbbRN$ with reach $tau$ and volume $V_mathcal M$. We prove that a nonlinear function $f: mathbbRN rightarrow mathbbRmm exists with $m leq C left(d / epsilon2right) log left(fracsqrt[d]V_math
  arXiv  Detail & Related papers  (2022-06-07T15:10:46Z)
• Matrix concentration inequalities and efficiency of random universal sets of quantum gates [0.0]
  For a random set $mathcalS subset U(d)$ of quantum gates we provide bounds on the probability that $mathcalS$ forms a $delta$-approximate $t$-design. We show that for $mathcalS$ drawn from an exact $t$-design the probability that it forms a $delta$-approximate $t$-design satisfies the inequality $mathbbPleft(delta geq x right)leq 2D_t
  arXiv  Detail & Related papers  (2022-02-10T23:44:09Z)
• Learning low-degree functions from a logarithmic number of random queries [77.34726150561087]
  We prove that for any integer $ninmathbbN$, $din1,ldots,n$ and any $varepsilon,deltain(0,1)$, a bounded function $f:-1,1nto[-1,1]$ of degree at most $d$ can be learned.
  arXiv  Detail & Related papers  (2021-09-21T13:19:04Z)
• Sharper bounds for online learning of smooth functions of a single variable [0.0]
  We show that $opt_1+epsilon(mathcalF_q) = Theta(epsilon-frac12)$, where the constants in the bound do not depend on $q$. We also show that $opt_1+epsilon(mathcalF_q) = Theta(epsilon-frac12)$, where the constants in the bound do not depend on $q$.
  arXiv  Detail & Related papers  (2021-05-30T23:06:21Z)
• Linear Bandits on Uniformly Convex Sets [88.3673525964507]
  Linear bandit algorithms yield $tildemathcalO(nsqrtT)$ pseudo-regret bounds on compact convex action sets. Two types of structural assumptions lead to better pseudo-regret bounds.
  arXiv  Detail & Related papers  (2021-03-10T07:33:03Z)
• Some convergent results for Backtracking Gradient Descent method on Banach spaces [0.0]
  bf Theorem. Let $X$ be a Banach space and $f:Xrightarrow mathbbR$ be a $C2$ function. Let $mathcalC$ be the set of critical points of $f$.
  arXiv  Detail & Related papers  (2020-01-16T12:49: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.