Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tradeoff between Wigner negativity and decoherence time for cubic Gaussian states

Published 7 Oct 2026 in quant-ph | (2610.10073v1)

Abstract: Wigner negativity has been shown to be a resource in quantum computing, raising the question of how to efficiently produce states with a large Wigner negativity. Cubic Gaussian states, obtained when a cubic gate is applied to a Gaussian state, have been proposed as candidates for this purpose. We show that cubic Gaussian states with a large Wigner negativity N\mathcal N necessarily have a short decoherence time ττ that is bounded above by N<sup>−2\mathcal N<sup>{-2}. In other words, a large Wigner negativity comes at a cost: the decoherence time ττ of cubic Gaussian states decreases at least quadratically in the negativity N\mathcal N. Maximizing ττ at fixed Wigner negativity N\mathcal N, we show that this upper bound is reached by optimal cubic Gaussian states. They have the property that for large negativity, the optimal squeezing scales as ln⁡N\ln\mathcal N and the optimal cubicity as N<sup>−1\mathcal N<sup>{-1}. Optimal cubic Gaussian states with large negativity can therefore be constructed with small cubicity, provided sufficient squeezing is applied. However, their decoherence time decreases with growing negativity. In addition, we show that their preparation is extremely sensitive to thermal noise. Finally, we compare, for each integer nn, the optimal cubic Gaussian state with the nnth Fock state that has the same negativity: despite their pronounced differences in photon number distribution and Wigner function, we show that they have similar, be it slightly larger, decoherence times and entanglement generating potential through a beam splitter.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.