Construction of mutually unbiased maximally entangled bases in
$\mathbb{C}^{2^s}\otimes\mathbb{C}^{2^s}$ by using Galois rings
- URL: http://arxiv.org/abs/1912.12443v1
- Date: Sat, 28 Dec 2019 11:20:42 GMT
- Title: Construction of mutually unbiased maximally entangled bases in
$\mathbb{C}^{2^s}\otimes\mathbb{C}^{2^s}$ by using Galois rings
- Authors: Dengming Xu
- Abstract summary: 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
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Mutually unbiased bases plays a central role in quantum mechanics and quantum
information processing. As an important class of mutually unbiased bases,
mutually unbiased maximally entangled bases (MUMEBs) in bipartite systems have
attracted much attention in recent years. In the paper, we try to construct
MUMEBs in $\mathbb{C}^{2^s} \otimes \mathbb{C}^{2^s}$ by using Galois rings,
which is different from the work in \cite{xu2}, where finite fields are used.
As applications, we obtain several new types of MUMEBs in
$\mathbb{C}^{2^s}\otimes\mathbb{C}^{2^s}$ and prove that $M(2^s,2^s)\geq
3(2^s-1)$, which raises the lower bound of $M(2^s,2^s)$ given in \cite{xu}.
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) - 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) - A Unified Framework for Uniform Signal Recovery in Nonlinear Generative
Compressed Sensing [68.80803866919123]
Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously.
Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples.
We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
arXiv Detail & Related papers (2023-09-25T17:54:19Z) - Construction of multipartite unextendible product bases and geometric
measure of entanglement of positive-partial-transpose entangled states [0.0]
We show that there exist two families UPBs in Hilbert space $mathbbC2otimesmathbbC2otimesmathbbC2otimesmathbbC2otimesmathbbC4$ by merging two different systems of an existing $7$-qubit UPB of size $11$.
A new family of $7$-qubit positive-partial-transpose entangled states of rank $27-11$ is constructed.
arXiv Detail & Related papers (2022-12-05T17:42:47Z) - 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) - Novel Constructions of Mutually Unbiased Tripartite Absolutely Maximally
Entangled Bases [1.8065361710947974]
We first explore the tripartite absolutely maximally entangled bases and mutually unbiased bases in $mathbbCd otimes mathbbCd$
We then generalize the approach to the case of $mathbbCd_1 otimes mathbbCd_2 otimes mathbbCd_1d_1d_2$ by mutually weak Latin squares.
The concise direct constructions of mutually unbiased tripartite absolutely maximally entangled bases are
arXiv Detail & Related papers (2022-09-18T03:42:20Z) - Monogamy of entanglement between cones [68.8204255655161]
We show that monogamy is not only a feature of quantum theory, but that it characterizes the minimal tensor product of general pairs of convex cones.
Our proof makes use of a new characterization of products of simplices up to affine equivalence.
arXiv Detail & Related papers (2022-06-23T16:23:59Z) - Learning a Single Neuron with Adversarial Label Noise via Gradient
Descent [50.659479930171585]
We study a function of the form $mathbfxmapstosigma(mathbfwcdotmathbfx)$ for monotone activations.
The goal of the learner is to output a hypothesis vector $mathbfw$ that $F(mathbbw)=C, epsilon$ with high probability.
arXiv Detail & Related papers (2022-06-17T17:55:43Z) - Graph States and the Variety of Principal Minors [0.0]
In Quantum Information theory, graph states are quantum states defined by graphs.
In this work we exhibit a correspondence between graph states and the variety of binary symmetric principal minors, in particular their corresponding orbits under the action of $SL(2,mathbb F_2)times nrtimes mathfrak S_n$.
arXiv Detail & Related papers (2021-07-06T08:48:05Z) - Bulk-boundary asymptotic equivalence of two strict deformation
quantizations [0.0]
The existence of a strict deformation quantization of $X_k=S(M_k(mathbbC))$ has been proven by both authors and K. Landsman citeLMV.
A similar result is known for the symplectic manifold $S2subsetmathbbR3$.
arXiv Detail & Related papers (2020-05-09T12:03:18Z)
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.