Search arXivSearch

arXiv · 2504.10455

The stellar decomposition of Gaussian quantum states

Abstract

We introduce the stellar decomposition, a novel method for characterizing non-Gaussian states produced by photon-counting measurements on Gaussian states. Given an $(m+n)$-mode Gaussian state $G$, we express it as an $(m+n)$-mode "Gaussian core state" $G_{\mathrm{core}}$ followed by an $m$-mode Gaussian transformation $T$ that only acts on the first $m$ modes. The defining property of the Gaussian core state $G_{\mathrm{core}}$ is that measuring the last $n$ of its modes in the photon-number basis leaves the first $m$ modes on a finite Fock support, i.e. a core state. Since $T$ is measurement-independent and $G_{\mathrm{core}}$ has an exact and finite Fock representation, this decomposition exactly describes all non-Gaussian states obtainable by projecting $n$ modes of $G$ onto the Fock basis. For pure states we prove that a physical pair $(G_{\mathrm{core}}, T)$ always exists with $G_{\mathrm{core}}$ pure and $T$ unitary. For mixed states, we establish necessary and sufficient conditions for $(G_{\mathrm{core}}, T)$ to be a Gaussian mixed state and a Gaussian channel. We also develop a semidefinite program to extract the "largest" possible Gaussian channel when these conditions fail. Finally, we present a formal stellar decomposition for generic operators, which is useful in simulations where the only requirement is that the two parts contract back to the original operator. The stellar decomposition leads to practical bounds on achievable state quality in photonic circuits and for GKP state generation in particular. Our results are based on a new characterization of Gaussian completely positive maps in the Bargmann picture, which may be of independent interest.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arsalan Motamedi, Yuan Yao, Kasper Nielsen, Ulysse Chabaud, J. Eli Bourassa, Rafael N. Alexander, Filippo Miatto. 2026-01-07. The stellar decomposition of Gaussian quantum states. https://doi.org/10.22331/q-2026-01-19-1971

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fermionic magic resources in disordered quantum spin chains

Fermionic non-Gaussianity quantifies a quantum state's deviation from a classically tractable free-fermionic description, constituting a necessary resource for computational quantum advantage. Here we use fermionic antiflatness (FAF) to measure this deviation across ergodic and many-body localized (MBL) regimes. We focus on the paradigmatic disordered spin-$1\!/2$ XXZ chain and its impurity variant with local interactions. Across highly excited eigenstates, FAF evolves from typical-state behavior at weak disorder to strongly suppressed values deep in the MBL regime, with volume-law scaling in the XXZ chain and an area-law bound in the impurity setting. Rare long-range cat-like eigenstates exhibit a pronounced enhancement of FAF, making it a sensitive diagnostic of mechanisms proposed to destabilize MBL. Starting from product states, we find that in the MBL regime FAF grows slowly in time, approaching saturation via a power-law relaxation. Overall, our results show that MBL suppresses fermionic non-Gaussianity, and the associated complexity beyond free fermions, while ergodicity restores it, motivating explorations of fermionic non-Gaussianity in other ergodicity-breaking phenomena.

quant-ph

Progressive Binarization - Pauli Correlation Encoding: a Continuation Method for Constrained Optimization

Pauli Correlation Encoding (PCE) reduces the qubit requirements of quantum optimization by embedding the problem variables into the expectation values of Pauli observables, so that the number of qubits can be much smaller than the number of variables. PCE has not yet been studied for constrained optimization. We extend it to constrained combinatorial problems, using the budget-constrained MinCut as a case study, and show that the standard formulation fails to reliably enforce the constraint: feasibility hinges on the binarization of the encoded variables, which depends sensitively on hyperparameters that are hard to tune and do not transfer across instances. To address this, we introduce Progressive-Binarization PCE (PB-PCE), an adaptive continuation scheme that progressively increases the binarization parameter while re-optimizing the circuit from the previous solution, driving the variables towards the binary domain. PB-PCE attains near-complete constraint satisfaction (88--100\%) and smaller cut sizes than standard PCE, with a number of stages (10--20) essentially independent of problem size, solving instances of up to 300 variables with only 9-qubit circuits.

quant-ph

A quantum model for synchronizing finite state transition systems

We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class.

quant-ph