Cited by 46

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

Bounds on the probability of success of postselected nonlinear sign shifts implemented with linear optics

Knill, E.·2003·Physical Review A

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/physreva.68.064303

Cites

1 of 1 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?

  • For three photons, an additional collective phase is required to describe the photons' scattering behaviour.

    “For three photons for example, an additional collective phase is required to describe the photons' scattering behaviour [146][147][148].”

    From Two-photon interference: the Hong–Ou–Mandel effect (2021) · cites this paper as [148]

    The Introduction (page unavailable) defines nonlinear and conditional sign-shift gates, and Section III (page unavailable) applies a conditional sign shift to a two-photon state across three modes. Neither passage addresses three-photon scattering or says that describing it requires an additional collective phase. Searches for those terms found no supporting passage in our copy. (LLM, conf=0.76)

    Experimental — accuracy not yet measured
  • Knill (2003) demonstrated that feed-forward cannot increase the success probability of the NS gate to unity, and that the highest possible success probability for the NS gate using feed-forward is one half.

    “As mentioned before, Knill (2003) demonstrated that this is not the case, and that instead the highest possible success probability for the NS gate (using feed-forward) is one half.”

    From Linear optical quantum computing with photonic qubits (2007) · cites this paper as Knill (2003)

  • The general upper bound for such gates is 1/2.

    “The general upper bound for such gates was found to be 1/2 (Knill 2003).”

    From Linear optical quantum computing with photonic qubits (2007) · cites this paper as Knill 2003

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: 10

  1. E. Knill, 2001, Nature (London), 409, 46, 10.1038/35051009 · DOI · Paper page
  2. N. Yoran, 2003, Phys. Rev. Lett., 91, 037903, 10.1103/PhysRevLett.91.037903 · DOI · Paper page
  3. E. Knill, 2002, Phys. Rev. A, 66, 052306, 10.1103/PhysRevA.66.052306 · DOI · Paper page
  4. M. Reck, 1994, Phys. Rev. Lett., 73, 58, 10.1103/PhysRevLett.73.58 · DOI · Paper page
  5. T. B. Pittman, 2002, Phys. Rev. Lett., 88, 257902, 10.1103/PhysRevLett.88.257902 · DOI
  6. T. B. Pittman, 2002, Phys. Rev. A, 66, 052305, 10.1103/PhysRevA.66.052305 · DOI
  7. T. C. Ralph, 2002, Phys. Rev. A, 65, 012314, 10.1103/PhysRevA.65.012314 · DOI · Paper page
  8. J. D. Franson, 2002, Phys. Rev. Lett., 89, 137901, 10.1103/PhysRevLett.89.137901 · DOI · Paper page
  9. N. Lütkenhaus, 1999, Phys. Rev. A, 59, 3295, 10.1103/PhysRevA.59.3295 · DOI · Paper page
  10. J. Calsamiglia, 2002, Phys. Rev. A, 65, 030301, 10.1103/PhysRevA.65.030301 · DOI · Paper page

Cited by

Sorted by citations

Metadata

Authors
Knill, E.
Venue
Physical Review A
Published
2003-12-18
Volume
68
Issue
6
ISSN
  • 1050-2947
  • 1094-1622
Cited by
46
References
1
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