Entanglement Sampling and Applications
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
A natural measure for the amount of quantum information that a physical system E holds about another system A = A1, .. . , Anis given by the min-entropy Hmin(A|E). In particular, the min-entropy measures the amount of entanglement between E and A, and is the relevant measure when analyzing a wide variety of problems ranging from randomness extraction in quantum cryptography, decoupling used in channel coding, to physical processes such as thermalization or the thermodynamic work cost (or gain) of erasing a quantum system. As such, it is a central question to determine the behavior of the minentropy after some process M. is applied to the system A. Here, we introduce a new generic tool relating the resulting min-entropy to the original one, and apply it to several settings of interest. A simple example of such a process is the one of sampling, where a subset S of the systems A1, ... , An is selected at random. Our tool allows us to quantify the entanglement that E has with the selected systems AS, i.e., Hmin(AS|ES) as a function of the original Hmin(A|E). We give two applications of this result. First, it directly provides the first local quantum-to-classical randomness extractors for use in quantum cryptography, as well as decoupling operations acting on only a small fraction AS of the input A. Moreover, it gives lower bounds on the dimension of k-out-of-n fully quantum random access encodings. Another natural example of such a process is a measurement in, e.g., BB84 bases commonly used in quantum cryptography. We establish the first entropic uncertainty relations with quantum side information that are nontrivial whenever E is not maximally entangled with A. As a consequence, we are able to prove optimality of quantum cryptographic schemes in the noisy-storage model. This model allows for the secure implementation of two-party cryptographic primitives under the assumption that the adversary cannot store quantum information perfectly. A special case is the bounded-quantum-storage model (BQSM), which assumes that the adversary's quantum memory device is noise free but limited in size. Ever since the inception of the BQSM, it has been a vexing open question to determine whether the security is possible as long as the adversary can only.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299 · cited 1×
“For such strings s, we denote supp(s) = {i ∈ {1, . . . , n} : si 6= 0} and |s| = |supp(s)|.”
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
Black holes as mirrors: quantum information in random subsystems
Hayden, P., & Preskill, J. (2007) · Journal of High Energy Physics · doi:10.1088/1126-6708/2007/09/120 · Cited by 1,332 · cited 1×
“Of particular interest in both computational [31] and physical applications [22], [23], [32], [34] are unitaries which are efficient.”
BackgroundRoth, R. (2006) · doi:10.1017/cbo9780511808968 · Cited by 912
Quantum mechanical evolution towards thermal equilibrium
Linden, N., Popescu, S., Short, A. J., & Winter, A. (2009) · Physical Review E · doi:10.1103/physreve.79.061103 · Cited by 625 · cited 1×
“A decoupling theorem for certain classes of unitaries then says that for very many unitaries in that set, the resulting state of the system τB is independent of its initial state, one of the steps considered in the process of thermalization [40].”
BackgroundA Fully Quantum Asymptotic Equipartition Property
Tomamichel, M., Colbeck, R., & Renner, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2032797 · Cited by 356
Reversing quantum dynamics with near-optimal quantum and classical fidelity
Barnum, H., & Knill, E. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1459754 · Cited by 280 · cited 4×
“In fact, all our results would hold for any unitary operators Ws that are orthogonal with respect to the Hilbert-Schmidt inner product.”
MethodInfluentialA Decoupling Approach to the Quantum Capacity
Hayden, P., Horodecki, M., Winter, A., & Yard, J. (2008) · Open Systems & Information Dynamics · doi:10.1142/s1230161208000043 · Cited by 170
The decoupling approach to quantum information theory
Dupuis, F. (2010) · arXiv · doi:10.48550/arxiv.1004.1641 · Cited by 90
Self-citation(2006) · doi:10.1007/3-540-30266-2 · Cited by 12
Cited by
Quantum internet: a vision for the road ahead
Wehner, S., Elkouss, D., & Hanson, R. (2018) · Science · doi:10.1126/science.aam9288 · Cited by 2,467
Self-citationAdvances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Entropic uncertainty relations and their applications
Coles, P. J., Berta, M., Tomamichel, M., & Wehner, S. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015002 · Cited by 658
Self-citationQuantum repeaters: From quantum networks to the quantum internet
Azuma, K., Economou, S. E., Elkouss, D., Hilaire, P., Jiang, L., Lo, H.-K., & Tzitrin, I. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045006 · Cited by 559
Wilde, M. M., Winter, A., & Yang, D. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-2122-x · Cited by 516
“[19] beyond α = 2 (the above proof of joint convexity of Q̃α(A‖B) is in fact a straightforward generalization of the proof of Theorem 21 in Ref.”
Background
Metadata
- Authors
- Dupuis, F., Fawzi, O., & Wehner, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2015-02
- Volume
- 61
- Issue
- 2
- Pages
- 1093-1112
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2055611553
- Cited by
- 94
- References
- 10
- FWCI
- 6.93
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Entanglement Sampling and Applications. https://app.cochat.ai/papers/10.1109/tit.2014.2371464
- The paper
- Dupuis, F., Fawzi, O., & Wehner, S. (2015). Entanglement Sampling and Applications. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2014.2371464
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.