Multi-copy adaptive local discrimination: Strongest possible two-qubit nonlocal bases

• URL: http://arxiv.org/abs/2011.09287v2
• Date: Wed, 5 May 2021 16:46:06 GMT
• Title: Multi-copy adaptive local discrimination: Strongest possible two-qubit nonlocal bases
• Authors: Manik Banik, Tamal Guha, Mir Alimuddin, Guruprasad Kar, Saronath Halder, Some Sankar Bhattacharya
• Abstract summary: In this letter, we provide examples of orthonormal bases in two-qubit Hilbert space whose adaptive discrimination require 3 copies of the state. We also come up with ensembles whose discrimination under adaptive separable scheme require less number of copies than adaptive local schemes. Our construction finds important application in multipartite secret sharing tasks and indicates towards an intriguing super-additivity phenomenon for locally accessible information.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Ensembles of composite quantum states can exhibit nonlocal behaviour in the sense that their optimal discrimination may require global operations. Such an ensemble containing N pairwise orthogonal pure states, however, can always be perfectly distinguished under adaptive local scheme if (N-1) copies of the state are available. In this letter, we provide examples of orthonormal bases in two-qubit Hilbert space whose adaptive discrimination require 3 copies of the state. For this composite system we analyze multi-copy adaptive local distinguishability of orthogonal ensembles in full generality which in turn assigns varying nonlocal strength to different such ensembles. We also come up with ensembles whose discrimination under adaptive separable scheme require less number of copies than adaptive local schemes. Our construction finds important application in multipartite secret sharing tasks and indicates towards an intriguing super-additivity phenomenon for locally accessible information.

Related papers

• Local unitary equivalence of arbitrary-dimensional multipartite quantum states [19.34942152423892]
  Local unitary equivalence is an ingredient for quantifying and classifying entanglement. We find a variety of local unitary invariants for arbitrary-dimensional bipartite quantum states. We apply these invariants to estimate concurrence, a vital entanglement measure.
  arXiv  Detail & Related papers  (2024-02-21T02:57:46Z)
• Unextendibility, uncompletability, and many-copy indistinguishable ensembles [77.34726150561087]
  We study unextendibility, uncompletability and analyze their connections to many-copy indistinguishable ensembles. We report a class of multipartite many-copy indistinguishable ensembles for which local indistinguishability property increases with decreasing mixedness.
  arXiv  Detail & Related papers  (2023-03-30T16:16:41Z)
• Discriminative Radial Domain Adaptation [62.22362756424971]
  We propose Discriminative Radial Domain Adaptation (DRDR) which bridges source and target domains via a shared radial structure. We show that transferring such an inherently discriminative structure would enable to enhance feature transferability and discriminability simultaneously. Our method is shown to consistently outperforms state-of-the-art approaches on varied tasks.
  arXiv  Detail & Related papers  (2023-01-01T10:56:31Z)
• Distinguishability-based genuine nonlocality with genuine multipartite entanglement [0.0]
  We study the distinguishability-based genuine nonlocality of a typical type of genuine multipartite entangled states. We show that the cardinality can at least scale down to linear in the local dimension d, with the linear factor l = 1.
  arXiv  Detail & Related papers  (2022-11-04T11:44:30Z)
• 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)
• HSVA: Hierarchical Semantic-Visual Adaptation for Zero-Shot Learning [74.76431541169342]
  Zero-shot learning (ZSL) tackles the unseen class recognition problem, transferring semantic knowledge from seen classes to unseen ones. We propose a novel hierarchical semantic-visual adaptation (HSVA) framework to align semantic and visual domains. Experiments on four benchmark datasets demonstrate HSVA achieves superior performance on both conventional and generalized ZSL.
  arXiv  Detail & Related papers  (2021-09-30T14:27:50Z)
• Decentralized Local Stochastic Extra-Gradient for Variational Inequalities [125.62877849447729]
  We consider distributed variational inequalities (VIs) on domains with the problem data that is heterogeneous (non-IID) and distributed across many devices. We make a very general assumption on the computational network that covers the settings of fully decentralized calculations. We theoretically analyze its convergence rate in the strongly-monotone, monotone, and non-monotone settings.
  arXiv  Detail & Related papers  (2021-06-15T17:45:51Z)
• Unextendible entangled bases and more nonlocality with less entanglement [0.0]
  We show that the phenomenon of more nonlocality with less entanglement can be observed for two qubits, while still being at the single-copy level. The results are potentially useful for secure quantum communication technologies with an optimal amount of resources.
  arXiv  Detail & Related papers  (2021-03-16T15:33:44Z)
• Local indistinguishability and incompleteness of entangled orthogonal bases: Method to generate two-element locally indistinguishable ensembles [0.0]
  Local indistinguishability of states with the properties of unextendibility and uncompletability of entangled bases for bipartite and multipartite quantum systems. We identify a method of constructing two-element ensembles, based on the concept of unextendible entangled bases, that can potentially lead to information sharing applications.
  arXiv  Detail & Related papers  (2020-08-04T15:04:27Z)
• A Unified Theory of Decentralized SGD with Changing Topology and Local Updates [70.9701218475002]
  We introduce a unified convergence analysis of decentralized communication methods. We derive universal convergence rates for several applications. Our proofs rely on weak assumptions.
  arXiv  Detail & Related papers  (2020-03-23T17:49:15Z)
• Discriminating bipartite mixed states by local operations [0.4724825031148411]
  We show that the success probability of a global scheme for mixed-state discrimination can be achieved perfectly by the local scheme. This simulation is perfect for local rather than global schemes due to the existence of entanglement and global coherence in the pure states.
  arXiv  Detail & Related papers  (2020-03-13T04:50:36Z)

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.