Symmetric and asymmetric discrimination of bosonic loss: Toy applications to biological samples and photo-degradable materials
Gaetana Spedalieri, Stefano Pirandola, Samuel L. Braunstein

TL;DR
This paper explores quantum discrimination of bosonic loss using entangled states, demonstrating advantages in biological sample detection and photo-degradable materials, outperforming classical strategies especially at low photon numbers.
Contribution
It introduces quantum discrimination methods for bosonic loss, showing entanglement provides significant benefits in biological and material applications over classical approaches.
Findings
Entangled states outperform classical coherent states in low photon regimes.
Quantum methods enable faster detection of bacterial growth.
Enhanced readout of photo-degradable optical memories using quantum strategies.
Abstract
We consider quantum discrimination of bosonic loss based on both symmetric and asymmetric hypothesis testing. In both approaches, an entangled resource is able to outperform any classical strategy based on coherent-state transmitters in the regime of low photon numbers. In the symmetric case, we then consider the low energy detection of bacterial growth in culture media. Assuming an exponential growth law for the bacterial concentration and the Beer-Lambert law for the optical transmissivity of the sample, we find that the use of entanglement allows one to achieve a much faster detection of growth with respect to the use of coherent states. This performance is also studied by assuming an exponential photo-degradable model, where the concentration is reduced by increasing the number of photons irradiated over the sample. This investigation is then extended to the readout of classical…
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.
