The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Two-step hyperentanglement purification with the quantum-state-joining method
Open accessAbstract
Hyperentanglement is a promising resource in quantum information processing, especially for increasing the channel capacity of long-distance quantum communication. Hyperentanglement purification is an important method to obtain high-fidelity nonlocal hyperentangled states from mixed hyperentangled states in a long-distance quantum communication process with noisy channels. Here, we present a two-step hyperentanglement purification protocol for nonlocal mixed hyperentangled states with polarization bit-flip errors and spatial-mode phase-flip errors, resorting to polarization-spatial phase-check quantum nondemolition detectors and the quantum-state-joining method (QSJM). With QSJM, the protocol can preserve the states that are discarded in the previous hyperentanglement purification protocols. It has the advantage of a high efficiency, and it is useful for improving the entanglement of photon systems with several degrees of freedom in long-distance high-capacity quantum communication.
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
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels
Deutsch, D., Ekert, A., Jozsa, R., Macchiavello, C., Popescu, S., & Sanpera, A. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.2818 · Cited by 1,268
Beating the channel capacity limit for linear photonic superdense coding
Barreiro, J. T., Wei, T.-C., & Kwiat, P. G. (2008) · Nature Physics · doi:10.1038/nphys919 · Cited by 870
Generation of Hyperentangled Photon Pairs
Barreiro, J. T., Langford, N. K., Peters, N. A., & Kwiat, P. G. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.260501 · Cited by 750
Experimental demonstration of a hyper-entangled ten-qubit Schrödinger cat state
Gao, W.-B., Lu, C.-Y., Yao, X.-C., Xu, P., Gühne, O., Goebel, A., Chen, Y.-A., Peng, C.-Z., Chen, Z.-B., & Pan, J.-W. (2010) · Nature Physics · doi:10.1038/nphys1603 · Cited by 348
Complete Deterministic Linear Optics Bell State Analysis
Schuck, C., Huber, G., Kurtsiefer, C., & Weinfurter, H. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.190501 · Cited by 299
All-Versus-Nothing Violation of Local Realism by Two-Photon, Four-Dimensional Entanglement
Yang, T., Zhang, Q., Zhang, J., Yin, J., Zhao, Z., Żukowski, M., Chen, Z.-B., & Pan, J.-W. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.240406 · Cited by 134
All-Versus-Nothing Violation of Local Realism for Two Entangled Photons
Chen, Z.-B., Pan, J.-W., Zhang, Y.-D., Brukner, Č., & Zeilinger, A. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.160408 · Cited by 77
Cited by
One-step quantum secure direct communication
Sheng, Y.-B., Zhou, L., & Long, G.-L. (2022) · Science Bulletin · doi:10.1016/j.scib.2021.11.002 · Cited by 362
Metadata
- Authors
- Ren, B.-C., Du, F.-F., & Deng, F.-G.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2014-11-07
- Volume
- 90
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1995342526
- Cited by
- 162
- References
- 10
- FWCI
- 21.46
- 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: Two-step hyperentanglement purification with the quantum-state-joining method. https://app.cochat.ai/papers/10.1103/physreva.90.052309
- The paper
- Ren, B.-C., Du, F.-F., & Deng, F.-G. (2014). Two-step hyperentanglement purification with the quantum-state-joining method. Physical Review A. https://doi.org/10.1103/physreva.90.052309
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.