Related papers: Tighter superadditivity relations for $l

Tighter superadditivity relations for $l_{1}$-norm coherence measure

URL: http://arxiv.org/abs/2411.07803v1
Date: Tue, 12 Nov 2024 13:57:44 GMT
Title: Tighter superadditivity relations for $l_{1}$-norm coherence measure
Authors: Kang-Kang Yang, Zhong-Xi Shen, Zhi-Xi Wang, Shao-Ming Fei,
Abstract summary: Superadditivity constitutes one of the most fundamental attributes in characterizing the coherence distribution in multipartite quantum systems. We present a category of superadditivity relations related to the power of $alpha$-th ($alphageqslant 2$) power of $l_1$-norm coherence $C_l_1$ under certain conditions.
Score: 0.0
License:
Abstract: Quantum coherence serves as a crucial physical resource, with its quantification emerging as a focal point in contemporary research. Superadditivity constitutes one of the most fundamental attributes in characterizing the coherence distribution in multipartite quantum systems. In this paper, we provide a way to derive tighter superadditivity inequalities of $l_1$-norm coherence measure for arbitrary multiqubit states. We present a category of superadditivity relations related to the $\alpha$-th ($\alpha\geqslant 2$) power of $l_{1}$-norm coherence $C_{l_{1}}$ under certain conditions. Our results are better than existing ones and are illustrated in detail with examples.

Related papers

Quantifying multipartite quantum states by ($k+1$)-partite entanglement measures [2.150800093140658]
We put forward two families of entanglement measures termed $q$-$(k+1)$-PE concurrence $(q>1)$ and $alpha$-$(k+1)$-PE concurrence $(0leqalpha1)$. We also propose two alternative kinds of entanglement measures, named $q$-$(k+1)$-GPE concurrence $(q>1)$ and $alpha$-$(k+1)$-GPE concurrence $(0leqalpha1)$.
arXiv Detail & Related papers (2024-04-23T13:19:17Z)
Krylov complexity of density matrix operators [0.0]
Krylov-based measures such as Krylov complexity ($C_K$) and Spread complexity ($C_S$) are gaining prominence. We investigate their interplay by considering the complexity of states represented by density matrix operators.
arXiv Detail & Related papers (2024-02-14T19:01:02Z)
Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z)
Parameterized coherence measure [4.536603451832357]
We present a bona fide measure of quantum coherence by utilizing the Tsallis relative operator $(alpha, beta)$-entropy. We first prove that the proposed coherence measure fulfills all the criteria of a well defined coherence measure, including the strong monotonicity in the resource theories of quantum coherence.
arXiv Detail & Related papers (2023-06-21T01:59:54Z)
Quantum and classical low-degree learning via a dimension-free Remez inequality [52.12931955662553]
We show a new way to relate functions on the hypergrid to their harmonic extensions over the polytorus. We show the supremum of a function $f$ over products of the cyclic group $exp(2pi i k/K)_k=1K$. We extend to new spaces a recent line of work citeEI22, CHP, VZ22 that gave similarly efficient methods for learning low-degrees on hypercubes and observables on qubits.
arXiv Detail & Related papers (2023-01-04T04:15:40Z)
Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z)
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)
Stronger superadditivity relations for multiqubit systems [0.0]
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.
arXiv Detail & Related papers (2021-04-30T11:05:34Z)
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)

This list is automatically generated from the titles and abstracts of the papers in this site.