Extremal Maximal Entanglement

• URL: http://arxiv.org/abs/2411.12208v1
• Date: Tue, 19 Nov 2024 03:56:34 GMT
• Title: Extremal Maximal Entanglement
• Abstract summary: An $n$-qubit absolutely maximally entangled state only exists when $n$ equals $2$, $3$, $5$, and $6$. A natural question arises when it does not exist: which $n-qubit pure state has the largest number of maximally mixed $lfloor n/2 rfloor-party reductions?
• Score: 12.189398760348018
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A pure multipartite quantum state is called absolutely maximally entangled if all reductions of no more than half of the parties are maximally mixed. However, an $n$-qubit absolutely maximally entangled state only exists when $n$ equals $2$, $3$, $5$, and $6$. A natural question arises when it does not exist: which $n$-qubit pure state has the largest number of maximally mixed $\lfloor n/2 \rfloor$-party reductions? Denote this number by $Qex(n)$. It was shown that $Qex(4)=4$ in [Higuchi et al.Phys. Lett. A (2000)] and $Qex(7)=32$ in [Huber et al.Phys. Rev. Lett. (2017)]. In this paper, we give a general upper bound of $Qex(n)$ by linking the well-known Tur\'an's problem in graph theory, and provide lower bounds by constructive and probabilistic methods. In particular, we show that $Qex(8)=56$, which is the third known value for this problem.

Related papers

• Absolutely Maximally Entangled States of $2q$ Parties in Every Odd Prime-Power Dimension $q$ [0.0]
  Absolutely maximally entangled (AME) states represent an extreme form of multipartite entanglement.<n>For every odd prime power $q=pege3$, we construct a stabilizer $mathrmAME(2q,q)$ state.<n>A Hermitian self-dual maximum distance separable code $[2q,q,q+1]_q2$ lies outside the extended Reed-Solomon classes.
  arXiv  Detail & Related papers  (2026-09-10T16:49:05Z)
• Robust Quantum Extremal Numbers [7.580969262940507]
  The present work develops a robust extension of this extremal problem.<n>For pure states on $4m qubits, the following local stability inequality is established.<n>These results turn exact quantum Turn obstructions into quantitative robustness statements.
  arXiv  Detail & Related papers  (2026-08-14T03:24:23Z)
• An Explicit Scott-Type Bound for Absolutely Maximally Entangled States with Arbitrary Defect [7.9630512253221175]
  Absolutely maximally entangled (AME) states and, more generally, $k$-uniform states in $(Cq)otimes n$ are central objects in multipartite entanglement theory.<n>In the extremal case $k=lfloor n/2rfloor, Scott (2004) proved a sharp nonexistence bound showing that AME states cannot exist once the number of parties $n$ exceeds a threshold of order $2q2$.<n>In this paper, we establish a fully explicit Scott-type upper bound for AME states with arbitrary defect $lge 0$
  arXiv  Detail & Related papers  (2026-06-01T09:06:51Z)
• Quantum Search With Generalized Wildcards [0.4310167974376404]
  We show a quantum algorithm of cost $O(sqrtn log n)$ and a near-matching lower bound of $Omega(sqrtn)$.<n>We show near-tight bounds when $calQ$ is any of the following collections: bounded-size sets, contiguous blocks, prefixes, and only the full set.
  arXiv  Detail & Related papers  (2025-11-06T18:55:05Z)
• Approximating the operator norm of local Hamiltonians via few quantum states [53.16156504455106]
  Consider a Hermitian operator $A$ acting on a complex Hilbert space of $2n$.<n>We show that when $A$ has small degree in the Pauli expansion, or in other words, $A$ is a local $n$-qubit Hamiltonian.<n>We show that whenever $A$ is $d$-local, textiti.e., $deg(A)le d$, we have the following discretization-type inequality.
  arXiv  Detail & Related papers  (2025-09-15T14:26:11Z)
• Linear Programming Bounds on $k$-Uniform States [13.489334588619041]
  The existence of $k$-uniform states has been a widely studied problem due to their applications in several quantum information tasks. We establish several improved non-existence results and bounds on $k$-uniform states.
  arXiv  Detail & Related papers  (2025-03-04T02:53:55Z)
• 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)
• 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)
• Bounds on $k$-Uniform Quantum States [22.266687858571363]
  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
  arXiv  Detail & Related papers  (2023-10-10T07:38:13Z)
• Small k-pairable states [0.9208007322096533]
  Bravyi et al. introduced a family of $k-pairable $n$-qubit states, where $n$ grows exponentially with $k$. We present a family of $k$-pairable $n$-qubit graph states, where $n$ is in $k$, namely $nO(k3ln3k)$. We establish the existence of $k$-vertex-minor-universal graphs of order $O(k4 ln k)$.
  arXiv  Detail & Related papers  (2023-09-18T17:26:27Z)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise [9.378684220920562]
  tightest statistical query (SQ) lower bounds for learnining halfspaces in the presence of Massart noise. We show that for arbitrary $eta in [0,1/2]$ every SQ algorithm achieving misclassification error better than $eta$ requires queries of superpolynomial accuracy.
  arXiv  Detail & Related papers  (2022-01-24T17:33:19Z)
• Simplest non-additive measures of quantum resources [77.34726150561087]
  We study measures that can be described by $cal E(rhootimes N) =E(e;N) ne Ne$.
  arXiv  Detail & Related papers  (2021-06-23T20:27:04Z)
• Local classical MAX-CUT algorithm outperforms $p=2$ QAOA on high-girth regular graphs [0.0]
  We show that for all degrees $D ge 2$ of girth $> 5$, QAOA$ has a larger expected cut fraction than QAOA$$ on $G$. We conjecture that for every constant $p$, there exists a local classical MAX-CUT algorithm that performs as well as QAOA$_p$ on all graphs.
  arXiv  Detail & Related papers  (2021-01-14T09:17:20Z)
• MAXCUT QAOA performance guarantees for p >1 [0.0]
  We obtain worst case performance guarantees for $p=2$ and $3$ QAOA for MAXCUT on uniform 3-regular graphs. We conjecture a hierarchy for all $p$, where worst case graphs have with no cycles $leq 2p+1$.
  arXiv  Detail & Related papers  (2020-10-21T18:00:12Z)
• 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)
• Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals [49.60752558064027]
  We study the fundamental problems of agnostically learning halfspaces and ReLUs under Gaussian marginals. Our lower bounds provide strong evidence that current upper bounds for these tasks are essentially best possible.
  arXiv  Detail & Related papers  (2020-06-29T17:10:10Z)
• Tight Quantum Lower Bound for Approximate Counting with Quantum States [49.6558487240078]
  We prove tight lower bounds for the following variant of the counting problem considered by Aaronson, Kothari, Kretschmer, and Thaler ( 2020) The task is to distinguish whether an input set $xsubseteq [n]$ has size either $k$ or $k'=(1+varepsilon)k$.
  arXiv  Detail & Related papers  (2020-02-17T10:53:50Z)

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.