Cited by 77

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Multipartite Entanglement Verification Resistant against Dishonest Parties

Pappa, Anna, Chailloux, André, Wehner, Stephanie, Diamanti, Eleni, Kerenidis, Iordanis·2012·Physical Review Letters

Overview

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.108.260502

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

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.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Analytical solutions for quantum many-body problems are available only for the simplest systems, making simulations necessary and heavily based on classical techniques such as Born-Oppenheimer or Hartree-Fock approximations, density-functional theory, or machine learning.

    “Indeed, analytical solutions for quantum many-body problems are available only for the simplest systems, thus making simulations necessary and heavily based on classical techniques such as the Born-Oppenheimer or Hartree-Fock approximations, the density-functional theory or even machine learning [622]”

    From Photonic quantum information processing: a review (2019) · cites this paper as [622]

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

Flagged first, then by citations

Research works printed but not linked: 12

  1. A. Broadbent, 2009, Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS)
  2. 10.1103/PhysRevLett.86.5188 · DOI · Paper page
  3. 10.1103/PhysRevA.77.052327 · DOI
  4. 10.1103/PhysRevA.85.010301 · DOI
  5. 10.1103/PhysRevLett.98.140402 · DOI
  6. 10.1103/PhysRevA.76.052116 · DOI
  7. 10.1038/ncomms1628 · DOI
  8. G. Brassard, 2003, Proceedings of the 8th International Workshop on Algorithms and Data Structures
  9. 10.1103/PhysRevLett.106.250404 · DOI
  10. 10.1103/PhysRevA.84.032115 · DOI
  11. 10.1016/S0167-2789(98)00053-0 · DOI
  12. M. Ben-Or, Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS, 2006)

Cited by

Sorted by citations

Metadata

Authors
Pappa, A., Chailloux, A., Wehner, S., Diamanti, E., & Kerenidis, I.
Venue
Physical Review Letters
Published
2012-06-26
Volume
108
Issue
26
ISSN
  • 0031-9007
  • 1079-7114
Cited by
77
References
2
Language
en

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