Distinguishability of locally diagonal orthogonally invariant quantum states

• URL: http://arxiv.org/abs/2604.12808v1
• Date: Tue, 14 Apr 2026 14:37:27 GMT
• Title: Distinguishability of locally diagonal orthogonally invariant quantum states
• Abstract summary: We study the distinguishability of quantum states under local operations with classical communication (LOCC), separable, and positive-partial-transpose (PPT) measurements.<n>This class includes many important families such as Werner states, isotropic states, X-states, and Dicke states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the distinguishability of quantum states under local operations with classical communication (LOCC), separable, and positive-partial-transpose (PPT) measurements, focusing on locally diagonal orthogonally invariant (LDOI) states -- those invariant under local diagonal orthogonal twirling. This class includes many important families such as Werner states, isotropic states, X-states, and Dicke states. We show that optimal PPT and separable measurements for distinguishing LDOI states can always be taken to be LDOI, and the LOCC supremum can be approached by LDOI LOCC POVMs, enabling a dimensional reduction from $n^4$ to $O(n^2)$ in the associated optimization problems. We establish efficiently computable bounds on the distinguishability of orthonormal LDOI bases and prove that for a broad class of such bases -- including all two-qubit cases -- the LOCC supremum equals the PPT and separable optima. More generally, we show the gap between PPT and LOCC distinguishability is at most $(n-2)/(2n^2)$ for local dimension $n$.

Related papers

• Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators [36.94429692322632]
  Finite local Hilbert-space truncations arise naturally in quantum simulations of lattice field theories and motivate qudit encodings.<n>We compare the non-Clifford cost of implementing diagonal evolutions, exemplified by $U=e-it_x2$ in a uniform field-amplitude discretization of a real scalar field, using either one logical $d$-level qudit or $n_b=eil log drceil$ logical qubits.
  arXiv  Detail & Related papers  (2026-04-29T15:25:08Z)
• Optimal pure state cloning and transposition are complementary channels [0.4666493857924358]
  State cloning and state transposition are fundamental transformations which, despite being desirable, cannot be perfectly realised.<n>We show that the best physically allowed realisation of both transformations arises from a single physical process described by an isometry.
  arXiv  Detail & Related papers  (2026-03-24T18:11:29Z)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• Fast and Large-Scale Unbalanced Optimal Transport via its Semi-Dual and Adaptive Gradient Methods [35.76482964927589]
  We analyze the semi-dual formulation of Entropic UOT and demonstrate its suitability for adaptive gradient methods.<n>We show that SGD methods adapt to this local curvature, achieving a convergence rate of $mathcalO(n/varepsilon T)$.<n>For the full batch discrete setting, we derive a nearly tight upper bound on local smoothness depending solely on the gradient step sizes.
  arXiv  Detail & Related papers  (2026-02-11T09:57:30Z)
• Local Distinguishability of Multipartite Orthogonal Quantum States: Generalized and Simplified [1.2891210250935148]
  Walgate, Short, Hardy, and Vedral prove in finite dimensions that there exists a one-way local operations and classical communication protocol.<n>We extend this result to infinite dimensions with a simpler proof.<n>We establish the equivalence between Walgate et al.'s result and the fact that the one-shot environment-assisted classical capacity of every quantum channel is at least 1 bit per channel use.
  arXiv  Detail & Related papers  (2026-01-27T21:36:27Z)
• Optimal Scaling for Locally Balanced Proposals in Discrete Spaces [65.14092237705476]
  We show that efficiency of Metropolis-Hastings (M-H) algorithms in discrete spaces can be characterized by an acceptance rate that is independent of the target distribution. Knowledge of the optimal acceptance rate allows one to automatically tune the neighborhood size of a proposal distribution in a discrete space, directly analogous to step-size control in continuous spaces.
  arXiv  Detail & Related papers  (2022-09-16T22:09:53Z)
• Superdiffusion in random two dimensional system with time-reversal symmetry and long-range hopping [45.873301228345696]
  localization problem in the crossover regime for the dimension $d=2$ and hopping $V(r) propto r-2$ is not resolved yet. We show that for the hopping determined by two-dimensional anisotropic dipole-dipole interactions there exist two distinguishable phases at weak and strong disorder.
  arXiv  Detail & Related papers  (2022-05-29T16:53:20Z)
• Orthogonal product sets with strong quantum nonlocality on plane structure [0.0]
  We construct a strongly nonlocal OPS in $mathcalCd_Aotimes mathcalCd_C$ $(d_A,B,Cgeq 4)$ and generalize the structures of known OPSs to any possible three and four-partite systems. It is shown that the protocols without teleportation use less entanglement resources on average and these sets can always be discriminated locally with multiple copies of 2-qubit maximally entangled states.
  arXiv  Detail & Related papers  (2022-05-22T13:07:16Z)
• Local Convertibility in quantum spin systems [0.0]
  We argue that a lack of differential local convertibility (dLC) signals a higher computational power of the system's quantum phase. We argue that states with finite order parameters must be the most classical ones and thus be locally convertible.
  arXiv  Detail & Related papers  (2022-01-25T20:51:31Z)
• Discrimination of quantum states under locality constraints in the many-copy setting [18.79968161594709]
  We prove that the optimal average error probability always decays exponentially in the number of copies. We show an infinite separation between the separable (SEP) and PPT operations by providing a pair of states constructed from an unextendible product basis (UPB) On the technical side, we prove this result by providing a quantitative version of the well-known statement that the tensor product of UPBs is a UPB.
  arXiv  Detail & Related papers  (2020-11-25T23:26:33Z)
• Anisotropy-mediated reentrant localization [62.997667081978825]
  We consider a 2d dipolar system, $d=2$, with the generalized dipole-dipole interaction $sim r-a$, and the power $a$ controlled experimentally in trapped-ion or Rydberg-atom systems. We show that the spatially homogeneous tilt $beta$ of the dipoles giving rise to the anisotropic dipole exchange leads to the non-trivial reentrant localization beyond the locator expansion.
  arXiv  Detail & Related papers  (2020-01-31T19:00:01Z)

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.