SIC-POVMs from Stark units: Prime dimensions n^2+3
- URL: http://arxiv.org/abs/2112.05552v2
- Date: Wed, 10 Aug 2022 11:38:06 GMT
- Title: SIC-POVMs from Stark units: Prime dimensions n^2+3
- Authors: Marcus Appleby, Ingemar Bengtsson, Markus Grassl, Michael Harrison,
Gary McConnell
- Abstract summary: We show a recipe for constructing a SIC fiducial vector in complex Hilbert space of dimension of the form $d=n2+3$.
Such structures are shown to exist in thirteen prime dimensions of this kind, the highest being $p=19603$.
- Score: 0.41998444721319206
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose a recipe for constructing a SIC fiducial vector in complex Hilbert
space of dimension of the form $d=n^2+3$, focussing on prime dimensions $d=p$.
Such structures are shown to exist in thirteen prime dimensions of this kind,
the highest being $p=19603$.
The real quadratic base field $K$ (in the standard SIC terminology) attached
to such dimensions has fundamental units $u_K$ of norm $-1$. Let $\mathbb{Z}_K$
denote the ring of integers of $K$, then $p\mathbb{Z}_K$ splits into two ideals
$\mathfrak{p}$ and $\mathfrak{p}'$. The initial entry of the fiducial is the
square $\xi^2$ of a geometric scaling factor $\xi$, which lies in one of the
fields $K(\sqrt{u_K})$. Strikingly, the other $p-1$ entries of the fiducial
vector are each the product of $\xi$ and the square root of a Stark unit. These
Stark units are obtained via the Stark conjectures from the value at $s=0$ of
the first derivatives of partial $L$ functions attached to the characters of
the ray class group of $\mathbb{Z}_K$ with modulus $\mathfrak{p}\infty_1$,
where $\infty_1$ is one of the real places of $K$.
Related papers
- Limit formulas for norms of tensor power operators [49.1574468325115]
Given an operator $phi:Xrightarrow Y$ between Banach spaces, we consider its tensor powers.
We show that after taking the $k$th root, the operator norm of $phiotimes k$ converges to the $2$-dominated norm.
arXiv Detail & Related papers (2024-10-30T14:39:21Z) - 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) - Quantum charges of harmonic oscillators [55.2480439325792]
We show that the energy eigenfunctions $psi_n$ with $nge 1$ are complex coordinates on orbifolds $mathbbR2/mathbbZ_n$.
We also discuss "antioscillators" with opposite quantum charges and the same positive energy.
arXiv Detail & Related papers (2024-04-02T09:16:18Z) - Provably learning a multi-head attention layer [55.2904547651831]
Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models.
In this work, we initiate the study of provably learning a multi-head attention layer from random examples.
We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
arXiv Detail & Related papers (2024-02-06T15:39:09Z) - Families of costs with zero and nonnegative MTW tensor in optimal
transport [0.0]
We compute explicitly the MTW tensor for the optimal transport problem on $mathbbRn$ with a cost function of form $mathsfc$.
We analyze the $sinh$-type hyperbolic cost, providing examples of $mathsfc$-type functions and divergence.
arXiv Detail & Related papers (2024-01-01T20:33:27Z) - Synthesis and Arithmetic of Single Qutrit Circuits [0.9208007322096532]
We study single qutrit quantum circuits consisting of words over the Clifford+ $mathcalD$ gate set.
We characterize classes of qutrit unit vectors $z$ with entries in $mathbbZ[xi, frac1chi]$.
arXiv Detail & Related papers (2023-11-15T04:50:41Z) - 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) - Noncompact uniform universal approximation [0.0]
The universal approximation theorem is generalised to uniform convergence on the (noncompact) input space $mathbbRn$.
All continuous functions that vanish at infinity can be uniformly approximated by neural networks.
arXiv Detail & Related papers (2023-08-07T08:54:21Z) - Increasing subsequences, matrix loci, and Viennot shadows [0.0]
We show that the quotient $mathbbF[mathbfx_n times n]/I_n$ admits a standard monomial basis.
We also calculate the structure of $mathbbF[mathbfx_n times n]/I_n$ as a graded $mathfrakS_n times mathfrakS_n$-module.
arXiv Detail & Related papers (2023-06-14T19:48:01Z) - Spectral properties of sample covariance matrices arising from random
matrices with independent non identically distributed columns [50.053491972003656]
It was previously shown that the functionals $texttr(AR(z))$, for $R(z) = (frac1nXXT- zI_p)-1$ and $Ain mathcal M_p$ deterministic, have a standard deviation of order $O(|A|_* / sqrt n)$.
Here, we show that $|mathbb E[R(z)] - tilde R(z)|_F
arXiv Detail & Related papers (2021-09-06T14:21:43Z)
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.