The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Postselection Technique for Quantum Channels with Applications to Quantum Cryptography
Open accessAbstract
We propose a general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems. Our main result is that, in order to prove that a certain property holds for an arbitrary input, it is sufficient to consider the case where the input is a particular de Finetti-type state, i.e., a state which consists of n identical and independent copies of an (unknown) state on a single subsystem. Our technique can be applied to the analysis of information-theoretic problems. For example, in quantum cryptography, we get a simple proof for the fact that security of a discrete-variable quantum key distribution protocol against collective attacks implies security of the protocol against the most general attacks. The resulting security bounds are tighter than previously known bounds obtained with help of the exponential de Finetti theorem.
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 based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Quantum cryptography without Bell’s theorem
Bennett, C. H., Brassard, G., & Mermin, N. D. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.557 · Cited by 2,460
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Induced measures in the space of mixed quantum states
Zyczkowski, K., & Sommers, H.-J. (2001) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/34/35/335 · Cited by 425
Symmetry of large physical systems implies independence of subsystems
Renner, R. (2007) · Nature Physics · doi:10.1038/nphys684 · Cited by 320
Self-citationOne-and-a-Half Quantum de Finetti Theorems
Christandl, M., König, R., Mitchison, G., & Renner, R. (2007) · Communications in Mathematical Physics · doi:10.1007/s00220-007-0189-3 · Cited by 197
Self-citation
Cited by
Weedbrook, C., Pirandola, S., García-Patrón, R., Cerf, N. J., Ralph, T. C., Shapiro, J. H., & Lloyd, S. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.621 · Cited by 3,664
Advances 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
Secure quantum key distribution with realistic devices
Xu, F., Ma, X., Zhang, Q., Lo, H.-K., & Pan, J.-W. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.025002 · Cited by 1,543
The uncertainty principle in the presence of quantum memory
Berta, M., Christandl, M., Colbeck, R., Renes, J. M., & Renner, R. (2010) · Nature Physics · doi:10.1038/nphys1734 · Cited by 842
Self-citationTight finite-key analysis for quantum cryptography
Tomamichel, M., Lim, C. C. W., Gisin, N., & Renner, R. (2012) · Nature Communications · doi:10.1038/ncomms1631 · Cited by 634
Self-citation
Metadata
- Authors
- Christandl, M., König, R., & Renner, R.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2009-01-14
- Volume
- 102
- Issue
- 2
- Pages
- 020504-020504
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2015254684
- Cited by
- 343
- References
- 6
- FWCI
- 10.84
- 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
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.