Tip of the Quantum Entropy Cone
- URL: http://arxiv.org/abs/2306.00199v2
- Date: Tue, 2 Jan 2024 15:59:56 GMT
- Title: Tip of the Quantum Entropy Cone
- Authors: Matthias Christandl, Bergfinnur Durhuus, Lasse Harboe Wolff
- Abstract summary: Relations among von Neumann entropies of different parts of an $N$-partite quantum system have direct impact on our understanding of diverse situations.
We show that while it is always possible to up-scale an entropy vector to arbitrary integer multiples it is not always possible to down-scale it to arbitrarily small size.
- Score: 1.1606619391009658
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Relations among von Neumann entropies of different parts of an $N$-partite
quantum system have direct impact on our understanding of diverse situations
ranging from spin systems to quantum coding theory and black holes. Best
formulated in terms of the set $\Sigma^*_N$ of possible vectors comprising the
entropies of the whole and its parts, the famous strong subaddivity inequality
constrains its closure $\overline\Sigma^*_N$, which is a convex cone. Further
homogeneous constrained inequalities are also known.
In this work we provide (non-homogeneous) inequalities that constrain
$\Sigma_N^*$ near the apex (the vector of zero entropies) of
$\overline\Sigma^*_N$, in particular showing that $\Sigma_N^*$ is not a cone
for $N\geq 3$. Our inequalities apply to vectors with certain entropy
constraints saturated and, in particular, they show that while it is always
possible to up-scale an entropy vector to arbitrary integer multiples it is not
always possible to down-scale it to arbitrarily small size, thus answering a
question posed by A. Winter. Relations of our work to topological materials,
entanglement theory, and quantum cryptography are discussed.
Related papers
- Entanglement Entropy of Free Fermions with a Random Matrix as a One-Body Hamiltonian [0.0]
We consider a quantum system of large size $N$ and its subsystem of size $L$.
We show that in this case, the entanglement entropy obeys the volume law known for systems with short-ranged hopping.
arXiv Detail & Related papers (2024-05-18T17:20:23Z) - Efficient unitary designs and pseudorandom unitaries from permutations [35.66857288673615]
We show that products exponentiated sums of $S(N)$ permutations with random phases match the first $2Omega(n)$ moments of the Haar measure.
The heart of our proof is a conceptual connection between the large dimension (large-$N$) expansion in random matrix theory and the method.
arXiv Detail & Related papers (2024-04-25T17:08:34Z) - 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) - Mixed-state quantum anomaly and multipartite entanglement [8.070164241593814]
We show a surprising connection between mixed state entanglement and 't Hooft anomaly.
We generate examples of mixed states with nontrivial long-ranged multipartite entanglement.
We also briefly discuss mixed anomaly involving both strong and weak symmetries.
arXiv Detail & Related papers (2024-01-30T19:00:02Z) - Global Nash Equilibrium in Non-convex Multi-player Game: Theory and
Algorithms [66.8634598612777]
We show that Nash equilibrium (NE) is acceptable to all players in a multi-player game.
We also show that no one can benefit unilaterally from the general theory step by step.
arXiv Detail & Related papers (2023-01-19T11:36:50Z) - Geometric relative entropies and barycentric Rényi divergences [16.385815610837167]
monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure.
We show that monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure.
arXiv Detail & Related papers (2022-07-28T17:58:59Z) - On quantum algorithms for the Schr\"odinger equation in the
semi-classical regime [27.175719898694073]
We consider Schr"odinger's equation in the semi-classical regime.
Such a Schr"odinger equation finds many applications, including in Born-Oppenheimer molecular dynamics and Ehrenfest dynamics.
arXiv Detail & Related papers (2021-12-25T20:01:54Z) - Sublinear quantum algorithms for estimating von Neumann entropy [18.30551855632791]
We study the problem of obtaining estimates to within a multiplicative factor $gamma>1$ of the Shannon entropy of probability distributions and the von Neumann entropy of mixed quantum states.
We work with the quantum purified query access model, which can handle both classical probability distributions and mixed quantum states, and is the most general input model considered in the literature.
arXiv Detail & Related papers (2021-11-22T12:00:45Z) - 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) - Quasi-polynomial time algorithms for free quantum games in bounded
dimension [11.56707165033]
We give a semidefinite program of size $exp(mathcalObig(T12(log2(AT)+log(Q)log(AT))/epsilon2big)) to compute additive $epsilon$-approximations on the values of two-player free games.
We make a connection to the quantum separability problem and employ improved multipartite quantum de Finetti theorems with linear constraints.
arXiv Detail & Related papers (2020-05-18T16:55:08Z) - Bosonic quantum communication across arbitrarily high loss channels [68.58838842613457]
A general attenuator $Phi_lambda, sigma$ is a bosonic quantum channel that acts by combining the input with a fixed environment state.
We show that for any arbitrary value of $lambda>0$ there exists a suitable single-mode state $sigma(lambda)$.
Our result holds even when we fix an energy constraint at the input of the channel, and implies that quantum communication at a constant rate is possible even in the limit of arbitrarily low transmissivity.
arXiv Detail & Related papers (2020-03-19T16:50:11Z)
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.