Recoverability of quantum channels via hypothesis testing
- URL: http://arxiv.org/abs/2303.11707v2
- Date: Wed, 19 Jul 2023 08:26:01 GMT
- Title: Recoverability of quantum channels via hypothesis testing
- Authors: Anna Jen\v{c}ov\'a
- Abstract summary: A quantum channel is sufficient with respect to a set of input states if it can be reversed on this set.
We present an easy proof of a characterization of sufficient quantum channels and recoverability.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A quantum channel is sufficient with respect to a set of input states if it
can be reversed on this set. In the approximate version, the input states can
be recovered within an error bounded by the decrease of the relative entropy
under the channel. Using a new integral representation of the relative entropy
in arXiv:2208.12194, we present an easy proof of a characterization of
sufficient quantum channels and recoverability by preservation of optimal
success probabilities in hypothesis testing problems, equivalently, by
preservation of $L_1$-distance.
Related papers
- Generalized quantum asymptotic equipartition [11.59751616011475]
We prove that all operationally relevant divergences converge to the quantum relative entropy between two sets of quantum states.
In particular, both the smoothed min-relative entropy between two sequential processes of quantum channels can be lower bounded by the sum of the regularized minimum output channel divergences.
We apply our generalized AEP to quantum resource theories and provide improved and efficient bounds for entanglement distillation, magic state distillation, and the entanglement cost of quantum states and channels.
arXiv Detail & Related papers (2024-11-06T16:33:16Z) - Quantum steering from phase measurements with limited resources [0.20616237122336117]
Quantum steering captures the ability of one party, Alice, to control through quantum correlations the state at a distant location.
Our results provide guidelines to apply such a metrological approach to the validation of quantum channels.
arXiv Detail & Related papers (2024-01-30T20:37:00Z) - Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels [7.874708385247353]
We prove a one-shot quantum covering lemma in terms of smooth min-entropies.
We provide new upper bounds on the unrestricted and simultaneous identification capacities of quantum channels.
arXiv Detail & Related papers (2023-06-21T17:53:22Z) - Functional analytic insights into irreversibility of quantum resources [8.37609145576126]
Quantum channels which preserve certain sets of states are contractive with respect to the base norms induced by those sets.
We show that there exist qutrit magic states that cannot be reversibly interconverted under stabiliser protocols.
arXiv Detail & Related papers (2022-11-28T19:00:00Z) - Overcoming entropic limitations on asymptotic state transformations
through probabilistic protocols [12.461503242570641]
We show that it is no longer the case when one allows protocols that may only succeed with some probability.
We show that this is no longer the case when one allows protocols that may only succeed with some probability.
arXiv Detail & Related papers (2022-09-07T18:00:00Z) - 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) - Shannon theory for quantum systems and beyond: information compression
for fermions [68.8204255655161]
We show that entanglement fidelity in the fermionic case is capable of evaluating the preservation of correlations.
We introduce a fermionic version of the source coding theorem showing that, as in the quantum case, the von Neumann entropy is the minimal rate for which a fermionic compression scheme exists.
arXiv Detail & Related papers (2021-06-09T10:19:18Z) - Excluding false negative error in certification of quantum channels [68.8204255655161]
This work focuses on the scenario when the false negative error cannot occur, even if it leads to the growth of the probability of false positive error.
We establish a condition when it is possible to exclude false negative error after a finite number of queries to the quantum channel in parallel.
arXiv Detail & Related papers (2021-06-04T09:41:11Z) - Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier [73.70426431502803]
We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model.
This yields the first post-quantum succinct argument system from any falsifiable assumption.
arXiv Detail & Related papers (2021-03-15T05:09:17Z) - Quantum backflow in the presence of a purely transmitting defect [91.3755431537592]
We analyse the quantum backflow effect and extend it, as a limiting constraint to its spatial extent, for scattering situations.
We make the analysis compatible with conservation laws.
arXiv Detail & Related papers (2020-07-14T22:59:25Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z)
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.