Asymptotic quantification of entanglement with a single copy
August 13, 2024 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Ludovico Lami, Mario Berta, Bartosz Regula
arXiv ID
2408.07067
Category
quant-ph: Quantum Computing
Cross-listed
cs.IT,
math-ph
Citations
8
Venue
arXiv.org
Last Checked
5 months ago
Abstract
Despite the central importance of quantum entanglement in quantum technologies, the understanding of the optimal ways to exploit it is still beyond our reach, and even measuring entanglement in an operationally meaningful way is prohibitively difficult. Here we study two fundamental tasks in the processing of entanglement: entanglement testing, which is a quantum state discrimination problem concerned with entanglement detection in the many-copy regime, and entanglement distillation, concerned with purifying entanglement from noisy entangled states. We introduce a way of benchmarking the performance of distillation that focuses on the best achievable error rather than its yield in the asymptotic limit. When the underlying set of operations used for entanglement distillation is the axiomatic class of non-entangling operations, we show that the two figures of merit for entanglement testing and distillation coincide. We solve both problems by proving a generalised quantum Sanov's theorem, enabling the exact evaluation of asymptotic error rates of composite quantum hypothesis testing. We show in particular that the asymptotic figure of merit is given by the reverse relative entropy of entanglement, a single-letter quantity that can be evaluated using only a single copy of a quantum state -- a distinct feature among measures of entanglement that quantify the optimal performance of information-theoretic tasks.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Quantum Computing
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Quantum machine learning: a classical perspective
R.I.P.
π»
Ghosted
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
R.I.P.
π»
Ghosted
ProjectQ: An Open Source Software Framework for Quantum Computing
R.I.P.
π»
Ghosted
Quantum Recommendation Systems
R.I.P.
π»
Ghosted
Traffic flow optimization using a quantum annealer
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted