CoChat
Sign Up
Cited by 37

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

Anderson localization and colocalization of spatially entangled photons

Abouraddy, Ayman F., Di Giuseppe, Giovanni, Christodoulides, Demetrios N., Saleh, Bahaa E. A.·2012·Physical Review A
DOI 10.1103/physreva.86.040302
Open this paper in CoChat — free account

Abstract

We explore the propagation of light in a two-photon state in disordered optical systems that induce Anderson localization. We show that entangled-photon pairs demonstrate a surprising behavior that we call Anderson colocalization: While neither photon exhibits Anderson localization, the spatial correlations of the pair remain intact. Furthermore, we show that entangled-photon pairs colocalize faster than classical light localizes in the same system. We also explore the propagation of anticorrelated and partially entangled photon pairs in such systems. The results are developed using a linear systems theory that extends the scope of quantum imaging to incorporate disordered systems.

Overview

Integrity signals

Registry

Crossref · 10.1103/physreva.86.040302

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • The computational complexity for exact classical BosonSampling was given in 2017 by Clifford and Clifford, and state-of-the-art sampling time is equal, within a factor of 2, to computing the permanent of one single scattering matrix.

    “The computational complexity for exact classical BosonSampling was given in the same year in Ref.[565] by Clifford and Clifford (CC): state-ofthe-art sampling time is equal, within a factor of 2, to computing the permanent of one single scattering matrix[566]”

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

  • In 2017, new classical algorithms were proposed to solve BosonSampling for systems with dimensionality larger than that allowed by near-term technological advances.

    “Nevertheless, in 2017 new classical algorithms have been proposed to solve Boson-Sampling for systems with dimensionality larger than that allowed by near-term technological advances [564,565,572,573,593,594]”

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

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 19

  1. 10.1103/PhysRev.109.1492 · DOI · Paper page
  2. 10.1103/PhysRevLett.100.013906 · DOI · Paper page
  3. 10.1103/PhysRevLett.103.013901 · DOI
  4. 10.1364/OL.35.001172 · DOI
  5. 10.1364/OE.14.002151 · DOI · Paper page
  6. M. A. Nielsen, 2000, Quantum Computation and Quantum Information
  7. 10.1103/PhysRevA.62.043816 · DOI
  8. 10.1103/PhysRevLett.102.193601 · DOI · Paper page
  9. 10.1103/PhysRevLett.104.173601 · DOI · Paper page
  10. 10.1103/PhysRevLett.105.090501 · DOI
  11. 10.1103/PhysRevA.83.033827 · DOI
  12. 10.1103/PhysRevA.82.053805 · DOI
  13. 10.1364/JOSAB.19.000656 · DOI
  14. L. Mandel, 1995, Optical Coherence and Quantum Optics, 10.1017/CBO9781139644105 · DOI · Paper page
  15. 10.1364/OE.19.013636 · DOI
  16. 10.1103/PhysRev.130.2529 · DOI · Paper page
  17. 10.1103/PhysRevLett.18.732 · DOI
  18. 10.1103/PhysRevA.63.063803 · DOI
  19. 10.1103/PhysRevLett.92.127903 · DOI

Cited by

Sorted by citations

Metadata

Authors
Abouraddy, A. F., Di Giuseppe, G., Christodoulides, D. N., & Saleh, B. E. A.
Venue
Physical Review A
Publisher
American Physical Society (APS)
Published
2012-10-10
Volume
86
Issue
4
ISSN
  • 1050-2947
  • 1094-1622
DOI
10.1103/physreva.86.040302
Cited by
37
References
7
Language
en
Licence
link.aps.org/licenses/aps-default-license (vor)

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