Towards a resolution of the spin alignment problem

• URL: http://arxiv.org/abs/2307.06894v3
• Date: Tue, 5 Mar 2024 23:42:08 GMT
• Title: Towards a resolution of the spin alignment problem
• Authors: Mohammad A. Alhejji and Emanuel Knill
• Abstract summary: We study a class of optimization problems inspired by the recently introduced spin alignment conjecture. The motivation for our study is the recently introduced spin alignment conjecture.
• Score: 1.6317061277457001
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Consider minimizing the entropy of a mixture of states by choosing each state subject to constraints. If the spectrum of each state is fixed, we expect that in order to reduce the entropy of the mixture, we should make the states less distinguishable in some sense. Here, we study a class of optimization problems that are inspired by this situation and shed light on the relevant notions of distinguishability. The motivation for our study is the recently introduced spin alignment conjecture. In the original version of the underlying problem, each state in the mixture is constrained to be a freely chosen state on a subset of $n$ qubits tensored with a fixed state $Q$ on each of the qubits in the complement. According to the conjecture, the entropy of the mixture is minimized by choosing the freely chosen state in each term to be a tensor product of projectors onto a fixed maximal eigenvector of $Q$, which maximally "aligns" the terms in the mixture. We generalize this problem in several ways. First, instead of minimizing entropy, we consider maximizing arbitrary unitarily invariant convex functions such as Fan norms and Schatten norms. To formalize and generalize the conjectured required alignment, we define alignment as a preorder on tuples of self-adjoint operators that is induced by majorization. We prove the generalized conjecture for Schatten norms of integer order, for the case where the freely chosen states are constrained to be classical, and for the case where only two states contribute to the mixture and $Q$ is proportional to a projector. The last case fits into a more general situation where we give explicit conditions for maximal alignment. The spin alignment problem has a natural "dual" formulation, versions of which have further generalizations that we introduce.

Related papers

• Quasi-quantum states and the quasi-quantum PCP theorem [0.21485350418225244]
  We show that solving the $k$-local Hamiltonian over the quasi-quantum states is equivalent to optimizing a distribution of assignment over a classical $k$-local CSP. Our main result is a PCP theorem for the $k$-local Hamiltonian over the quasi-quantum states in the form of a hardness-of-approximation result.
  arXiv  Detail & Related papers  (2024-10-17T13:43:18Z)
• 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)
• Average entanglement entropy of midspectrum eigenstates of quantum-chaotic interacting Hamiltonians [0.0]
  We show that the magnitude of the negative $O(1)$ correction is only slightly greater than the one predicted for random pure states. We derive a simple expression that describes the numerically observed $nu$ dependence of the $O(1)$ deviation from the prediction for random pure states.
  arXiv  Detail & Related papers  (2023-03-23T18:00:02Z)
• Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems [46.71914490521821]
  This paper introduces a new extragradient-type algorithm for a class of non-nonconcave minimax problems. The proposed algorithm is applicable to constrained and regularized problems.
  arXiv  Detail & Related papers  (2023-02-20T08:37:08Z)
• Global Nash Equilibrium in Non-convex Multi-player Game: Theory and Algorithms [66.8634598612777]
  We show that Nash equilibrium (NE) is acceptable to all players in a multi-player game. We also show that no one can benefit unilaterally from the general theory step by step.
  arXiv  Detail & Related papers  (2023-01-19T11:36:50Z)
• New additivity properties of the relative entropy of entanglement and its generalizations [8.97780713904412]
  We prove that the relative entropy of entanglement is additive when emph at least one of the two states belongs to some specific class. We show that these classes include bipartite pure, maximally correlated, GHZ, Bell diagonal, isotropic, and generalized Dicke states. We extend these results to entanglement monotones based on the $alpha$-$z$ R'enyi relative entropy.
  arXiv  Detail & Related papers  (2022-11-23T09:39:25Z)
• A Primal-Dual Approach to Solving Variational Inequalities with General Constraints [54.62996442406718]
  Yang et al. (2023) recently showed how to use first-order gradient methods to solve general variational inequalities. We prove the convergence of this method and show that the gap function of the last iterate of the method decreases at a rate of $O(frac1sqrtK)$ when the operator is $L$-Lipschitz and monotone.
  arXiv  Detail & Related papers  (2022-10-27T17:59:09Z)
• The quantum commuting model (Ia): The CHSH game and other examples: Uniqueness of optimal states [91.3755431537592]
  We use the universal description of quantum commuting correlations as state space on the universal algebra for two player games. We find that the CHSH game leaves a single optimal state on this common algebra.
  arXiv  Detail & Related papers  (2022-10-07T17:38:31Z)
• Annihilating Entanglement Between Cones [77.34726150561087]
  We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
  arXiv  Detail & Related papers  (2021-10-22T15:02:39Z)
• Asymptotics of Entropy-Regularized Optimal Transport via Chaos Decomposition [1.7188280334580195]
  This paper is on the properties of a discrete Schr"odinger bridge as $N$ tends to infinity. We derive the first two error terms of orders $N-1/2$ and $N-1$, respectively. The kernels corresponding to the first and second order chaoses are given by Markov operators which have natural interpretations in the Sinkhorn algorithm.
  arXiv  Detail & Related papers  (2020-11-17T21:55:46Z)
• Entanglement for any definition of two subsystems [0.0]
  In this work we define the notion of an "absolutely entangled set" of quantum states. For any possible choice of global basis, at least one of the states in the set is entangled. We present a minimum example of this phenomenon, with a set of four states in $mathbbC4 = mathbbC2 otimes mathbbC2$.
  arXiv  Detail & Related papers  (2020-06-12T13:23:13Z)

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.