On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states
From MaRDI portal
(Redirected from Publication:657932)
Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum state spaces, operational and probabilistic concepts (81P16) Quantum state estimation, approximate cloning (81P50) Error probability in coding theory (94B70)
Abstract: Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication (LOCC), in the limit of many copies. While for two pure states a result of Walgate et al. shows that LOCC is just as powerful as global measurements, data hiding states (DiVincenzo et al.) show that locality can impose severe restrictions on the distinguishability of even orthogonal states. Here we determine the optimal error probability and measurement to discriminate many copies of particular data hiding states (extremal d x d Werner states) by a linear programming approach. Surprisingly, the single-copy optimal measurement remains optimal for n copies, in the sense that the best strategy is measuring each copy separately, followed by a simple classical decision rule. We also put a lower bound on the bias with which states can be distinguished by separable operations.
Recommendations
- Distinguishing bipartitite orthogonal states using LOCC: Best and worst cases
- Asymptotic state discrimination and a strict hierarchy in distinguishability norms
- Optimal local discrimination of two multipartite pure states
- Testing for a pure state with local operations and classical communication
- LOCC distinguishability of unilaterally transformable quantum states
Cites work
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- A semidefinite program for distillable entanglement
- A study of LOCC-detection of a maximally entangled state using hypothesis testing
- Distinguishing bipartitite orthogonal states using LOCC: Best and worst cases
- Implementing nonlocal gates with nonmaximally entangled states
- Nonlocality, asymmetry, and distinguishing bipartite states
- On the Chernoff bound for efficiency of quantum hypothesis testing
- On the existence of LOCC-distinguishable bases in three-dimensional subspaces of bipartite 3 ×nsystems
- Optimal local discrimination of two multipartite pure states
- Quantum data hiding
- Quantum detection and estimation theory
- Quantum states: discrimination and classical information transmission. A review of experimental progress
- The geometric measure of entanglement for a symmetric pure state with non-negative amplitudes
Cited in
(13)- Discrimination of quantum states under locality constraints in the many-copy setting
- Distinguishing quantum operations: LOCC versus separable operators
- Hilbert's projective metric in quantum information theory
- LOCC protocols with bounded width per round optimize convex functions
- Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
- Testing for a pure state with local operations and classical communication
- Estimating the spectrum of a density matrix with LOCC
- Distinguishing bipartitite orthogonal states using LOCC: Best and worst cases
- Relative entropy and squashed entanglement
- Asymptotic state discrimination and a strict hierarchy in distinguishability norms
- Ultimate data hiding in quantum mechanics and beyond
- Bounds on action of local quantum channels
- Tight Asymptotic Bounds on Local Hypothesis Testing Between a Pure Bipartite State and the White Noise State
This page was built for publication: On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657932)
