Entangling independent particles by path identity

Authors: Kai Wang, Zhaohua Hou, Kaiyi Qian, Leizhen Chen, Mario Krenn, Shining Zhu, Xiao-song Ma

Phys. Rev. Lett. 133, 233601 (2024)
arXiv: 2412.03022v1 - DOI (quant-ph)

Abstract: Quantum entanglement -- correlations of particles that are stronger than any classical analogue -- is the basis for research on the foundations of quantum mechanics and for practical applications such as quantum networks. Traditionally, entanglement is achieved through local interactions or via entanglement swapping, where entanglement at a distance is generated through previously established entanglement and Bell-state measurements. However, the precise requirements enabling the generation of quantum entanglement without traditional local interactions remain less explored. Here we demonstrate that independent particles can be entangled without the need for direct interaction, prior established entanglement, or Bell-state measurements, by exploiting the indistinguishability of the origins of photon pairs. Our demonstrations challenge the long-standing belief that the prior generation and measurement of entanglement are necessary prerequisites for generating entanglement between independent particles that do not share a common past. In addition to its foundational interest, we show that this technique might lower the resource requirements in quantum networks, by reducing the complexity of photon sources and the overhead photon numbers.

Submitted to arXiv on 04 Dec. 2024

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.