Experimental demonstration of a hyper-entangled ten-qubit Schrödinger cat state
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the long term, polarization-processing capabilities offer other important benefits: simultaneous encoding of logic or ancilla qubits in multiple photonic degrees of freedom, such as path and polarization, can be used to increase the system's information-processing capacity or enable protocols that are otherwise impossible.
“In the long term, polarization-processing capabilities offer other important benefits: simultaneous encoding of logic or ancilla qubits in multiple photonic degrees of freedom, such as path and polarization, can be used to increase the system's information-processing capacity or enable protocols that are otherwise impossible.29,30”
From Integrated-optics heralded controlled-NOT gate for polarization-encoded qubits (2018) · cites this paper as [30]
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 50 · Cited by 348
- Authors
- 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.
- Affiliations
- University of Science and Technology of China (CN)
- Austrian Academy of Sciences (AT)
- Heidelberg University (DE)
- Corresponding author
- Chen, Zeng-Bing
- Pan, Jian-Wei
- ORCID
- Venue
- Nature Physics
- Published
- 2010-03-14
- Volume
- 6
- Issue
- 5
- Pages
- 331-335
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W2123335817
- Cited by
- 348
- References
- 50
- Citations by year
- 2026: 9 · 2025: 12 · 2024: 17 · 2023: 18 · 2022: 14 · 2021: 14 · 2020: 21 · 2019: 22 · 2018: 24 · 2017: 23 · 2016: 26 · 2015: 33 · 2014: 18 · 2013: 27 · 2012: 26
- FWCI
- 31.15
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- Nature Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Alexander von Humboldt-Stiftung
- National Natural Science Foundation of China
- Chinese Academy of Sciences
- Austrian Science Fund
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Keywords
- hyperentanglement, Schrödinger cat states, multipartite entanglement, standard quantum limit, graph states, entangled photon states
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
