arXiv:2610.32908
Nonclassicality from Incomplete Fock-State Statistics
Martin Žonda, Pavel Baláž, Lukáš Lachman, Darren W. Moore, Tomáš Novotný, Radim Filip
Abstract
Nonclassicality in bosonic systems can be certified directly from occupation probabilities without full state reconstruction. To complete a library of such criteria we introduce a numerical framework that constructs optimal linear nonclassicality witnesses from arbitrary subsets of measured occupation probabilities by solving a semi-infinite linear program. The method contains known analytical criteria as special cases while generally detecting substantially larger nonclassical regions. We provide an open-source implementation of the numerical optimization together with the analytical criteria discussed here, enabling direct application of the framework to measured occupation statistics across bosonic platforms. As a case study, we apply it to the resonant Jaynes--Cummings model with thermal states and reveal nonclassicality at short interaction times and close to thermal balance, where detection of nonclassicality is otherwise challenging.
AI Summary
Based on v1The paper asks how much bosonic nonclassicality can be certified from an arbitrary finite subset of Fock-state probabilities, without tomography. Classical counting statistics are mixtures of Poisson distributions $p_k(\mu)=e^{-\mu}\mu^k/k!$. It optimizes linear witnesses $\lambda\cdot P-\sup_{\mu\geq0}\lambda\cdot p(\mu)>0$, with $|\lambda_i|\leq1$ fixing normalization. This tests incompatibility with classical counting statistics, rather than detecting nonclassicality invisible to number measurements. The optimization is formulated as a semi-infinite linear program and solved by an exchange procedure: solve a finite linear program, find the most violated Poisson constraint, and add it until a numerical tolerance is reached. The required global maximization reduces to evaluating a polynomial’s nonnegative stationary roots and the domain endpoints. An open-source Python implementation includes this procedure and the analytical criteria used for comparison. Comparisons with Klyshko-type, majorization, and counting-matrix criteria find additional detectable regions, including for sparse probability subsets where those analytical tests are unavailable. No discrepancy is found for $(P_0,P_n)$ or $(P_0,P_1,P_2)$; improvements appear with four consecutive probabilities. For resonant Jaynes–Cummings evolution from thermal oscillator and qubit states, numerical tests extend detection toward shorter interaction times and thermal balance, $\bar n=p_e/(1-2p_e)$. At $p_e=0.40$, ten consecutive probabilities improve on counting-matrix detection near $\bar n=2$. Numerical comparisons and independent characteristic-function checks indicate exponential narrowing of the undetected interval with interaction time. Exact balance remains classical. The paper reports increasing numerical instability when many probabilities are needed, motivating complementary analytical tests.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- Main text: 7 pages, 5 figures; Supplemental Material: 22 pages, 12 figures