A maximum concurrence criterion to investigate absolutely maximally entangled states

• URL: http://arxiv.org/abs/2501.15477v1
• Date: Sun, 26 Jan 2025 10:46:03 GMT
• Title: A maximum concurrence criterion to investigate absolutely maximally entangled states
• Abstract summary: We use the criterion of maximal I-concurrence, a measure of entanglement, to determine the maximal entanglement of pure states.<n>We identify numerous Absolutely Maximallyangled (AME) pure states that exhibit maximal entanglement across all possible bipartitions.
• Score: 0.7373617024876725
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We propose a straightforward method to determine the maximal entanglement of pure states using the criterion of maximal I-concurrence, a measure of entanglement. The square of concurrence for a bipartition $X|X^\prime$ of a pure state is defined as $E^2_{X| X ^\prime}=2[1-tr({\rho_X}^2)]$. From this, we can infer that the concurrence $E_{X| X ^\prime}$ reaches its maximum when $tr({\rho_X}^2)$ is minimized. Using this approach, we identify numerous Absolutely Maximally Entangled (AME) pure states that exhibit maximal entanglement across all possible bipartitions. Conditions are derived for pure states to achieve maximal mixedness in all bipartitions, revealing that any pure state with an odd number of subsystem coefficients does not meet the AME criterion. Furthermore, we obtain equal maximal multipartite entangled pure states across all bipartitions using our maximal concurrence criterion.

Related papers

• An Argmax Principle for Sum-of-Squares Relaxations on the Sphere [42.540924632302925]
  We develop an argmax principle for analyzing sum-of-squares relaxations of optimization problems over the unit sphere.<n>Our guiding principle is that its maximizers are rounding candidates.
  arXiv  Detail & Related papers  (2026-08-03T17:58:00Z)
• Optimal Quantum de Finetti Theorems via Argmax Rounding [42.55259086694773]
  We prove optimal finite quantum de Finetti upper bounds for bosonic states and arbitrary exchangeable states.<n>Our proof formulates de Finetti approximation as the integrality gap of a symmetric-extension semidefinite program.<n> spectral truncation gives the first dimension-free bosonic de Finetti theorem in Hilbert--Schmidt distance.
  arXiv  Detail & Related papers  (2026-08-03T17:57:15Z)
• Extremal Marginal States of Maximal Rank in $(d, d+m)$ [0.42970700836450487]
  We study the extreme points of the convex set $mathcalC(_2)$ of bipartite quantum states with fixed marginals.<n>We construct extreme points in $(d,,d+m)$ dimension, of rank $d+m$, matching the highest possible value.<n>This proves the existence of extremal states with relatively large rank and also covers all the known examples.
  arXiv  Detail & Related papers  (2026-05-26T12:18:51Z)
• Optimal Dimension-Free Sampling for Regularized Classification [56.72526267755301]
  We prove optimal sampling bounds achieving $(1pmvarepsilon)$-relative error for a broad class of Lipschitz continuous classification loss functions.<n>This includes important functions such as logistic and sigmoid loss, hinge loss, and ReLU loss, as prominent and popular representative examples.
  arXiv  Detail & Related papers  (2026-05-22T15:05:33Z)
• The most discriminable quantum states in the multicopy regime [0.410492188035848]
  We consider uniformly distributed ensembles of the form $leftfrac1N,_iotimes kright_i=1N$, where $N$ states in dimension $d$ are provided in $k$ identical copies.<n>For pure state ensembles, we prove that whenever $N$ is large enough to support a state $k$-design, these designs will exactly give rise to the maximally discriminable sets.<n>We also analyse the analogue classical discrimination problems, in which states are replaced by probability distributions.
  arXiv  Detail & Related papers  (2026-04-29T17:41:12Z)
• Optimal Scalar Quantization for Matrix Multiplication: Closed-Form Density and Phase Transition [50.36362492608702]
  We study entrywise scalar quantization of two matrices prior to multiplication.<n>We obtain a closed-form optimal point density [ star(u) propto exp!left(-fracu26right)bigl( (1-2)+2u22bigr), qquad u=fracx_X,, and prove a correlation-driven phase transition.
  arXiv  Detail & Related papers  (2026-03-20T01:53:44Z)
• Hardness of High-Dimensional Linear Classification [58.29089693778071]
  We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem.<n>Both are fundamental problems in computational geometry and machine learning in their exact and approximate forms.
  arXiv  Detail & Related papers  (2026-03-19T15:53:41Z)
• On the maximum purity of absolutely separable bipartite states [0.0]
  We propose a conjectured maximum purity for absolutely separable qubit-qudit states and absolutely PPT qutrit-qudit states.<n>From the geometric viewpoint, this problem is equivalent to asking for the exact Euclidean radius of the smallest ball around the maximally mixed state.
  arXiv  Detail & Related papers  (2025-10-22T12:04:17Z)
• Quantum Max-Cut is NP hard to approximate [0.06768558752130309]
  We prove that it is NP-hard to compute a constant multiplicative approximation to the QUANTUM MAX-CUT problem on an unweighted graph of constant bounded degree.
  arXiv  Detail & Related papers  (2025-10-09T09:32:08Z)
• Near-Optimal Clustering in Mixture of Markov Chains [74.3828414695655]
  We study the problem of clustering $T$ trajectories of length $H$, each generated by one of $K$ unknown ergodic Markov chains over a finite state space of size $S$.<n>We derive an instance-dependent, high-probability lower bound on the clustering error rate, governed by the weighted KL divergence between the transition kernels of the chains.<n>We then present a novel two-stage clustering algorithm.
  arXiv  Detail & Related papers  (2025-06-02T05:10:40Z)
• Maximal Magic for Two-qubit States [0.0]
  We investigate two-qubit states with maximal magic, which are most distinct from classical simulability. We reveal a striking interplay between magic and entanglement: the entanglement of maximal magic states is restricted to two possible values.
  arXiv  Detail & Related papers  (2025-02-24T19:00:00Z)
• Continuous K-Max Bandits [54.21533414838677]
  We study the $K$-Max multi-armed bandits problem with continuous outcome distributions and weak value-index feedback. This setting captures critical applications in recommendation systems, distributed computing, server scheduling, etc. Our key contribution is the computationally efficient algorithm DCK-UCB, which combines adaptive discretization with bias-corrected confidence bounds.
  arXiv  Detail & Related papers  (2025-02-19T06:37:37Z)
• On the (Classical and Quantum) Fine-Grained Complexity of Log-Approximate CVP and Max-Cut [2.2776283699063664]
  We show a linear sized reduction from the Maximum Cut Problem (Max-Cut) with $1 - varepsilon$ and soundness $1 - varepsilon1/2$ to the $gamma$-Approximate Closest Vector Problem under any finite $ell_p$-norm. We show that any sub-exponential time (classical or quantum) algorithm for the $o(sqrtlog nfrac1p)$-Approximate Closest Vector Problem in any finite $ell_p$-norm implies a faster than the state-
  arXiv  Detail & Related papers  (2024-11-06T18:58:17Z)
• Large Deviation Upper Bounds and Improved MSE Rates of Nonlinear SGD: Heavy-tailed Noise and Power of Symmetry [47.653744900375855]
  We provide a framework of optimal convex gradient methods in the presence of heavy-tailed noise. We show an explicit dependence on the choice of step-size-tailed nonlinearity, noise and problem parameters. We provide an MSE $widetmathcalO(t-1)$ that can be made close to the optimal $mathcalO(t-1)$.
  arXiv  Detail & Related papers  (2024-10-21T04:50:57Z)
• Bounds on the ground state energy of quantum $p$-spin Hamiltonians [2.594420805049218]
  We consider the problem of estimating the ground state energy of quantum $p$local spin glass random Hamiltonians. Our main result shows that the maximum energy achievable by product states has a well-defined limit.
  arXiv  Detail & Related papers  (2024-04-03T18:00:05Z)
• Maximally entangled mixed states for a fixed spectrum do not always exist [0.0]
  Entanglement is a resource under local operations assisted by classical communication (LOCC) It is a well-known result that the $d$-dimensional Bell state is the maximally entangled state in the set of all bipartite states of local dimension $d$.
  arXiv  Detail & Related papers  (2024-02-08T13:49:34Z)
• Dimension-free discretizations of the uniform norm by small product sets [45.85600902330814]
  A classical inequality of Bernstein compares the supremum norm of $f$ over the unit circle to its supremum norm over the sampling set of the $K$-th roots of unity.<n>We show that dimension-free discretizations are possible with sampling sets whose cardinality is independent of $deg(f)$ and is instead governed by the maximum individual degree of $f$.
  arXiv  Detail & Related papers  (2023-10-11T22:46:09Z)
• A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization [53.044526424637866]
  In this paper we consider finding an approximate second-order stationary point (SOSP) that minimizes a twice different subject general non conic optimization. In particular, we propose a Newton-CG based-augmentedconjugate method for finding an approximate SOSP.
  arXiv  Detail & Related papers  (2023-01-10T20:43:29Z)
• Phase estimation with limited coherence [0.0]
  For pure states, we give the minimum estimation variance attainable, $V(C)$, and the optimal state, in the limit when the probe system size, $n$, is large. We show that the variance exhibits a Heisenberg-like scaling, $V(C) sim a_n/C2$, where $a_n$ decreases to $pi2/3$ as $n$ increases, leading to a dimension-independent relation.
  arXiv  Detail & Related papers  (2022-07-12T16:36:59Z)
• Nystr\"om Kernel Mean Embeddings [92.10208929236826]
  We propose an efficient approximation procedure based on the Nystr"om method. It yields sufficient conditions on the subsample size to obtain the standard $n-1/2$ rate. We discuss applications of this result for the approximation of the maximum mean discrepancy and quadrature rules.
  arXiv  Detail & Related papers  (2022-01-31T08:26:06Z)
• Maximal gap between local and global distinguishability of bipartite quantum states [7.605814048051737]
  We prove a tight and close-to-optimal lower bound on the effectiveness of local quantum measurements (without classical communication) at discriminating any two bipartite quantum states.
  arXiv  Detail & Related papers  (2021-10-08T21:40:02Z)
• 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)
• Metrizing Weak Convergence with Maximum Mean Discrepancies [88.54422104669078]
  This paper characterizes the maximum mean discrepancies (MMD) that metrize the weak convergence of probability measures for a wide class of kernels. We prove that, on a locally compact, non-compact, Hausdorff space, the MMD of a bounded continuous Borel measurable kernel k, metrizes the weak convergence of probability measures if and only if k is continuous.
  arXiv  Detail & Related papers  (2020-06-16T15:49:33Z)

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.