Strong superadditivity relations for multiqubit systems
- URL: http://arxiv.org/abs/2007.09544v1
- Date: Sun, 19 Jul 2020 00:43:16 GMT
- Title: Strong superadditivity relations for multiqubit systems
- Authors: Xianfei Qi, Ting Gao, Fengli Yan
- Abstract summary: General superadditivity inequalities are presented for multiqubit states.
Our result is shown to be tighter than the existing one by a specific example.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We investigate the distributions of quantum coherence characterized by
superadditivity relations in multipartite quantum systems. General
superadditivity inequalities based on the $\alpha$th ($\alpha\geqslant 1$)
power of $l_1$ norm of coherence are presented for multiqubit states, which
include the existing ones as special cases. Our result is shown to be tighter
than the existing one by a specific example.
Related papers
- The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$.
In particular, we design global protocols for small set expansion, unique games, and PCP verification.
We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
arXiv Detail & Related papers (2024-02-29T01:35:46Z) - 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) - 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) - Entanglement polygon inequality in qudit systems [3.6720510088596297]
We derive an entanglement polygon inequality for the $q$-concurrence, which manifests the relationship among all the "one-to-group" marginal entanglements in any multipartite qudit system.
These results provide new insights into characterizing bipartite high-dimensional entanglement in quantum information processing.
arXiv Detail & Related papers (2022-05-18T08:59:18Z) - 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) - Experimental violations of Leggett-Garg's inequalities on a quantum
computer [77.34726150561087]
We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems.
Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
arXiv Detail & Related papers (2021-09-06T14:35:15Z) - 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) - Symmetric distinguishability as a quantum resource [21.071072991369824]
We develop a resource theory of symmetric distinguishability, the fundamental objects of which are elementary quantum information sources.
We study the resource theory for two different classes of free operations: $(i)$ $rmCPTP_A$, which consists of quantum channels acting only on $A$, and $(ii)$ conditional doubly (CDS) maps acting on $XA$.
arXiv Detail & Related papers (2021-02-24T19:05:02Z) - 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) - Necessary conditions for classifying m-separability of multipartite
entanglements [2.432474327428777]
We study the norms of the Bloch vectors for arbitrary $n$-partite quantum states.
A tight upper bound of the norms is derived for $n$-partite systems with different individual dimensions.
Necessary conditions are presented for $mathbf m$-separable states in $n$-partite quantum systems.
arXiv Detail & Related papers (2020-06-17T09:52:04Z)
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.