Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper addresses a critical challenge in continuous-variable quantum information by exposing limitations in recent nonclassicality certification functionals, specifically their failure to detect certain weakly nonclassical mixed states. The authors provide a generalized derivation that extends these tools to multi-mode systems, offering a more robust framework for verifying quantum state properties despite inherent noise and singularities in phase-space distributions.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

A Sensitive Nonclassicality Certification Functional for Continuous-Variable Systems

arXiv2 min read

arXiv:2512.23299v4 Announce Type: replace Abstract: If the phase space-based Glauber-Sudarshan distribution, $P_{\varrho}$, has negative values the quantum state, $\varrho$, it describes is nonclassical. Due to $P$'s singular behaviour this simple criterion is impractical to use. Recent work [Bohmann and Agudelo, Phys. Rev. Lett. 124, 133601 (2020)] presented a general, sensitive, and noise-tolerant certification functional, $\xi[P]$, for the detection of non\-classical behaviour of quantum states $P_{\varrho}$. There, it was shown that when this functional takes on negative values somewhere in phase space, $\xi[P](x,p) < 0$, this is \emph{sufficient} to certify the nonclassicality of a state. Here we give examples where this certification fails. We investigate states which are known to be nonclassical but the certification function is non-negative, $\xi(x,p) \geq 0$, everywhere in phase space. We generalize $\xi$, giving it an appealing form, ${\cal S}$, which allows for slight improvements in certification, but ${\cal S}$ also fails for mixed very weakly nonclassical states. More important than a slight improvement in sensitivity of ${\cal S}$ over $\xi$ is that we showed how very sensitive $\xi$ and ${\cal S}$ are, and more important still is our simple derivation of ${\cal S}$ allowing us to generalize $\xi$ and ${\cal S}$ to multiple modes.

Abstract:If the phase space-based Glauber-Sudarshan distribution, $P_{\varrho}$, has negative values the quantum state, $\varrho$, it describes is nonclassical. Due to $P$'s singular behaviour this simple criterion is impractical to use. Recent work [Bohmann and Agudelo, Phys. Rev. Lett. 124, 133601 (2020)] presented a general, sensitive, and noise-tolerant certification functional, $\xi[P]$, for the detection of non\-classical behaviour of quantum states $P_{\varrho}$. There, it was shown that when this functional takes on negative values somewhere in phase space, $\xi[P](x,p) < 0$, this is \emph{sufficient} to certify the nonclassicality of a state. Here we give examples where this certification fails. We investigate states which are known to be nonclassical but the certification function is non-negative, $\xi(x,p) \geq 0$, everywhere in phase space. We generalize $\xi$, giving it an appealing form, ${\cal S}$, which allows for slight improvements in certification, but ${\cal S}$ also fails for mixed very weakly nonclassical states. More important than a slight improvement in sensitivity of ${\cal S}$ over $\xi$ is that we showed how very sensitive $\xi$ and ${\cal S}$ are, and more important still is our simple derivation of ${\cal S}$ allowing us to generalize $\xi$ and ${\cal S}$ to multiple modes.

arXiv:2512.23299 [quant-ph]

(or arXiv:2512.23299v4 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2512.23299 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 283 words

Related coverage