Bounds on $k$-Uniform Quantum States
- URL: http://arxiv.org/abs/2310.06378v2
- Date: Wed, 29 Nov 2023 08:38:11 GMT
- Title: Bounds on $k$-Uniform Quantum States
- Authors: Fei Shi, Yu Ning, Qi Zhao and Xiande Zhang
- Abstract summary: We provide new upper bounds on the parameter $k$ for the existence of $k$-uniform states in $(mathbbCd)otimes N$.
Since a $k$-uniform state in $(mathbbCd)otimes N$ corresponds to a pure $(N,1,k+1)_d$ quantum error-correcting codes, we also give new upper bounds on the minimum distance $k+1$ of pure $(N,1,k+1))_d$ quantum error-correcting codes
- Score: 22.266687858571363
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Do $N$-partite $k$-uniform states always exist when $k\leq
\lfloor\frac{N}{2}\rfloor-1$? In this work, we provide new upper bounds on the
parameter $k$ for the existence of $k$-uniform states in
$(\mathbb{C}^{d})^{\otimes N}$ when $d=3,4,5$, which extend Rains' bound in
1999 and improve Scott's bound in 2004. Since a $k$-uniform state in
$(\mathbb{C}^{d})^{\otimes N}$ corresponds to a pure $((N,1,k+1))_{d}$ quantum
error-correcting codes, we also give new upper bounds on the minimum distance
$k+1$ of pure $((N,1,k+1))_d$ quantum error-correcting codes. Furthermore, we
generalize Scott's bound to heterogeneous systems, and show some non-existence
results of absolutely maximally entangled states in
$\mathbb{C}^{d_1}\otimes(\mathbb{C}^{d_2})^{\otimes 2n}$.
Related papers
- 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) - A Quantum Approximation Scheme for k-Means [0.16317061277457]
We give a quantum approximation scheme for the classical $k$-means clustering problem in the QRAM model.
Our quantum algorithm runs in time $tildeO left( 2tildeO(frackvarepsilon) eta2 dright)$.
Unlike previous works on unsupervised learning, our quantum algorithm does not require quantum linear algebra subroutines.
arXiv Detail & Related papers (2023-08-16T06:46:37Z) - Constructions of $k$-uniform states in heterogeneous systems [65.63939256159891]
We present two general methods to construct $k$-uniform states in the heterogeneous systems for general $k$.
We can produce many new $k$-uniform states such that the local dimension of each subsystem can be a prime power.
arXiv Detail & Related papers (2023-05-22T06:58:16Z) - Quantization Condition of the Bound States in $n$th-order
Schr\"{o}dinger equations [2.5822051639377137]
We will prove a general approximate quantization rule $% int_L_ER_Ek.
The only hypothesis is that all exponentially growing components are negligible, which is appropriate for not narrow wells.
arXiv Detail & Related papers (2023-04-03T12:07:34Z) - A Variational Quantum Algorithm For Approximating Convex Roofs [0.0]
entanglement measures are first defined for pure states of a bipartite Hilbert space, and then extended to mixed states via the convex roof extension.
We produce a sequence of extensions that we call $f$-$d$ extensions, for $d in mathbbN$.
We introduce a quantum variational algorithm which aims to approximate the $f$-$d$ extensions of entanglement measures defined on pure states.
arXiv Detail & Related papers (2022-03-04T02:30:35Z) - 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) - Scattering data and bound states of a squeezed double-layer structure [77.34726150561087]
A structure composed of two parallel homogeneous layers is studied in the limit as their widths $l_j$ and $l_j$, and the distance between them $r$ shrinks to zero simultaneously.
The existence of non-trivial bound states is proven in the squeezing limit, including the particular example of the squeezed potential in the form of the derivative of Dirac's delta function.
The scenario how a single bound state survives in the squeezed system from a finite number of bound states in the finite system is described in detail.
arXiv Detail & Related papers (2020-11-23T14:40:27Z) - $k$-Uniform states and quantum information masking [15.308818907018546]
A pure state of $N$ parties with local dimension $d$ is called a $k$-uniform state if all the reductions to $k$ parties are maximally mixed.
We show that when $dgeq 4k-2$ is a prime power, there exists a $k$-uniform state for any $Ngeq 2k$ (resp. $2kleq Nleq d+1$)
arXiv Detail & Related papers (2020-09-26T01:27:45Z) - 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) - On the Complexity of Minimizing Convex Finite Sums Without Using the
Indices of the Individual Functions [62.01594253618911]
We exploit the finite noise structure of finite sums to derive a matching $O(n2)$-upper bound under the global oracle model.
Following a similar approach, we propose a novel adaptation of SVRG which is both emphcompatible with oracles, and achieves complexity bounds of $tildeO(n2+nsqrtL/mu)log (1/epsilon)$ and $O(nsqrtL/epsilon)$, for $mu>0$ and $mu=0$
arXiv Detail & Related papers (2020-02-09T03:39:46Z) - 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.