Entropy Uncertainty Relations and Strong Sub-additivity of Quantum
Channels
- URL: http://arxiv.org/abs/2301.08402v1
- Date: Fri, 20 Jan 2023 02:34:31 GMT
- Title: Entropy Uncertainty Relations and Strong Sub-additivity of Quantum
Channels
- Authors: Li Gao, Marius Junge, Nicholas LaRacuente
- Abstract summary: We prove an entropic uncertainty relation for two quantum channels.
Motivated by Petz's algebraic SSA inequality, we also obtain a generalized SSA for quantum relative entropy.
- Score: 17.153903773911036
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: We prove an entropic uncertainty relation for two quantum channels, extending
the work of Frank and Lieb for quantum measurements. This is obtained via a
generalized strong super-additivity (SSA) of quantum entropy. Motivated by
Petz's algebraic SSA inequality, we also obtain a generalized SSA for quantum
relative entropy. As a special case, it gives an improved data processing
inequality.
Related papers
- The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.
Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
arXiv Detail & Related papers (2024-10-18T13:59:50Z) - Entropic Quantum Central Limit Theorem and Quantum Inverse Sumset
Theorem [0.0]
We establish an entropic, quantum central limit theorem and quantum inverse sumset theorem in discrete-variable quantum systems.
A byproduct of this work is a magic measure to quantify the nonstabilizer nature of a state, based on the quantum Ruzsa divergence.
arXiv Detail & Related papers (2024-01-25T18:43:24Z) - 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) - Quantum Fluctuation-Response Inequality and Its Application in Quantum
Hypothesis Testing [6.245537312562826]
We find a bound for the mean difference of an observable at two different quantum states.
When the spectrum of the observable is bounded, the sub-Gaussian property is used to link the bound with the sub-Gaussian norm of the observable.
We show the versatility of our results by their applications in problems like thermodynamic inference and speed limit.
arXiv Detail & Related papers (2022-03-20T09:10:54Z) - Tight Exponential Analysis for Smoothing the Max-Relative Entropy and
for Quantum Privacy Amplification [56.61325554836984]
The max-relative entropy together with its smoothed version is a basic tool in quantum information theory.
We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
arXiv Detail & Related papers (2021-11-01T16:35:41Z) - Quantum Extremal Surfaces and the Holographic Entropy Cone [0.0]
Quantum states with dual geometrics are known to satisfy a stricter set of entropy inequalities than general quantum systems.
These inequalities are no longer satisfied once general quantum corrections are included.
We show that requiring the bulk entropies to satisfy the HEC implies that the boundary entropies also satisfy the HEC.
arXiv Detail & Related papers (2021-08-16T18:00:03Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - Optimized quantum f-divergences [6.345523830122166]
I introduce the optimized quantum f-divergence as a related generalization of quantum relative entropy.
I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality.
One benefit of this approach is that there is now a single, unified approach for establishing the data processing inequality for the Petz--Renyi and sandwiched Renyi relative entropies.
arXiv Detail & Related papers (2021-03-31T04:15:52Z) - The entropy of quantum causal networks [8.000004776730265]
We consider the quantum causal networks in the manner of entropy.
We present a revised smooth max-relative entropy of quantum combs.
At last, we consider the score to quantify the performance of an operator.
arXiv Detail & Related papers (2021-03-13T01:34:44Z) - Experimental Validation of Fully Quantum Fluctuation Theorems Using
Dynamic Bayesian Networks [48.7576911714538]
Fluctuation theorems are fundamental extensions of the second law of thermodynamics for small systems.
We experimentally verify detailed and integral fully quantum fluctuation theorems for heat exchange using two quantum-correlated thermal spins-1/2 in a nuclear magnetic resonance setup.
arXiv Detail & Related papers (2020-12-11T12:55:17Z) - Quantum Statistical Complexity Measure as a Signalling of Correlation
Transitions [55.41644538483948]
We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions.
We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain.
We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
arXiv Detail & Related papers (2020-02-05T00:45:21Z)
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.