Almost indistinguishable single photons via multiplexing cascaded biphotons with cavity modulation and phase compensation
Y.-E. Wong, T. H. Chang, and H. H. Jen

TL;DR
This paper proposes methods to generate nearly indistinguishable single photons from cascaded biphotons using cavity modulation and phase compensation, significantly reducing frequency entanglement for quantum communication and computation.
Contribution
It introduces two approaches—cavity multiplexing with phase compensation and symmetric pumping—to greatly diminish frequency entanglement in biphotons, enhancing single photon indistinguishability.
Findings
Purity of single photon reaches 0.999 with multiplexing.
Entanglement entropy reduces to 0.006, 200 times smaller than without multiplexing.
Moderate reduction of entanglement entropy to 0.3 with symmetric pumping.
Abstract
The cascade-emitted biphotons generated from the alkali metal atomic ensembles are an excellent entanglement resource which enables long-distance quantum communication. The communication of quantum information between distant locations can be realized by utilizing the low-loss telecom bandwidth in the upper transition of the cascaded photons in a fiber-based quantum network. Meanwhile, the infrared photon from the lower transition of this highly directional and frequency-correlated biphoton can be created under the four-wave mixing process and can be stored locally as a collective spin wave. Here we theoretically investigate the frequency entanglement of this biphoton and propose two approaches to remove their mutual correlations in frequency spaces. The first approach applies an optical cavity which modulates the biphoton spectrum into a more symmetric and narrow spectral function by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
