Stronger superadditivity relations for multiqubit systems
- URL: http://arxiv.org/abs/2104.14905v1
- Date: Fri, 30 Apr 2021 11:05:34 GMT
- Title: Stronger superadditivity relations for multiqubit systems
- Authors: Ya-Ya Ren, Zhi-Xi Wang, and Shao-Ming Fei
- Abstract summary: Superadditivity relations characterize the distributions of coherence in multipartite quantum systems.
These relations give rise to finer characterization of the coherence distributions among the subsystems of a multipartite system.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Superadditivity relations characterize the distributions of coherence in
multipartite quantum systems. In this work, we investigate the superadditivity
relations related to the $l_1$-norm of coherence $C_{l_1}$ in multiqubit
quantum systems. Tighter superadditivity inequalities based on the $\alpha$-th
($\alpha\geqslant 1$) power of $l_1$-norm of coherence are presented for
multiqubit states under certain conditions, which include the existing results
as special cases. These superadditivity relations give rise to finer
characterization of the coherence distributions among the subsystems of a
multipartite system. A detailed example is presented.
Related papers
- Multipartite entanglement detection via generalized Wigner-Yanase skew
information [7.222232547612572]
The detection of multipartite entanglement in multipartite quantum systems is a fundamental and key issue in quantum information theory.
We develop two different approaches in form of inequalities to construct entanglement criteria, which are expressed in terms of the Wigner-Yanase skew information.
Our results reveal some $k$-nonseparability and $k$-partite entanglement that remain undetected by other methods.
arXiv Detail & Related papers (2023-09-20T03:30:15Z) - An Exponential Separation Between Quantum Query Complexity and the
Polynomial Degree [79.43134049617873]
In this paper, we demonstrate an exponential separation between exact degree and approximate quantum query for a partial function.
For an alphabet size, we have a constant versus separation complexity.
arXiv Detail & Related papers (2023-01-22T22:08:28Z) - Dilute neutron star matter from neural-network quantum states [58.720142291102135]
Low-density neutron matter is characterized by the formation of Cooper pairs and the onset of superfluidity.
We model this density regime by capitalizing on the expressivity of the hidden-nucleon neural-network quantum states combined with variational Monte Carlo and reconfiguration techniques.
arXiv Detail & Related papers (2022-12-08T17:55:25Z) - Tight bounds from multiple-observable entropic uncertainty relations [0.0]
We investigate the additivity properties for both bipartite and multipartite systems.
We introduce state-independent and state-dependent entropic inequalities.
arXiv Detail & Related papers (2022-07-27T11:33:15Z) - Acceleration in Distributed Optimization Under Similarity [72.54787082152278]
We study distributed (strongly convex) optimization problems over a network of agents, with no centralized nodes.
An $varepsilon$-solution is achieved in $tildemathcalrhoObig(sqrtfracbeta/mu (1-)log1/varepsilonbig)$ number of communications steps.
This rate matches (up to poly-log factors) for the first time lower complexity communication bounds of distributed gossip-algorithms applied to the class of problems of interest.
arXiv Detail & Related papers (2021-10-24T04:03:00Z) - Creating and destroying coherence with quantum channels [62.997667081978825]
We study optimal ways to create a large amount of quantum coherence via quantum channels.
correlations in multipartite systems do not enhance the ability of a quantum channel to create coherence.
We show that a channel can destroy more coherence when acting on a subsystem of a bipartite state.
arXiv Detail & Related papers (2021-05-25T16:44:13Z) - Experimental study of quantum coherence decomposition and trade-off
relations in a tripartite system [8.797280564220879]
We study the full set of coherence trade-off relations between the original state, the bipartite product state, the tripartite product state, and the decohered product state.
We find that despite the different types of states involved, the properties of the state in terms of coherence and monogamy are equivalent.
arXiv Detail & Related papers (2020-11-16T15:44:58Z) - Strong superadditivity relations for multiqubit systems [0.0]
General superadditivity inequalities are presented for multiqubit states.
Our result is shown to be tighter than the existing one by a specific example.
arXiv Detail & Related papers (2020-07-19T00:43:16Z) - Quantum Communication Complexity of Distribution Testing [114.31181206328276]
Two players each receive $t$ samples from one distribution over $[n]$.
The goal is to decide whether their two distributions are equal, or are $epsilon$-far apart.
We show that the quantum communication complexity of this problem is $tildeO$(tepsilon2))$ qubits when distributions have low $l$-norm.
arXiv Detail & Related papers (2020-06-26T09:05:58Z) - Robustly Learning any Clusterable Mixture of Gaussians [55.41573600814391]
We study the efficient learnability of high-dimensional Gaussian mixtures in the adversarial-robust setting.
We provide an algorithm that learns the components of an $epsilon$-corrupted $k$-mixture within information theoretically near-optimal error proofs of $tildeO(epsilon)$.
Our main technical contribution is a new robust identifiability proof clusters from a Gaussian mixture, which can be captured by the constant-degree Sum of Squares proof system.
arXiv Detail & Related papers (2020-05-13T16:44:12Z) - Cooperation and dependencies in multipartite systems [0.7078141380481606]
The quantifier is distinct from measures of multipartite correlations despite sharing many properties with them.
We show the benefits of using the new quantifier for symmetric quantum secret sharing.
This underlines the distinction between the multipartite dependence measure introduced here and multipartite correlations.
arXiv Detail & Related papers (2020-03-27T15:43:44Z)
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.