The DOI matches its Crossref record; 162 of the 165 references it cites were found in a registry or an index.
Quantum Theory: Informational Foundations and Foils
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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 citing paper
“The unitarity of a noise channel gives additional information, beyond the average gate fidelity [37].”
From Simple formulation of no-cloning and no-hiding that admits efficient and robust verification (2024) · cites this paper as [37]
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
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
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
On the Quantum Correction For Thermodynamic Equilibrium
Wigner, E. (1932) · Physical Review · doi:10.1103/physrev.40.749 · Cited by 9,283
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
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 by
Sorted by citations
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
Biorthogonal quantum mechanics
Brody, D. C. (2014) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/47/3/035305 · Cited by 573
Coecke, B., & Kissinger, A. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316219317 · Cited by 512
The SIC Question: History and State of Play
Fuchs, C. A., Hoang, M., & Stacey, B. C. (2017) · Axioms · doi:10.3390/axioms6030021 · Cited by 244
Quantum Common Causes and Quantum Causal Models
Allen, J.-M. A., Barrett, J., Horsman, D. C., Lee, C. M., & Spekkens, R. W. (2017) · Physical Review X · doi:10.1103/physrevx.7.031021 · Cited by 252
Metadata
- Authors
- Chiribella, G., D'Ariano, G. M., & Perinotti, P.
- Affiliations
- University of Pavia (IT)
- Corresponding author
- Chiribella, Giulio
- ORCID
- Paolo Perinotti
- Venue
- Fundamental Theories of Physics
- Publisher
- Springer Netherlands
- Published
- 2016
- ISSN
- 0168-1222 (ISSN-L)
- 2365-6425
- OpenAlex
- W2763162295
- Cited by
- 178
- References
- 165
- Citations by year
- 2026: 4 · 2025: 12 · 2024: 18 · 2023: 15 · 2022: 12 · 2021: 20 · 2020: 12 · 2019: 37 · 2018: 14 · 2017: 24 · 2016: 5
- FWCI
- 6.88
- Type
- book
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- Fundamental theories of physics (publishedVersion)
- arXiv (Cornell University) (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- DIAL (Catholic University of Leuven) (submittedVersion)
- The HKU Scholars Hub (University of Hong Kong) (submittedVersion)
- Funders
- Agence Nationale de la Recherche (ANR-11-CHRI-0007)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Nuclear and High Energy Physics › Noncommutative and Quantum Gravity Theories
- Keywords
- symplectic structure, nonclassicality, binary variables
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
