Coherence based inequality for the discrimination of three-qubit GHZ and W class

• URL: http://arxiv.org/abs/2105.03097v1
• Date: Fri, 7 May 2021 07:55:03 GMT
• Title: Coherence based inequality for the discrimination of three-qubit GHZ and W class
• Authors: Pranav Kairon, Mukhtiyar Singh, Satyabrata Adhikari
• Abstract summary: We show a rigorous relation between the $l_1$-norm of coherence and concurrence. We derive an analogous form of monogamy inequality based on the partial coherence of the reduced two-qubit and reduced single qubit of the particular class of three-qubit state. We provide theoretical discussion for the possible implementation of the scheme in an experiment.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum coherence and entanglement orignate from the superposition principle. We derive a rigorous relation between the ${l_1}$-norm of coherence and concurrence, in that we show that the former is always greater than the latter. This result highlights the hierarchical relationship between coherence and concurrence, and proves coherence to be a fundamental and ubiquitous resource. We derive an analogous form of monogamy inequality which is based on the partial coherence of the reduced two-qubit and reduced single qubit of the particular class of three-qubit state. Moreover, we provide coherence based inequality for the classification of GHZ class and W class of three-qubit states. Finally, we provide theoretical discussion for the possible implementation of the scheme in an experiment.

Related papers

• Generalized Unbiased Scene Graph Generation [85.22334551067617]
  Generalized Unbiased Scene Graph Generation (G-USGG) takes into account both predicate-level and concept-level imbalance. We propose the Multi-Concept Learning (MCL) framework, which ensures a balanced learning process across rare/ uncommon/ common concepts.
  arXiv  Detail & Related papers  (2023-08-09T08:51:03Z)
• Classifying Causal Structures: Ascertaining when Classical Correlations are Constrained by Inequalities [0.0]
  We develop methods for detecting causal scenarios that impose inequality constraints versus those which do not. Many scenarios with exclusively equality constraints can be detected via a condition articulated by Henson, Lal and Pusey. We are able to resolve all but three causal scenarios, providing evidence that the HLP condition is, in fact, exhaustive.
  arXiv  Detail & Related papers  (2023-08-04T15:23:55Z)
• Similarity, Compression and Local Steps: Three Pillars of Efficient Communications for Distributed Variational Inequalities [91.12425544503395]
  Variational inequalities are used in various applications ranging from equilibrium search to adversarial learning. Most distributed approaches have a bottleneck - the cost of communications. The three main techniques to reduce the total number of communication rounds and the cost of one such round are the similarity of local functions, compression of transmitted information, and local updates. The methods presented in this paper have the best theoretical guarantees of communication complexity and are significantly ahead of other methods for distributed variational inequalities.
  arXiv  Detail & Related papers  (2023-02-15T12:11:27Z)
• Complementary relations of entanglement, coherence, steering and Bell nonlocality inequality violation in three-qubit states [4.8723490038152635]
  We put forward complementary relations of entanglement, coherence, steering inequality violation, and Bell nonlocality for arbitrary three-qubit states. The results provide reliable evidence of fundamental connections among entanglement, coherence, steering inequality violation, and Bell nonlocality.
  arXiv  Detail & Related papers  (2022-12-19T09:45:30Z)
• Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learning [79.83792914684985]
  We prove a new identifiability result that provides conditions under which maximally sparse base-predictors yield disentangled representations. Motivated by this theoretical result, we propose a practical approach to learn disentangled representations based on a sparsity-promoting bi-level optimization problem.
  arXiv  Detail & Related papers  (2022-11-26T21:02:09Z)
• On the Equity of Nuclear Norm Maximization in Unsupervised Domain Adaptation [53.29437277730871]
  Nuclear norm has shown the power to enhance the transferability of unsupervised domain adaptation model. Two new losses are proposed to maximize both predictive discriminability and equity, from the class level and the sample level.
  arXiv  Detail & Related papers  (2022-04-12T07:55:47Z)
• Beyond $\mathcal{H}$-Divergence: Domain Adaptation Theory With Jensen-Shannon Divergence [21.295136514836788]
  We reveal the incoherence between the widely-adopted empirical domain adversarial training and its generally-assumed theoretical counterpart based on $mathcalH$-divergence. We establish a new theoretical framework by directly proving the upper and lower target risk bounds based on joint distributional Jensen-Shannon divergence.
  arXiv  Detail & Related papers  (2020-07-30T16:19:59Z)
• Pairwise Supervision Can Provably Elicit a Decision Boundary [84.58020117487898]
  Similarity learning is a problem to elicit useful representations by predicting the relationship between a pair of patterns. We show that similarity learning is capable of solving binary classification by directly eliciting a decision boundary.
  arXiv  Detail & Related papers  (2020-06-11T05:35:16Z)
• Entanglement as upper bounded for the nonlocality of a general two-qubit system [16.676050048472963]
  We systematically investigate the relationship between entanglement and nonlocality of a general two-qubit system. We find that the nonlocality of two different two-qubit states can be optimally stimulated by the same nonlocality test setting.
  arXiv  Detail & Related papers  (2020-04-17T16:42:27Z)
• Generalised Lipschitz Regularisation Equals Distributional Robustness [47.44261811369141]
  We give a very general equality result regarding the relationship between distributional robustness and regularisation. We show a new result explicating the connection between adversarial learning and distributional robustness.
  arXiv  Detail & Related papers  (2020-02-11T04:19:43Z)
• Coherence Concurrence for X States [5.075312051977516]
  We give an optimal pure state decomposition which attains the coherence concurrence for qubit states. We prove the additivity of coherence concurrence under direct sum operations. We show that the coherence concurrence is exactly twice the convex roof extended negativity of the Schmidt correlated states.
  arXiv  Detail & Related papers  (2020-02-10T14:58:02Z)

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.