Introduction

Quantum state tomography1,2,3 aims to provide a classical description of quantum states from experimental data. As a fundamental task in physics and quantum information processing, it not only facilitates the tests of quantum physics, but also enables quantum device certification and benchmarking4. However, quantum state tomography is a challenging task in general—each measurement requires a new copy of the state as measurement collapses the original quantum state. To learn an approximate description of a quantum system with n qubits, the required number of samples is exponential in n5,6. In the case of bosonic systems, the infinite-dimensional Hilbert space casts additional challenges to the problem of tomography7.

The challenge in quantum state tomography arises from the complex nature of quantum correlations between subsystems: highly entangled states involving superpositions of a large number of states are generally hard to learn, while separable states with classical correlations are naturally easier to learn. At the same time, one may identify subsets of non-separable quantum states that are easier to learn. For instance, refs. 7,8,9 developed efficient learning protocols for Gaussian bosonic quantum states10,11—a family of experimentally friendly states—and its generalization of t-doped Gaussian states. Thus, the interplay between properties of quantum correlation and learning sample complexity in bosonic quantum systems is unclear. In this work, we approach the problem by considering how quantum correlations are generated from separable states.

We begin by considering the example of the Hong–Ou–Mandel (HOM) effect12, where two incoming identical and separable single photons interfere on a beam-splitter to deterministically generate an entangled output, manifesting a bunching effect between indistinguishable photons. The output state \(\sim | 20\left.\right\rangle+| 02\left.\right\rangle\) is the N = 2 case of the family of NOON states \(\sim | N0\left.\right\rangle+| 0N\left.\right\rangle\), which are maximally entangled N-photon states useful to enhance quantum metrology13,14. Similar to HOM, in boson sampling experiments15, multiple modes of photons interfere on a network of beam-splitters creating highly multipartite entangled states, whose measurement statistics are hard to simulate classically, creating an opportunity to demonstrate quantum advantage16,17.

Inspired by the HOM effect12 and boson sampling experiments15, we define Gaussian-entanglable (GE) states as states produced by generalized interference described by Gaussian processes10 between separable bosonic modes (see Fig. 1). Despite the fact that GE states enable quantum computational advantage, we prove that an m-mode pure GE state is learnable with only poly(m) samples, by providing an explicit protocol—Gaussian disentangling (GDE) tomography—involving only Gaussian unitary, local tomography (e.g., homodyne or heterodyne) and classical processing. The protocol is robust to experimental imperfections, including weak loss and noise, and arbitrary homogeneous loss. We provide numerical simulations for learning the states generated from passing number states, cat states and thermal states over a lossy beam-splitter, demonstrating GDE’s advantage over conventional approaches.

Fig. 1: Quantum correlations and the complexity of tomography.
Fig. 1: Quantum correlations and the complexity of tomography.
Full size image

Gaussian-entanglable (GE) state are states generated by performing Gaussian protocols on (possibly non-Gaussian) separable input states. The class of GE states includes the output state of the Hong–Ou–Mandel experiment, i.e., two photons input to a beam-splitter where photon bunching effect emerges, and the output states of the boson sampling protocol, where single photons together with vacuum states are input into a multi-mode linear interferometer. Other examples include entangled cat states, obtained by applying a beam-splitter to two identical cat states, and multi-mode GKP states, generated by performing Gaussian unitaries on single-mode GKP states. In addition, the class of GE states encompasses both the convex hull of Gaussian states and the entire set of separable states. Here, we prove that the NOON state \(| N\left.\right\rangle | 0\left.\right\rangle+| 0\left.\right\rangle | N\left.\right\rangle\) with N ≥ 3, superposition of TMSV states \(| {\zeta }_{r,0}\left.\right\rangle+| {\zeta }_{r,\pi }\left.\right\rangle\), and the two-mode arithmetic progression state (see Supplemental Note 4) do not belong to the set of GE states. These states are conventionally generated by applying controlled gates followed by post-selection. At last, we show that the sample complexity in learning pure GE states scales as  ~ poly(m) regarding number of modes m; while NGE state generally requires an exponential overhead \(\sim \exp (m)\).

For non-GE states, we derive an operation-driven monotone—the number of additional modes necessary to reduce them to GE states. Moreover, we prove that this monotone exactly captures the exponential overhead in sample complexity of learning the states. Besides their clear implications for the sample complexity of learning, our results also settle a long-standing open problem, namely that NOON states with N ≥ 3 photons cannot be generated deterministically by interfering an arbitrary product state, as they are not in the GE class. Earlier studies addressed only restricted cases involving number state inputs in linear optical settings18,19,20.

Results

To characterize quantum correlations beyond HOM and boson sampling in bosonic systems, we introduce non-Gaussian-entanglable (NGE) states: these are the quantum states which cannot be generated via a generalized interference experiment (see Fig. 1), where separable quantum states are input to Gaussian protocols10,11. Conversely, quantum states generated via generalized interference experiments are GE states. GE states are operationally meaningful, especially considering the recent progress of multi-mode quantum state engineering21,22. By definition, GE states include all Gaussian states and their convex mixtures23,24,25,26,27,28. In addition, they include states that are neither separable nor convex mixtures of Gaussian states, such as the output states of boson sampling experiments15, which involve identical photons scattering through a linear optical interferometer and whose measurement statistics is computationally hard to classically simulate. Moreover, the recently proposed multi-mode Gottesman–Kitaev–Preskill (GKP) states, with superior error correction performance over single-mode versions29,30,31,32, are GE—they can be engineered via applying Gaussian unitaries on single-mode GKP states31,32, reducing the challenge of multi-mode state engineering to preparing single-mode GKP states. On the contrary, NGE states will generally require a multi-mode non-Gaussian operation—or equivalently realized by Gaussian operations assisted with a sufficient amount of non-Gaussian ancilla33, creating a large overhead in quantum information processing.

To sharpen the distinction between GE and NGE states, we develop a convex resource theory34 of genuine non-Gaussian entanglement. With GE states as the free states, the free operations are Gaussian protocols. Besides proving that NOON states with N ≥ 3 are NGE, we provide other examples of NGE states, such as superposition of two-mode squeezed vacuum states (TMSV). Furthermore, we introduce and analyze two monotones to quantify genuine non-Gaussian entanglement, one based on entanglement entropy (the NG entanglement entropy) and the other one based on the minimal number of ancillary modes necessary to convert an NGE state into a GE state (the GE cost). Moreover, we propose the GDE tomography protocol based on Gaussian unitary, local tomography (e.g., homodyne or heterodyne) and classical processing, and show its efficient learning in pure GE states and special classes of mixed GE states. We also establish a continuity proof for the robustness of our protocol for general states close to pure GE states. We show that the sample complexity of tomography for pure GE states grows polynomially with the number of modes, while NGE states generally require an exponential overhead, quantified by their GE cost. This implies that output states in boson sampling experiments are easy to learn, despite their measurement statistics being hard to sample from with a classical computer15. We also provide numerical verification of the tomography process. The main results of this work are summarized in Table 1.

Table 1 Main results of this work

Continuous-variable systems and state learning

Continuous-variable quantum systems model continuous degrees of freedom, such as optical fields35, mechanical motions of ions36, and microwave cavities37. Owing to their information-rich infinite-dimensional Hilbert space, these systems are crucial for quantum communication38, quantum sensing39,40, quantum error correction22,33, and quantum computing41 (see Supplemental Note 1A).

While general states of continuous-variable quantum systems are unbounded in energy, we are interested in practically relevant states with energy constraints. In particular, we consider m-mode quantum states with finite energy moment constraint, \({[{{{\rm{Tr}}}}{\hat{E}}_{m}^{k}\hat{\rho }]}^{1/k}\le mE\), where the energy operator \({\hat{E}}_{m}=\frac{1}{4}{\sum }_{\ell=1}^{m}({\hat{q}}_{\ell }^{2}+{\hat{p}}_{\ell }^{2})\) is a quadratic function of the position and momentum quadratures \({\hat{q}}_{\ell }\) and \({\hat{p}}_{\ell }\) in natural units  = 2. We denote the set of m-mode pure states satisfying this k-th energy moment constraint as \({{{{\mathcal{H}}}}}_{m,E}^{k}\). We denote the set of mixed states satisfying the same energy constraint as \({{{\rm{St}}}}({{{{\mathcal{H}}}}}_{m,E}^{2})\).

Learning a state within a trace distance error of ϵ is equivalent to pinpointing it in state space within an ϵ-ball with respect to the trace distance metric. The number of such ϵ-balls—the volume—of the state space that the unknown state belongs to can manifest the challenge of state learning. It has been shown in ref. 7 that, for pure states subject to k-th moment constraint, the volume of the state space grows double-exponentially with the system size, scaling as \(\exp \left[{\left(\frac{E}{12{\epsilon }^{2/k}}\right)}^{m}\right]\).

Gaussian state and protocols

Among bosonic states and operations, Gaussian states (e.g., coherent states and squeezed states), and operations (e.g., beam-splitters, phase rotations, and squeezing) are not only analytically tractable but also experimentally friendly10,11.

Gaussian states are specific types of quantum states with their Wigner characteristic function in a Gaussian form42,43; therefore, a Gaussian state \(\hat{\rho }\) is uniquely specified by its mean \({{{\boldsymbol{\xi }}}}:=\,{\mbox{Tr}}\,[\hat{{{{\boldsymbol{r}}}}}\hat{\rho }]\) and covariance matrix \(V:=\frac{1}{2}\,{{\mbox{Tr}}} \,[\{(\hat{{{{\boldsymbol{r}}}}}-{{{\boldsymbol{\xi }}}}),{(\hat{{{{\boldsymbol{r}}}}}-{{{\boldsymbol{\xi }}}})}^{{{{\rm{T}}}}}\}\hat{\rho }]\)10,11, where \(\hat{{{{\boldsymbol{r}}}}}={[{\hat{q}}_{1},{\hat{p}}_{1},\cdots,{\hat{q}}_{m},{\hat{p}}_{m}]}^{{{{\rm{T}}}}}\) is the vector of quadrature operators. For instance, the TMSV, defined as \({| {\zeta }_{r,\phi }\left.\right\rangle }_{AB}={(\cosh r)}^{-1}{\sum }_{k=0}^{\infty }{e}^{ik\phi }{(\tanh r)}^{k}{| k\left.\right\rangle }_{A}{| k\left.\right\rangle }_{B}\), have zero-mean and are uniquely determined by a covariance matrix that depends on the squeezing strength r and phase angle ϕ. Here \(| k\left.\right\rangle\) is the Fock state with photon number k. Gaussian quantum channels are completely positive trace-preserving maps that transform all Gaussian states into Gaussian states (see Supplemental Note 1B). In the following text, we shall use the notation \({\mathbb{G}}({{{\mathcal{H}}}})\) and \({\mathbb{G}}{\mathbb{U}}({{{\mathcal{H}}}})\) to represent the set of all Gaussian quantum channels and unitaries on the Hilbert space \({{{\mathcal{H}}}}\). More generally, a Gaussian protocol27 includes the following set of quantum operations: (1) Gaussian unitaries on the system or part of the system, (2) partial trace, (3) composition with ancillary vacuum states, (4) probabilistically applying the above operations. Note that we exclude Gaussian measurements followed by the conditional operations (1)–(4) from the set of Gaussian protocols we consider, because these are more challenging from an experimental standpoint and the resulting feed-forward scheme might not reduce to a convex mixture of Gaussian channels.

Gaussian protocols (1)–(4) alone, without non-Gaussian ancilla, are limited in power—they are not universal for various tasks44,45,46,47,48,49,50,51. As it turns out, even when allowing for non-Gaussian input states, the generalized Gaussian interference process in Fig. 1 can only generate a limited class of states, as we define below.

Gaussian-entanglable state

Consider a bi-partition of the Hilbert space \({{{\mathcal{H}}}}={{{{\mathcal{H}}}}}_{A}\otimes {{{{\mathcal{H}}}}}_{B}\). A quantum state \({\hat{\rho }}_{AB}\) is (bi-partite) GE if it can be obtained by probabilistically applying a Gaussian protocol \({{\mathfrak{G}}}_{x}\) on an ensemble of (possibly non-Gaussian) separable state \({\hat{\sigma }}_{AB,y}\in {\mathbb{SEP}}({{{{\mathcal{H}}}}}_{A}\otimes {{{{\mathcal{H}}}}}_{B})\) as \({\hat{\rho }}_{AB}={\sum }_{{x}^{{\prime} },y}{p}_{{x}^{{\prime} },y}^{{\prime} }\,{{\mathfrak{G}}}_{{x}^{{\prime} }}\left({\hat{\sigma }}_{AB,y}\right)\) with \({p}_{{x}^{{\prime} },y}^{{\prime} }\) being a joint probability distribution. Equivalently, a GE state can be expressed as:

$${\hat{\rho }}_{AB}=\mathop{\sum}_{x,y}{p}_{x,y}\,{{{{\mathcal{G}}}}}_{x}\left({\hat{\sigma }}_{AB,y}\right),$$
(1)

where px,y refers to a joint probability distribution and \({{{{\mathcal{G}}}}}_{x}\in {\mathbb{G}}({{{{\mathcal{H}}}}}_{A}\otimes {{{{\mathcal{H}}}}}_{B})\) denotes a Gaussian channel.

In practice, the GE state in Eq. (1) can be obtained by sampling from the joint probability distribution px,y, preparing the separable input state \({\hat{\sigma }}_{AB,y}\), and implementing the channel \({{{{\mathcal{G}}}}}_{x}\). When \({{{{\mathcal{G}}}}}_{x}\) is unitary, it corresponds to randomly applying Gaussian unitaries on separable states. By definition, the set of GE states is convex—a mixture of GE states is still GE.

As schematically illustrated in Fig. 1, GE states can be non-Gaussian, and even not a convex mixture of Gaussian states. For instance, all entangled states generated by beam-splitter interference of non-Gaussian states, such as number states, are GE, e.g., the state \(({| 0\left.\right\rangle }_{A}{| 2\left.\right\rangle }_{B}+{| 2\left.\right\rangle }_{A}{| 0\left.\right\rangle }_{B})/\sqrt{2}\) from the HOM effect12. Similarly, the entangled cat state21\(\propto {| \underline{\alpha }\left.\right\rangle }_{A}{| \underline{\alpha }\left.\right\rangle }_{B}+{| \underline{-\alpha }\left.\right\rangle }_{A}{| \underline{-\alpha }\left.\right\rangle }_{B}\) is GE, as it can be generated using a balanced beam-splitter on a product of cat state and vacuum, \(\propto {| {{{\rm{cat}}}}\left.\right\rangle }_{\sqrt{2}\alpha,A}\otimes {| 0\left.\right\rangle }_{B}\). Here \(| \underline{\alpha }\left.\right\rangle\) is a coherent state with amplitude α, and \({| {{{\rm{cat}}}}\left.\right\rangle }_{\alpha }\propto | \underline{\alpha }\left.\right\rangle+| \underline{-\alpha }\left.\right\rangle\) denotes a cat state. (Here, we have introduced the underline to distinguish between coherent states and number states, omitted in the special case of the vacuum state \(| 0\left.\right\rangle\).) Moreover, one can obtain a state \(\propto {| {{{\rm{cat}}}}\left.\right\rangle }_{\sqrt{2}\alpha,A}{| 0\left.\right\rangle }_{B}+{| 0\left.\right\rangle }_{A}{| {{{\rm{cat}}}}\left.\right\rangle }_{\sqrt{2}\alpha,B}\) via interference between two identical cat states \({| {{{\rm{cat}}}}\left.\right\rangle }_{\alpha }\). Other examples include GE states generated by the multi-mode GKP encoding process: \({| \psi \left.\right\rangle }_{m\to m+{m}^{{\prime} }}={\hat{U}}^{g}({| \psi \left.\right\rangle }_{m}\otimes {| {\mbox{GKP}}\left.\right\rangle }^{\otimes {m}^{{\prime} }})\), where \({\hat{U}}^{g}\) is a multi-mode Gaussian unitary, \({| \psi \left.\right\rangle }_{m}\) is an arbitrary m-mode state, \(| \,{\mbox{GKP}}\,\left.\right\rangle\) is the canonical GKP state. Any multi-mode GKP state is also GE29,30,31,32.

As we show, one can obtain any pure GE states from Gaussian unitary on a product state, as shown below.

Theorem 1

(Decomposition of pure GE states): Any pure GE state can be expressed in the following form:

$${| \psi \left.\right\rangle }_{AB}={\hat{U}}^{g}{| \phi \left.\right\rangle }_{A}{| {\phi }^{{\prime} }\left.\right\rangle }_{B},$$
(2)

where \({\hat{U}}^{g}\) is a Gaussian unitary, \(| \phi \left.\right\rangle\) and \(| {\phi }^{{\prime} }\left.\right\rangle\) are local states of systems A and B.

The proof, as elaborated in Supplemental Note 2, is based on the concavity of entropy, Gaussian unitary decompositions, and more importantly the fact that the only states that remain pure under multi-mode pure loss are coherent states, which generalizes a single-mode result that is crucial for solving the minimum entropy output conjecture and the Gaussian state majorization conjecture52,53 (see Lemma 7 in “Methods”).

GE states possess several distinctive properties (see details in Supplemental Note 3). For a pure Gaussian state with a non-degenerate symplectic spectrum, the condition that its covariance matrix is block-diagonal (linear uncorrelated) is equivalent to the state being a product state (independent). This equivalence fails when the symplectic eigenvalues are degenerate. In addition, Gaussian protocols map GE states to GE states. At last, one can extend the definition of bi-partite GE states in Eq. (1) and Theorem 1 to a multipartite m-mode case.

Furthermore, one can denote the covariance matrix of \({| \psi \left.\right\rangle }_{AB}\) as VAB. For any symplectic matrix S such that SVABST = Λ is the Williamson diagonal form, the corresponding Gaussian unitary \({\hat{U}}_{S}\) is equivalent to \({\hat{U}}^{g}\) in Eq. (2) up to a beam-splitter \({\hat{U}}_{O}\) for an orthogonal matrix O and a displacement operation \(\hat{D}\)10, i.e., \({\hat{U}}^{g}=\hat{D}\,{\hat{U}}_{S}{\hat{U}}_{O}\). If the symplectic eigenvalues of VAB are non-degenerate, we have \({\hat{U}}^{g}=\hat{D}\,{\hat{U}}_{S}({\hat{U}}_{A}^{g}\otimes {\hat{U}}_{B}^{g})\), where \({\hat{U}}_{A}^{g}\otimes {\hat{U}}_{B}^{g}\) is a tensor product of phase shifters. Hence, by first measuring the mean vector and covariance matrix, then applying the partial inverse \({\hat{U}}_{S}^{{{\dagger}} }{\hat{D}}^{{{\dagger}} }\) of the Gaussian unitary, any GE state can be transformed into a passive-separable state (GE states with only passive beam-splitters as the entangling operation). The next section outlines a tomography protocol for GE states that exploits this counter-rotation step.

Efficient learning of pure GE states

As anticipated, pure GE states have reduced sample complexity for quantum state tomography, since one only needs to estimate the corresponding Gaussian unitary and local states by Theorem 1. In particular, we obtain the following result:

Theorem 2

(Sample complexity of pure GE states): Consider the set of m-mode pure states \(\left\{| \psi \left.\right\rangle \right\}\) obtained by applying a Gaussian unitary to a tensor product of single-mode states \(\left\{{\otimes }_{j=1}^{m}| {\psi }_{j}\left.\right\rangle \right\}\), where the states satisfy energy moment constraint, \(| \psi \left.\right\rangle \in {{{{\mathcal{H}}}}}_{m,E}^{2}\). Then, the tomography of such states requires M copies such that:

$$\Theta \left[\frac{1-\delta }{\log E}\frac{mE}{\epsilon }\right]\le M\le {{{\mathcal{O}}}}\left[{{{\rm{poly}}}}\left(m,E,\frac{1}{\epsilon },\log \frac{1}{\delta }\right)\right],$$
(3)

where δ denotes the failure probability and ϵ refers to the trace distance between the input and the reconstructed state.

The upper bound in Theorem 2 is demonstrated in Supplemental Note 7D, while the lower bound is determined by sample complexity of product states with moment constraints7. Therefore, the tomography of pure GE states is sample-efficient. For the case with a moderate number of modes in which constant prefactors in the sample complexity become important, we provide an explicit upper bound in Supplemental Note 7 F to offer more practical guidance for GE-state learning.

Below, we present the GDE learning protocol (see Fig. 2), involving a Gaussian unitary and then local state tomography. The local state tomography can be performed via different approaches, for example using heterodyne detection and classical processing. We begin with the simple example of passive separable states, where the physical Gaussian unitary is not needed. Then, we proceed to general pure GE states. In the next section, we generalize towards mixed GE states.

Fig. 2: The GDE tomography protocol simply using local state tomography.
Fig. 2: The GDE tomography protocol simply using local state tomography.
Full size image

First, we estimate the displacement α and covariance matrix V by homodyne and heterodyne measurements. Based on the results, we subsequently apply a calibrated Gaussian unitary \({\hat{U}}_{\widetilde{S}}^{{{\dagger}} }{\hat{U}}_{\widetilde{{{{\boldsymbol{\alpha }}}}}}^{{{\dagger}} }\) to counter-rotate the state, and finally perform local tomography to reconstruct the local states. When the symplectic eigenvalues are non-degenerate, the Gaussian entangling unitary \({\hat{U}}^{g}\) is fully identified and the counter-rotated states is separable; Otherwise, the state becomes passive-separable and we continue with the process depicted in Fig. 3.

As a concrete example, consider the output state of an m-mode boson sampling process, known as passive-separable states \(\left\{| {\psi }_{{{{\rm{ps}}}}}\left.\right\rangle \right\}\)54, generated by applying a passive Gaussian unitary \({\hat{U}}_{O}\) to a product state \(\{{\otimes }_{j=1}^{n}| {\psi }_{j}\left.\right\rangle \}\), where \(| {\psi }_{j}\left.\right\rangle\) is a single-mode state (for multi-mode subsystem, we refer to Supplemental Note 7A). We present a tomography algorithm that takes as input M copies of the unknown state \(| {\psi }_{{{{\rm{ps}}}}}\left.\right\rangle={\hat{U}}_{O}{\otimes }_{j=1}^{n}| {\psi }_{j}\left.\right\rangle\), output the classical description of a boson-sampling output state \(| \widetilde{{\psi }_{{{{\rm{ps}}}}}}\left.\right\rangle\) with smaller than ϵ2 fidelity error with the input state \(| {\psi }_{{{{\rm{ps}}}}}\left.\right\rangle\) (leading to a trace distance error smaller than ϵ by the Fuchs–van de Graaf inequality55) and a failure probability lower than δ. As shown in Fig. 3, without relying on any adaptive strategy, the algorithm first performs heterodyne measurement on all M copies of the quantum states and then performs classical post-processing to obtain an estimate of the state.

Fig. 3: Sample-efficient protocol for learning boson sampling output states.
Fig. 3: Sample-efficient protocol for learning boson sampling output states.
Full size image

It follows a non-adaptive procedure that uses only local measurement data: (i) Perform heterodyne measurement on all M state copies to collect phase-space samples {γj}. (ii) Iterate over an ϵ − net of passive-separable states \(| {\psi }_{{{{\rm{ps}}}}}\left.\right\rangle={\hat{U}}_{O}{\otimes }_{j=1}^{n}| {\psi }_{j}\left.\right\rangle\), reconstruct the corresponding local states \(\{{\hat{\rho }}_{j}\}\) after every passive operation \({\hat{U}}_{{O}^{{\prime} }}^{{{\dagger}} }\), and evaluate a local fidelity \({F}_{j}=\left\langle \right.{\psi }_{j}^{{\prime} }| {\hat{\rho }}_{j}| {\psi }_{j}^{{\prime} }\left.\right\rangle\) for each possible local state \(| {\psi }_{j}^{{\prime} }\left.\right\rangle\). (iii) The first candidate with \(W:=1-{\sum }_{j=1}^{n}(1-{F}_{j})\ge 1-{\epsilon }^{2}\) is accepted as the reconstructed state; otherwise the protocol aborts.

To describe the post-processing algorithm, we denote the heterodyne measurement result \({q}_{k}^{(\ell )}+i{p}_{k}^{(\ell )}\) for the k-th mode in the -th copy. We collect all results as vectors \({{{{\boldsymbol{\gamma }}}}}^{(\ell )}={({q}_{1}^{(\ell )},{p}_{1}^{(\ell )},\cdots,{q}_{m}^{(\ell )},{p}_{m}^{(\ell )})}^{T},1\le \ell \le M\). Given the measurement results γ(), the algorithm searches over all possible passive operations \({\hat{U}}_{{O}^{{\prime} }}\) and goes over all possible local states \(| {\psi }_{j}^{{\prime} }\left.\right\rangle\). For each choice of \({\hat{U}}_{{O}^{{\prime} }}\) and \(\{| {\psi }_{j}^{{\prime} }\left.\right\rangle \}\), we perform classical processing as detailed hereafter to obtain a fidelity lower bound estimate W. The exhaustive search ends when the fidelity lower bound estimate satisfies W ≥ 1–ϵ2, outputting the description of the corresponding estimate \(| \widetilde{{\psi }_{{{{\rm{ps}}}}}}\left.\right\rangle={\hat{U}}_{{O}^{{\prime} }}{\otimes }_{j=1}^{n}| {\psi }_{j}^{{\prime} }\left.\right\rangle\). Otherwise, a failure is declared.

As sketched in Fig. 3, to obtain the fidelity lower bound estimate, we first calculate \({{{{\boldsymbol{\alpha }}}}}^{(\ell )}={O}^{{\prime} }{{{{\boldsymbol{\gamma }}}}}^{(\ell )}\) and reconstruct all local states \({\{{\hat{\rho }}_{j,{O}^{{\prime} }}\}}_{j=1}^{m}\), whose matrix element in the number basis is

$${({\hat{\rho }}_{j,{O}^{{\prime} }})}_{k{k}^{{\prime} }}=\frac{1}{M}\mathop{\sum }_{\ell=1}^{M}{\int}_{{{\mathbb{C}}}^{2}}\frac{{{{{\rm{d}}}}}^{2}{{{\boldsymbol{u}}}}}{4\pi }{e}^{\frac{\parallel {{{\boldsymbol{u}}}}{\parallel }_{2}^{2}}{8}+\frac{i\left[{{{{\boldsymbol{\alpha }}}}}_{2j}^{(\ell )},{{{{\boldsymbol{\alpha }}}}}_{2j+1}^{(\ell )}\right]\Omega {{{\boldsymbol{u}}}}}{2}}{\chi }_{k{k}^{{\prime} }}({{{\boldsymbol{u}}}}),$$
(4)

where Ω denotes the symplectic form (see “Methods”) and \({\chi }_{k{k}^{{\prime} }}({{{\boldsymbol{u}}}})\) refers to the characteristic function of the operator \(| k\left.\right\rangle \left\langle \right.{k}^{{\prime} }|\). The above reconstruction is a standard heterodyne tomography56, but other reconstruction algorithms can also be adopted57,58. Finally, following ref. 59, we can compute the fidelity witness estimate

$$W=1-{\sum }_{j=1}^{n}(1-{F}_{j}),$$
(5)

where each \({F}_{j}=\left\langle \right.{\psi }_{j}^{{\prime} }| {\hat{\rho }}_{j,{O}^{{\prime} }}| {\psi }_{j}^{{\prime} }\left.\right\rangle\) is the local state fidelity for the current estimate.

A challenge in the classical processing is that it needs to go over all possible guesses of \({\hat{U}}_{{O}^{{\prime} }}\) and local states, which are parameterized by continuous parameters with infinite possibilities. The way out of this dilemma is that we only require a finite error in the state learning: the finite-error relaxation allows one to establish a discrete set of ϵ-balls of the possible \({\hat{U}}_{{O}^{{\prime} }}\) and local states. Essentially, learning the parameters up to a discrete set of values suffices for meeting the ϵ error requirement. Accordingly, for each of the ϵ-balls, we take the mean values as the choice and perform a fidelity test, which also has a failure probability of not satisfying the needed error tolerance. The failure probability then builds up with the number of ϵ-balls—generally a huge number. On the other hand, the failure probability decreases exponentially with the number of samples M; therefore, the required number of samples is logarithmic of the number of ϵ-balls. As a result, the key part of the proof of Theorem 2 is to upper bound the number of ϵ-balls (the volume) required for boson-sampling states, as we analyze in the “Methods” section in detail.

With the sample-efficient learning of passive-separable states introduced, the generalization to arbitrary GE states can be obtained by applying a Gaussian unitary to reduce a GE state to a passive-separable state, hence, we name the protocol Gaussian-disentangling (GDE) learning. To do so, we first estimate the mean and covariance matrix of the input state to estimate a symplectic matrix S which diagonalizes the covariance matrix. Here, one can use either homodyne or heterodyne for covariance matrix estimation. Based on S, we apply a Gaussian unitary to reduce the input GE state to a zero-mean passive-separable state, which then can be sample-efficiently learned via the algorithm sketched in Fig. 3. The details can be found in Supplemental Note 7.

Towards efficient learning of mixed GE states

In practice, preparing ideal pure GE states may be infeasible. Noise, loss, and decoherence can lead to mixed states, in which case the counter-rotation step may fail to map it to a passive separable form. Nevertheless, we find that some specific mixed GE states remain learnable via GDE tomography, with sample complexity polynomial in the number of modes.

First, we demonstrate that our GDE learning algorithm is robust against small perturbations caused by general (potentially non-Gaussian) noise. Even if the unknown state is a slightly perturbed GE state—technically, a state constructed by sending an input state, which is ϵinput-close to a pure product state, into a channel, which is ϵchannel-close to a Gaussian unitary—our GDE learning algorithm remains effective and tomography remains efficient. In “Methods”, we show that the corresponding estimation errors for moments have fixed floors of order \({{{\mathcal{O}}}}(\sqrt{{\epsilon }_{{{{\rm{channel}}}}}+{\epsilon }_{{{{\rm{input}}}}}})\) and \({{{\mathcal{O}}}}({\epsilon }_{{{{\rm{channel}}}}})+{{{\mathcal{O}}}}({\epsilon }_{{{{\rm{input}}}}}^{1/8})\) for the approximated passive-separable state after counter-rotation. If we assume that the input error ϵinput vanishes, we have the following theorem:

Theorem 3

Consider an approximated pure GE state \(\hat{\rho }\) acting on \({{{{\mathcal{H}}}}}_{m,E}^{2}\) whose entangling channel is ϵchannel-close to an arbitrary Gaussian unitary. The sample complexity of learning this class of state is

$$M\simeq {{{\mathcal{O}}}}\left({{{\rm{poly}}}}\left(m,E,\frac{1}{\epsilon -{\epsilon }_{{{{\rm{channel}}}}}},\log \left(\frac{1}{\delta }\right)\right)\right),$$
(6)

for an error ϵ > ϵchannel in trace distance and failure probability δ.

The inequality ϵ > ϵchannel arises because the measured state is known to be ϵchannel-close to the target, which induces an irreducible error floor for the estimators. A detailed discussion appears in Supplemental Note 8.

Second, we extend our discussion to GE states generated by applying a Gaussian unitary to a product of arbitrarily mixed states. In particular, this class includes the output of boson sampling under uniform photon loss and situations with detectors of equal efficiency. In the case where the symplectic eigenvalues of the input state has a finite eigengap Δ, only moment estimation, Gaussian unitary, and local tomography will be used. Then, the following corollary holds:

Corollary 4

(Sample complexity of states entangled by a Gaussian unitary): Consider the set of m-mode states \(\{\hat{\rho }\}\) obtained by applying a Gaussian unitary to a tensor product of single-mode states \({\bigotimes }_{j=1}^{m} \, {\hat{\rho }}_{j}\), subject to an energy-moment constraint \(\hat{\rho }\in {{{\rm{St}}}}({{{{\mathcal{H}}}}}_{m,E}^{2})\). Meanwhile, the states’ symplectic eigenvalues are non-degenerate, up to a finite eigen-gap Δ. The GDE protocol needs \(M\simeq {{{\mathcal{O}}}}({{{\rm{poly}}}}(m,E,{\Delta }^{-1},{\epsilon }^{-1},\log ({\delta }^{-1})))\) copies for this state family, for an error ϵ in trace distance and failure probability δ.

In Supplemental Note 8, we show that GDE protocol is able to achieve the sample complexity in Corollary 4, with local state tomography switched from fidelity witness in the pure-state case to heterodyne local tomography. The case of degenerate symplectic eigenvalues is not covered by the above Corollary. In Method, we show that there exist protocols relying on general measurements that in-principle guarantees sample-efficient learning of such degenerate states. Additionally, we provide a generalized GDE protocol with the hope of efficient learning such states with practical Gaussian operations, however, subject to an unproven conjecture.

Below, we apply Corollary 4 and Theorem 3 to practical experimental scenarios. In this regard, detector inefficiency is a ubiquitous and practically relevant imperfection that leads to mixed NGE states. Here, it can be modeled as ideal detection preceded by pure-loss channels. As uniform loss commutes with beam-splitters, it maps boson-sampling outputs to a passive Gaussian unitary acting on a product of mixed states. Consequently, Corollary 4 applies in the situation with non-degenerate symplectic eigenvalues, where both the sample and time complexity stay polynomial in the number of modes. For nonuniform loss, the degraded channel remains close to a Gaussian unitary in the low-loss regime. Thus, Lemma 11 in “Methods” guarantees a vanishing reconstruction error floor, and Theorem 3 shows that the sample complexity increases only polynomially with the degradation level.

To evaluate the performance of learning GE states, we numerically simulate the GDE tomography process for two-mode GE states with non-degenerate symplectic eigenvalues. As shown in Fig. 4, the GDE method, optimized over the copies allocated to estimating the mean vector and the covariance matrix (red and pink), achieves lower errors and markedly better scaling than direct tomography (black and gray)2. Details of the simulation are presented in Supplemental Note 7B.

Fig. 4: Performance of Gaussian-disentangling protocol (GDE) versus direct tomography (RρR).
Fig. 4: Performance of Gaussian-disentangling protocol (GDE) versus direct tomography (RρR).
Full size image

Here, we numerically simulate the quantum state tomography process on a two-mode GE state with the true state being number state \(| 0\left.\right\rangle \otimes | 1\left.\right\rangle\), cat state \({| {{{\rm{cat}}}}\left.\right\rangle }_{0.1}\otimes {| {{{\rm{cat}}}}\left.\right\rangle }_{1.1}\) and thermal state ρth,n=0.2 ρth,n=0.3 correlated by a beam-splitter (with a rotation angle θ = π/4). The error, defined as the trace distance between the true state and the reconstructed state obtained through direct tomography using the standard RρR algorithm2, is shown as a function of the number of copies M used in tomography (black squares for ideal case and grey stars for the lossy case). In the lossy case, pure loss channel (with a transmissivity ratio η = 0.9) is applied to both modes after the beam splitter. In contrast, the bottom envelope of achievable errors in the proposed Gaussian disentangling (GDE) algorithm, after minimising over possible sample number in estimating displacements and the covariance matrix, is given by red circles and pink triangles (lossy case). Their linear fit shows errors in GDE protocol decrease faster (with slope k) compared to RρR method in all the three different states, demonstrating the advantage of GDE method.

Non-Gaussian-entanglable states

While we have shown that GE states are efficiently learnable, we know that general quantum states are hard to learn7. This immediately indicates the existence of states that do not belong to the GE class defined in Eq. (1), which we refer to as NGE states. By definition, these states feature genuine non-Gaussian entanglement, which cannot be produced by Gaussian protocols. In practice, we show that NGE states can be produced by a multi-mode non-Gaussian unitary, or by a local non-Gaussian unitary acting on a non-trivial GE state. Furthermore, entanglement-breaking channels60, followed by Gaussian protocols, can destroy genuine non-Gaussian entanglement. Moreover, it can be quickly verified that a Gaussian unitary maps NGE states to NGE states (see Supplemental Note 3C).

From Theorem 1, we have an efficient protocol to identify pure NGE states (see “Methods”). As a result, we provide a few examples of NGE states (see Fig. 1), whose membership proofs can be found in Supplemental Note 4. Firstly, we prove that the NOON states \(| {{{\rm{NOON}}}}\left.\right\rangle \propto {| N\left.\right\rangle }_{A}{| 0\left.\right\rangle }_{B}+{| 0\left.\right\rangle }_{A}{| N\left.\right\rangle }_{B}\) are NGE for N > 2. This means that, aside from the trivial N = 1 case, the N = 2 case from the HOM effect is the only nontrivial instance of a beam-splitter generating NOON state—those with N > 2 cannot be generated deterministically by any Gaussian protocol acting on two-mode separable states, including linear optical operations. Note that, for this specific problem, previous approaches have only established such a no-go result for number state inputs in a linear optical setting18,19,20, where the photon number is preserved and therefore it suffices to disprove the case with two-mode Fock state. Our approach completes the general case by reducing general Gaussian unitaries to passive unitaries.

In addition, we show that the superposition of a TMSV state and a π-phase rotated TMSV state, \(| {\Psi }_{{{{\rm{sTMSV}}}}}\left.\right\rangle \propto | {\zeta }_{r,0}\left.\right\rangle+| {\zeta }_{r,\pi }\left.\right\rangle\) with r > 0, is also NGE. Such states are along the line of recent single-mode experiments generating non-classical superposition of Gaussian states in quantum systems with universal control61.

Resource measures of genuine non-Gaussian entanglement

To quantify genuine non-Gaussian entanglement, we further employ the quantum resource theory framework34, which has been successful in quantifying quantum entanglement, quantum coherence and quantum non-Gaussianity. Here, we model all GE states as free states. To be general and also to provide insight into multi-mode state learning, we consider the case of multi-partite GE states, with n partitions A = {A1,  , An}, and define the Hilbert space \({{{{\mathcal{H}}}}}_{{{{\boldsymbol{A}}}}}\) accordingly. On this account, Gaussian protocols are free operations as they map free states to free states (see Supplemental Note 3C). However, due to the multipartite nature of entanglement, the general quantification of genuine non-Gaussian entanglement faces similar challenges to the case of multipartite entanglement62.

To tackle this issue, we define the non-Gaussian entanglement entropy, abbreviated simply as the NG entropy (see Supplemental Note 5). Given an arbitrary n-partite pure state \({| \psi \left.\right\rangle }_{{{{\boldsymbol{A}}}}}\in {{{{\mathcal{H}}}}}_{{{{\boldsymbol{A}}}}}\), denote \({\hat{\rho }}_{{{{\boldsymbol{A}}}}}({\hat{U}}^{g})={\hat{U}}^{g}| \psi \left.\right\rangle \left\langle \right.\psi {| }_{{{{\boldsymbol{A}}}}}{\hat{U}}^{g{{\dagger}} }\) and its reduced state as \({\hat{\rho }}_{{A}_{j}}({\hat{U}}^{g})={{\mbox{Tr}}}_{k\ne j}[{\hat{\rho }}_{{{{\boldsymbol{A}}}}}({\hat{U}}^{g})]\); the NG entropy is defined as:

$${{{{\mathcal{E}}}}}_{{{{\rm{NG}}}}}(| \psi \left.\right\rangle {\left\langle \right.\psi | }_{{{{\boldsymbol{A}}}}})\equiv {\min }_{{\hat{{U}}^{g}\in {\mathbb{G}}{\mathbb{U}}}\left({{{{\mathcal{H}}}}}_{A}\right)}\frac{1}{n}\mathop{\sum}_{j=1}^{n}H\left({\hat{\rho }}_{{A}_{j}}({\hat{U}}^{g})\right),$$
(7)

with \(H(\hat{\rho })=-\,{\mbox{Tr}}\,[\hat{\rho } \, {\log }_{2} \, \hat{\rho }]\) being the von Neumann entropy of the state \(\hat{\rho }\). Here, we minimize over all Gaussian unitaries. Given an arbitrary pure GE state \(| \psi \left.\right\rangle\), the resource measure \({{{{\mathcal{E}}}}}_{{{{\rm{NG}}}}}\) satisfies the following criteria: (1) \({{{{\mathcal{E}}}}}_{{{{\rm{NG}}}}}(| \psi \left.\right\rangle \left\langle \right.\psi | )=0\) if and only if ψ is GE; (2) \({{{{\mathcal{E}}}}}_{{{{\rm{NG}}}}}(| \psi \left.\right\rangle \left\langle \right.\psi | )\) is invariant under Gaussian unitaries. A numerical evaluation of the NG entropy for pure NGE states is shown in Fig. 5. For operational purposes, we may also define a measure as the maximum overlap between a given pure state and an arbitrary pure GE state (see “Methods”). This measure distinctly separates GE and NGE states: it is zero for every pure GE state and non-zero for any NGE state, and invariant under Gaussian unitaries.

Fig. 5: Comparison between NG entropy and entanglement entropy.
Fig. 5: Comparison between NG entropy and entanglement entropy.
Full size image

The x-axis denotes the photon number, dashed lines indicate the entanglement entropy of the NOON state \(| \,{\mbox{NOON}}\,\left.\right\rangle\) and a superposition of two TMSV states \(| \,{\mbox{sTMSV}}\,\left.\right\rangle\), while the solid lines reflect their NG entropy.

As no single “golden unit” of multiparite entanglement exists due to the complex structure of multi-partite entanglement, we further introduce a vector resource measure to characterize multipartite genuine non-Gaussian entanglement. This resource measure is based on the number of ancillary modes necessary to make an NGE state GE: the GE cost defined below. To get a clearer picture, let us begin with a simple bi-partite system of two modes A and B. As shown in Fig. 6a, any NGE state \({\hat{\rho }}_{AB}\) can extended into a tri-partite state \({\hat{\rho }}_{AB}\otimes {\hat{\sigma }}_{C}\) by introducing an ancilla C. Meanwhile, this state is naturally a GE state between AC and B because it can be generated from a separable state \({\hat{\rho }}_{AC}\otimes {\hat{\sigma }}_{B}\) between AC and B via a fully transmissive beam-splitter, i.e., a Gaussian unitary operation swapping systems B and C. Likewise, for m single-mode subsystems, any NGE state can be produced by introducing an (m–1)—mode non-Gaussian ancillary state entangled with the first mode.

Fig. 6: Schematic of the state extension process.
Fig. 6: Schematic of the state extension process.
Full size image

a A bi-partite NGE state \({\hat{\rho }}_{AB}\) can be extended to a tri-partite GE state \({\hat{\rho }}_{AB}\otimes {\hat{\sigma }}_{C}\). b Young diagram representation of a multipartite case of six modes. The states of subsystems A1A2 and A3A4A5 are both NGE. By introducing the ancilla \({A}_{1}^{{\prime} }\) and \({A}_{3}^{{\prime} }\), the state is GE between \({A}_{1}{A}_{1}^{{\prime} }\), A2, \({A}_{3}{A}_{3}^{{\prime} }\), A4, A5 and A6. In addition, we can permute local systems to have a sorted column length and \({{{\mathcal{R}}}}(\psi )=({h}_{1},{h}_{2},0,0,0,0)\).

For simplicity of analysis, let us consider an n-mode state with n-partition, while the more general case can be found in Supplemental Note 6. The GE states are those generated by applying n-mode Gaussian protocols on a n-mode fully separable state. Then, the corresponding GE cost is given as follows:

Definition 5

(GE cost vector and GE cost function): Given an arbitrary n-mode density matrix ρ over \({{{{\mathcal{H}}}}}_{{{{\boldsymbol{A}}}}}\), a GE cost vector is defined as a list of ancillary-mode numbers in a decreasing order:

$${{{\mathcal{R}}}}(\rho )=\{| {A}_{1}^{{\prime} }|,\cdots \,,| {A}_{n}^{{\prime} }| \},\,\,(| {A}_{1}^{{\prime} }| \ge | {A}_{2}^{{\prime} }| \ge \cdots \ge | {A}_{n}^{{\prime} }| ),$$
(8)

of an extension ρext satisfying \(\rho :={{\mbox{Tr}}}_{{A}_{1}^{{\prime} },\cdots,{A}_{n}^{{\prime} }}[{\rho }_{{{{\rm{ext}}}}}]\), such that ρext is a GE state that can be obtained by applying a Gaussian protocol on a separable state between \({A}_{1}{A}_{1}^{{\prime} }\), \({A}_{2}{A}_{2}^{{\prime} },\ldots\) and \({A}_{n}{A}_{n}^{{\prime} }\). We will denote the k-th entry of \({{{\mathcal{R}}}}\) as \({{{{\mathcal{R}}}}}_{k}\) and the number of nonzero entries of \({{{\mathcal{R}}}}\) as .

The GE cost function is then defined as:

$${{{{\mathcal{R}}}}}_{f}(\rho )={\min }_{{\rho }_{{{{\rm{ext}}}}}}{{{{\mathcal{R}}}}}_{1}$$
(9)

where the minimization is taken over all possible GE extensions ρext of the original state ρ.

Figure 6b shows an example of six modes, where ancilla modes \({A}_{1}^{{\prime} }\) and \({A}_{3}^{{\prime} }\) are introduced to extend the state to a GE state. The definition of a GE cost vector is closely related to the concept of Young diagram, as it is connected to irreducible representations of the permutation group. Note that although we have introduced the extension procedure with swap operations, general Gaussian protocols can be applied.

Note that the GE cost vector is not unique, but the GE cost function is. Moreover, the GE cost function \({{{{\mathcal{R}}}}}_{f}\) (as well as the one-norm of the GE cost vector \(\parallel {{{\mathcal{R}}}}{\parallel }_{1}:={\min }_{{\rho }_{{{{\rm{ext}}}}}}{\sum }_{j=1}^{\ell }{{{{\mathcal{R}}}}}_{j}\)) are non-increasing under Gaussian protocols. In addition, the GE cost function \({{{{\mathcal{R}}}}}_{f}\) can also be bounded as \(\parallel {{{\mathcal{R}}}}{\parallel }_{1}/\ell \le {{{{\mathcal{R}}}}}_{f}\le \parallel {{{\mathcal{R}}}}{\parallel }_{1}\). In the next section, we will show that the GE cost function provides useful prior information for learning, as it guides how resources must be allocated in a tomography protocol.

Learning pure NGE states

The GE cost is operationally meaningful, as it directly connects to the generation procedure of an NGE state. Moreover, as the clear structure of entanglement indicates, the cost of learning NGE states can be quantified by the GE cost, as we show in the following. In particular, to leverage the Gaussian entangling procedure in defining the GE cost, we consider a learning algorithm based on the one for GE states, with the local states corresponding to the minimal subsystems of modes \(\{{{{{\mathcal{R}}}}}_{k}+1\}\) that cannot be further disentangled by any Gaussian unitary (see details on “generalized GE states” in Supplemental Note 7).

When the number of modes m is large, the sample complexity is shown in Proposition 14 in “Methods”, which is an exponential function of \(\mathop{\max }_{k}{{{{\mathcal{R}}}}}_{k}\). It is worth noting that, for any family of states, the GE cost plays the role of prior information that guides the choice between two strategies: (i) applying a counter-rotation followed by local tomography, or (ii) performing direct tomography on larger subspaces. The magnitude of the GE cost directly influences which strategy is preferable and, in turn, sets the overall sample complexity.

In general, one can have a tight scaling with respect to the GE cost for the non-degenerate scenario:

Theorem 6

(Sample complexity for non-degenerate case): Consider an energy-constrained m − mode pure state in \({{{{\mathcal{H}}}}}_{m,E}^{2}\), whose GE cost is specified by an l − element vector \({{{\mathcal{R}}}}\) and the function \({{{{\mathcal{R}}}}}_{f}\). Meanwhile, its covariance matrix has non-degenerate symplectic eigenvalues with an eigengap Δ. The required sample complexity for tomography is:

$$M={{{\rm{poly}}}}\left(\ell,E,\frac{1}{\Delta },\frac{1}{\epsilon },\log \frac{1}{\delta }\right)\cdot \Theta \left[{\left(\frac{E}{\epsilon }\right)}^{{{{{\mathcal{R}}}}}_{f}}\right]$$
(10)

where \({{{\rm{poly}}}}\left(\ell,E,\frac{1}{\epsilon },\log \frac{1}{\delta }\right)\) refers to a polynomial function of , E, the error ϵ in trace distance, and failure probability. Θ denotes the big theta notation.

A detailed proof of Theorem 6 can be found in Supplemental Note 7E. In particular, we prove that the exponent of E/ϵ in the upper bound achieved by our protocol matches that of the lower bound demonstrated in Proposition 14. However, a residual gap remains, scaling as \({\ell }^{2{{{{\mathcal{R}}}}}_{f}}\). Notably, the GE cost can be connected with the recently proposed t-doped bosonic Gaussian states7—states generated from unlimited multi-mode Gaussian unitaries and tκ-local non-Gaussian unitaries. Our results extend this class to the NGE class measured by the GE cost, and the tomography overhead is directly related to the GE cost. In particular, any t-doped state can be extended into a GE state with (κt–1) ancillary modes. From Theorem 6, the sample complexity of learning a GE state has an overhead ϵκt−2 as its GE cost vector is \({{{\mathcal{R}}}}=(\kappa t-1,0,\cdots )\).

Discussion

In this work, we have identified a quantitative relationship between the nature of quantum correlations in bosonic systems and the complexity of quantum tomography, uncovering the role of genuine non-Gaussian entanglement—entanglement which cannot be produced by Gaussian protocols.

We point out a few open problems. We have focused on pure states in the study of sample complexity in learning, while deferring the generalization to mixed state to future work. There, the disentangling procedure for Gaussian multi-mode channels is to be developed. Another open question is the quantification of the genuine non-Gaussian entanglement for measurement, which represents a dual problem within the resource theory of NGE states. In addition, an intriguing open question is how to design a tomography protocol whose time complexity-specifically, the number of search rounds required within each ϵ-covering net-scales polynomially with the number of modes, while preserving the already efficient sample complexity. Finally, asymptotic conversion rate between NGE states and generalization to fermionic systems are also of interest.

Method

Preliminary

An m-mode bosonic quantum system is completely specified by the statistical moments of its canonical quadrature operator vector \(\hat{{{{\boldsymbol{r}}}}}={[{\hat{q}}_{1},{\hat{p}}_{1},\cdots,{\hat{q}}_{m},{\hat{p}}_{m}]}^{{{{\rm{T}}}}}\). Its first and second moments are captured by the mean vector \({{{\boldsymbol{\xi }}}}:=\,{\mbox{Tr}}\,[\hat{{{{\boldsymbol{r}}}}}\hat{\rho }]\) and the covariance matrix \(V:=\frac{1}{2}\,{\mbox{Tr}}\,[\{(\hat{{{{\boldsymbol{r}}}}}-{{{\boldsymbol{\xi }}}}),{(\hat{{{{\boldsymbol{r}}}}}-{{{\boldsymbol{\xi }}}})}^{{{{\rm{T}}}}}\}\hat{\rho }]\)10,11. The first-moment changes are modeled by the displacement operation \({\hat{D}}_{{{{\boldsymbol{\xi }}}}}=\exp \left(-i{{{{\boldsymbol{\xi }}}}}^{T}\Omega \hat{{{{\boldsymbol{r}}}}}\right)\), where ξ = (ξ1,,ξ2m) denotes the vector of displacements and \(\Omega={\bigoplus }_{j=1}^{m}\left(\begin{array}{cc}0&1\\ -1&0\end{array}\right)\) refers to the symplectic form. Then, given an arbitrary operator \(\widehat{X}\), one can define the Wigner characteristic function \({\chi }_{\widehat{X}}({{{\boldsymbol{\xi }}}})=\, {{\mbox{Tr}}} \, [\widehat{X}{\hat{D}}_{{{{\boldsymbol{\xi }}}}}]\)11. For notational simplicity, we will let χkl(ξ) denote the characteristic function of the operator \(| k\left.\right\rangle \left\langle \right.\ell |\), where \(\{| k\left.\right\rangle,k=0,\cdots \,,\infty \}\) is the Fock basis.

A useful lemma for the proof of Theorem 1

The proof of Theorem 1 is based on the following lemma:

Lemma 7

(Generalizing Lemma 2 in ref. 52): The only states that remain pure under multi-mode pure loss are coherent states.

The detailed proof of this lemma is given in Supplemental Note 2.

Verification of NGE states

From Theorem 1, we have the following corollary for the identification of NGE states:

Corollary 8

(Verification of pure NGE states): Let \({| \psi \left.\right\rangle }_{AB}\) be a bi-partite pure state and let S be a symplectic matrix that diagonalizes its covariance matrix, and \({\hat{U}}_{S}^{g}\) be the corresponding Gaussian unitary. (1) If the symplectic eigenvalues are non-degenerate, and \({\hat{U}}_{S}^{g}{| \psi \left.\right\rangle }_{AB}\) is not a product state, then \({| \psi \left.\right\rangle }_{AB}\) is NGE. (2) If there is no beam-splitter network \({\hat{U}}_{O}^{g}\) with orthogonal O such that \({\hat{U}}_{O}^{g}{\hat{U}}_{{S}^{-1}}^{g}{| \psi \left.\right\rangle }_{AB}\) is a product state, then \({| \psi \left.\right\rangle }_{AB}\) is NGE.

Maximal fidelity in state preparation

Consider a specific partition of the Hilbert space \({{{{\mathcal{H}}}}}_{{{{\boldsymbol{A}}}}}={\otimes }_{j=1}^{n}{{{{\mathcal{H}}}}}_{{A}_{j}}\). Then, the maximal fidelity of preparing a pure state \({| \psi \left.\right\rangle }_{{{{\boldsymbol{A}}}}}\in {{{{\mathcal{H}}}}}_{{{{\boldsymbol{A}}}}}\) from any GE state \({| {\psi }^{{\prime} }\left.\right\rangle }_{{{{\boldsymbol{A}}}}}\in {{{{\mathcal{H}}}}}_{{{{\boldsymbol{A}}}}}\) can be obtained as follows:

$${{{{\mathcal{P}}}}}_{{{{\rm{NG}}}}}(| \psi \left.\right\rangle \left\langle \right.\psi {| }_{{{{\boldsymbol{A}}}}})=\mathop{\max }_{\begin{array}{c}{| \phi \left.\right\rangle }_{j}\in {{{{\mathcal{H}}}}}_{{A}_{j}}\\ \forall j=1,\cdots \,,n\\ {\hat{U}}^{g}\in {\mathbb{G}}{\mathbb{U}}({{{{\mathcal{H}}}}}_{{{{\boldsymbol{A}}}}})\end{array}}{\left| \left\langle \right.\psi {| }_{{{{\boldsymbol{A}}}}}{\hat{U}}^{g}{\bigotimes }_{j=1}^{n}| {\phi }_{j}\left.\right\rangle \right| }^{2}$$
(11)
$$\equiv {\max }_{{\hat{{U}}^{g}\in {\mathbb{G}}{\mathbb{U}}}({{{{\mathcal{H}}}}}_{{{{\boldsymbol{A}}}}})}{\left\Vert {\hat{U}}^{g{{\dagger}} }| \psi \left.\right\rangle \left\langle \right.\psi {| }_{{{{\boldsymbol{A}}}}}{\hat{U}}^{g}\right\Vert }_{\times },$$
(12)

where \({\parallel \cdot \parallel }_{\times }={\max }_{{{| \phi \rangle }_{j} \in {{{{\mathcal{H}}}}}_{{A}_{j}}} \atop {\forall j=1,\cdots,n}}{\bigotimes }_{j=1}^{n}\langle {\phi }_{j}| \cdot {\bigotimes }_{k=1}^{n}| {\phi }_{k}\rangle\) refers to the cross norm. Note that the cross norm can be bounded by the operator norm as \(\parallel \hat{X}{\parallel }_{\times }\le \parallel {\hat{X}}^{{T}_{{{{{\boldsymbol{A}}}}}_{0}}}{\parallel }_{\infty },({{{{\boldsymbol{A}}}}}_{0}\subset {{{\boldsymbol{A}}}})\), which can be computed efficiently.

Volume of the state space

A crucial step in the proofs of Theorem 2 and Proposition 14 is to show that Algorithm 2 in Supplemental Note 7A requires fidelity-witnesses on \(\exp \left({{{\mathcal{O}}}}\left[\,{\mbox{poly}}\,\left(m\right)\right]\right)\) passive-separable states, so that applying the union bound56 yields a polynomial sample complexity (see Supplemental Note 7C, D).

Intuitively, given that the state is known to lie within a specific class, the problem of determining how many states can be distinguished by tomography reduces to quantifying the amount of classical information required to specify any state in that class to within an error ϵ. The associated quantity can also be referred to as the state description complexity or volume of the state space, whose logarithm determines the number of classical bits required to transmit the information. More rigorously, the following definition is given:

Definition 9

(ϵ-covering net): Let \({{{\mathcal{S}}}}\) denote a set of m-mode pure states. Then, there exists a ϵ-covering net \({{{{\mathcal{S}}}}}_{{{{\rm{net}}}}}\subset {{{\mathcal{S}}}}\), such that for every \(| \psi \left.\right\rangle \in {{{\mathcal{S}}}}\), there exists \(| {\psi }^{{\prime} }\left.\right\rangle \in {{{{\mathcal{S}}}}}_{{{{\rm{net}}}}}\) satisfying \(\parallel\!| \psi \left.\right\rangle \left\langle \right.\psi | -| {\psi }^{{\prime} }\left.\right\rangle \left\langle \right.{\psi }^{{\prime} }| {\parallel }_{1}/2\le \epsilon\) where \(\parallel X{\parallel }_{1}=\scriptstyle\sqrt{\,{{\mbox{Tr}}} \,[{X}^{{{\dagger}} }X]}\) denotes the trace norm.

Thus, the number of target states that require certification in tomography -referred to as the ’volume’ of the state space -is determined by the cardinality of the corresponding ϵ-covering net. To visualize the upper bound, let us look at a more general case with GE states:

Corollary 10

(Volume of GE state space): Consider the set of m-mode pure GE states \(\{| \psi \left.\right\rangle \in {{{{\mathcal{H}}}}}_{m,E}^{1}\}\) produced by applying a Gaussian unitary on the tensor product of single-mode states. The size of the corresponding ϵ-covering net is bounded by:

$$\left\vert {{{{\mathcal{S}}}}}_{{{{\rm{ge,net}}}}}\right\vert \le \,\exp \left({{{\mathcal{O}}}}\left[{{{\rm{poly}}}}\left({m}^{3},E,\frac{1}{{\epsilon }^{2}}\right)\right]\right).$$
(13)

The proof of Corollary 10 is shown in Supplemental Note 7. In contrast, the size of ϵ-covering net for all pure states in \({{{{\mathcal{H}}}}}_{m,E}^{1}\) is lower bounded as \(\left\vert {{{{\mathcal{S}}}}}_{{{{\rm{e,net}}}}}\right\vert \ge \exp \left(\Theta \left[{\left(\frac{E}{12{\epsilon }^{2}}\right)}^{m}\right]\right)\)7.

In our algorithm, we propose local fidelity witnesses to approximate the global fidelity witness for passive-separable states (see Fig. 3). This requires slightly fewer observables than the “volume” of passive-separable states, which is already smaller than that of GE states in Eq. (13)—at the cost of a controllable global fidelity witness error (see Supplemental Note 7A for details).

In our discussion of mixed-state learning, we use an ϵ2-covering net of symplectic orthogonal matrices. Formally, let

$${{{{\mathcal{S}}}}}_{{{{\rm{net}}}},{O}^{{\prime} }}\subseteq {{{\rm{U}}}}(m)$$
(14)

be a set of 2 × 2m symplectic orthogonal matrices such that, for every symplectic orthogonal matrix O, there exists \({O}^{{\prime} }\in {{{{\mathcal{S}}}}}_{{{{\rm{net}}}},{O}^{{\prime} }}\) with \(| {O}_{jk}-{O}_{jk}^{{\prime} }| \le {\epsilon }_{2}\quad \forall \,j,k\in \{1,\ldots,2m\},\) where {Ojk} denotes the matrix elements of O.

A useful lemma for mixed GE-state learning

In the main text, we mention a continuity proof for the learning protocol for pure GE states. Although the details are presented in Supplemental Note 8 B, we present a crucial lemma here that may be of interest by itself.

First, the state of interest can be defined as follows:

$$\begin{array}{c}{\hat{\rho }}_{{{{\rm{mix}}}}}={{{{\mathcal{C}}}}}_{{{{\boldsymbol{A}}}}}\left({\bigotimes }_{j=1}^{m}{\hat{\rho }}_{j}\right)\\ \left\{\begin{array}{l}\frac{1}{2}{\min }_{{{{{\mathcal{U}}}}}_{{{{\boldsymbol{A}}}}}^{g}\in {\mathbb{G}}{\mathbb{U}}({{{{\mathcal{H}}}}}_{{{{\boldsymbol{A}}}}})}{\left\Vert {{{{\mathcal{C}}}}}_{{{{\boldsymbol{A}}}}}-{{{{\mathcal{U}}}}}_{{{{\boldsymbol{A}}}}}^{g}\right\Vert }_{\diamond }^{E,2}\le {\epsilon }_{{{{\rm{channel}}}}}\quad \\ \frac{1}{2}{\left\Vert {\bigotimes }_{j=1}^{m}{\hat{\rho }}_{j}-{\bigotimes }_{j=1}^{m}\left\vert {\psi }_{j}\right\rangle \left\langle {\psi }_{j}\right\vert \right\Vert }_{1}\le {\epsilon }_{{{{\rm{input}}}}}\quad \end{array}\right.,\end{array}$$
(15)

where \({{{\mathcal{C}}}}_{{{\boldsymbol{A}}}}\) is an arbitrary m-mode quantum channel acting on the subsystems {A1, …, Am}, \({{{\mathcal{U}}}}_{{{\boldsymbol{A}}}}^{g}(\cdot )={\hat{U}}^{g}\cdot {\hat{U}}^{g{\dagger} }\) refers to an arbitrary Gaussian unitary channel, \({\parallel {{{\mathcal{C}}}}_{{{\boldsymbol{A}}}}\parallel }_{\diamond }^{E,2}=\mathop{\sup }_{{| \Psi \left.\right\rangle }_{{{\boldsymbol{A}}}{{\boldsymbol{B}}}}\atop {{\mbox{Tr}}}_{{{\boldsymbol{B}}}}[| \Psi \left.\right\rangle \left\langle \right.\Psi {| }_{{{\boldsymbol{A}}}{{\boldsymbol{B}}}}]\in {{\rm{St}}}({{{\mathcal{H}}}}_{m,E}^{2})}{\left\Vert \left({{{\mathcal{C}}}}_{{{\boldsymbol{A}}}}\otimes {I}_{{{\boldsymbol{B}}}}\right)(| {\Psi }_{{{\boldsymbol{A}}}{{\boldsymbol{B}}}}\left.\right\rangle \left\langle \right.{\Psi }_{{{\boldsymbol{A}}}{{\boldsymbol{B}}}}| )\right\Vert }_{1}\) is the diamond norm with bounded second moment of input energy, \({\hat{\psi }}_{{{\rm{pure}}}}={\hat{U}}^{g}({\otimes }_{j=1}^{m}| {\psi }_{j}\left.\right\rangle \left\langle \right.{\psi }_{j}| ){\hat{U}}^{g{\dagger} }\) is the ideal state, and we have \({\hat{\rho }}_{{{\rm{mix}}}},{\hat{\psi }}_{{{\rm{pure}}}},{\otimes }_{j=1}^{m}{\hat{\rho }}_{j},{\otimes }_{j=1}^{m}| {\psi }_{j}\left.\right\rangle \left\langle \right.{\psi }_{j}| \in {{\rm{St}}}({{{\mathcal{H}}}}_{m,E}^{2})\). In the following, we denote ϵmix = ϵchannel + ϵinput as the total error.

Then, we have a lemma concerning all errors.

Lemma 11

Let \({\hat{\rho }}_{{{{\rm{mix}}}}}\) be an approximate GE state described by Eq. (15). The estimation errors of the GDE protocol, designed for pure states, obey

$$\epsilon \le f\left(\parallel {{{\boldsymbol{\xi }}}}-\tilde{{{{\boldsymbol{\xi }}}}}{\parallel }_{2},\parallel {V}_{{{{\rm{pure}}}}}-\widetilde{V}{\parallel }_{\infty }^{1/4}\right)+{\epsilon }_{{{{\rm{ps}}}}}^{{\prime} },$$
(16)
$$\parallel {{{\boldsymbol{\xi }}}}-\tilde{{{{\boldsymbol{\xi }}}}}{\parallel }_{2}\le 8\sqrt{E{\epsilon }_{{{{\rm{mix}}}}}}+\frac{{\epsilon }_{v}}{20\sqrt{mE}},$$
(17)
$$\parallel V-\widetilde{V}{\parallel }_{\infty }\le 40\sqrt{2}E\sqrt{{\epsilon }_{{{{\rm{mix}}}}}}+{\epsilon }_{v},$$
(18)
$${\epsilon }_{{{{\rm{ps}}}}}^{{\prime} }\le {\epsilon }_{{{{\rm{channel}}}}}+f\left(\parallel {{{\boldsymbol{\xi }}}}-\tilde{{{{\boldsymbol{\xi }}}}}{\parallel }_{2},\parallel {V}_{{{{\rm{pure}}}}}-\widetilde{V}{\parallel }_{\infty }^{1/4}\right)+{\epsilon }_{{{{\rm{ps}}}}},$$
(19)

where ϵ denotes the reconstruction error in tomography, ξ and \({V}_{{{{\rm{pure}}}}}\) denote the displacement and covariance matrix of the state \({\psi }_{{{{\rm{pure}}}}}\), \(f(\parallel {{{\boldsymbol{\xi }}}}-\tilde{{{{\boldsymbol{\xi }}}}}{\parallel }_{2},\parallel {V}_{{{{\rm{pure}}}}}-\widetilde{V}{\parallel }_{\infty }^{1/4})={{{\mathcal{O}}}}(\parallel {{{\boldsymbol{\xi }}}}-\tilde{{{{\boldsymbol{\xi }}}}}{\parallel }_{2})+{{{\mathcal{O}}}}(\parallel {V}_{{{{\rm{pure}}}}}-\widetilde{V}{\parallel }_{\infty }^{1/4})\) is the error of estimating moments, the first terms in Eqs. (17)–(19) constitute a fixed error floor, the second terms of Eqs. (17) and (18) give the errors for an ideal pure input, \({\epsilon }_{{{{\rm{ps}}}}}^{{\prime} }\) is the error of estimating the approximated passive separable state after counter-rotation based on estimating moments, ϵps denotes the corresponding error where we have an ideal pure GE state.

In this regard, the GDE learning protocol remains robust provided that the approximation errors ϵchannel and ϵinput vanish. When the input error ϵinput vanishes, we have Theorem 3 in the main text. A detailed derivation of Lemma 11 is shown in Supplemental Note 8.

Learning degenerate mixed GE states

To go beyond Corollary 4 which only addresses the non-degenerate case, we begin with a complexity upper bound that guarantee efficiency, achieved by general joint measurements.

Theorem 12

(Application of Theorem 1.5 in ref. 63): Consider the set of m-mode states \(\{\hat{\rho }\}\) obtained by applying a Gaussian unitary to a tensor product of single-mode states \({\bigotimes }_{j=1}^{m} \, {\hat{\rho }}_{j}\), subject to an energy-moment constraint \(\hat{\rho }\in {{{\rm{St}}}}({{{{\mathcal{H}}}}}_{m,E}^{2})\). There exists an tomography algorithm for this class of states that achieves the sample complexity \(M={{{\mathcal{O}}}}\left({{{\rm{poly}}}}\left(m,{E}_{{{{\rm{II}}}}},\frac{1}{\epsilon },\log \left(\frac{1}{\delta }\right)\right)\right)\).

A concrete proof of Theorem 12 is shown in Supplemental Note 8. In general, Theorem 12 implies the existence of an efficient learning algorithm for mixed Gaussian-unitary-entanglable states, possibly using non-Gaussian joint measurements. Whether homodyne or heterodyne measurements with classical postprocessing suffice remains open and is left to future work.

In this regard, we propose in Supplemental Note 8 a generalized-GDE tomography protocol for arbitrary mixed states entangled by a Gaussian unitary. The protocol reduces back to the GDE protocol for the non-degenerate case (and thus efficient); for the degenerate case, the protocol is efficient up to an unproven conjecture. In the following, we briefly summarize the generalized GDE protocol.

The first few steps of generalized-GDE are identical to the GDE protocol, where we estimate the covariance matrix and then perform the disentangling Gaussian unitary. When the symplectic eigenvalues are non-degenerate, we would conclude with the local tomography as in Corollary 4. If the symplectic eigenvalues are degenerate, then we continue with the next step of generalized-GDE. We classically build an ϵ-covering net of all 2m × 2m symplectic orthogonal matrices, so that for any O there exists \({O}^{{\prime} }\) in the net with entrywise deviation at most ϵ2. For each \({O}^{{\prime} }\) in the net \({{{{\mathcal{S}}}}}_{{{{\rm{net}}}},{O}^{{\prime} }}\), we reconstruct \({\widetilde{\rho }}_{{{{\rm{ps}}}},{O}^{{\prime} }}={\hat{U}}_{{O}^{{\prime} }}\left[{\bigotimes }_{j=1}^{m}{\hat{\rho }}_{j,{O}^{{\prime} }}\right]{\hat{U}}_{{O}^{{\prime} }}^{{{\dagger}} }\), where \({\hat{\rho }}_{j,{O}^{{\prime} }}\) is the reconstructed reduced state from heterodyne measurement in Eq. (4). To precisely obtain all of these reconstructed states, we can build up \(L\propto m{(1/{\epsilon }_{2})}^{4{m}^{2}}\) local observables and rely on shadow tomography56 to estimate them from heterodyne data on \({{{\mathcal{O}}}}(\log L) \sim {{{\mathcal{O}}}}(\,{\mbox{poly}}\,(m))\) copies.

For each of the \({\widetilde{\rho }}_{{{{\rm{ps}}}},{O}^{{\prime} }}\), we perform a reduced-state test, which is the replacement of fidelity witness that only works for pure states. In this test, we apply virtual passive rotations \({\hat{U}}_{{O}_{f}}^{{{\dagger}} }\) classically, compute reduced states of \({\hat{U}}_{{O}_{f}}^{{{\dagger}} }{\widetilde{\rho }}_{{{{\rm{ps}}}},{O}^{{\prime} }}{\hat{U}}_{{O}_{f}}\), and compare them with the locally learned \({\hat{\rho }}_{j,{O}_{f}}\) in Eq. (4). In principle, scanning Of U(m) determines whether \({O}^{{\prime} }\) is correct. In this regard, we have the following Lemma 13.

Lemma 13

Given two arbitrary m-mode states \({\hat{\rho }}_{1}\) and \({\hat{\rho }}_{2}\) that satisfy the following condition:

$${{\mbox{Tr}}}_{{j}^{{\prime} }\ne j\atop {j}^{{\prime} }=1,\cdots,m} \left[{\hat{U}}_{{O}_{f}}^{{{\dagger}} }\,{\hat{\rho }}_{1}\,{\hat{U}}_{{O}_{f}}\right]\equiv {{\mbox{Tr}}}_{{j}^{{\prime} }\ne j \atop {j}^{{\prime} }=1,\cdots,m}\left[{\hat{U}}_{{O}_{f}}^{{{\dagger}} }\,{\hat{\rho }}_{2}\,{\hat{U}}_{{O}_{f}}\right],\\ (\forall j=1,\cdots \,,m;\forall {O}_{f}\in {{{\rm{U}}}}(m)),$$
(20)

where U(m) denotes the set of all symplectic orthogonal matrices corresponding to arbitrary m-mode passive Gaussian operations. Then, we have:

$${\hat{\rho }}_{1}\equiv {\hat{\rho }}_{2}.$$
(21)

The concrete proof of Lemma 13 is shown in Supplemental Note 8.

Note that Lemma 13 requires checking all passive transforms with Of U(m); however, we only have access to the reconstructed reduced states in the r.h.s. of Eq. (20) following a search over all possible \({O}_{f}\in {{{{\mathcal{S}}}}}_{{{{\rm{net}}}},{O}^{{\prime} }}\) from the early steps of the generalized GDE protocol. Nevertheless, as \({O}^{{\prime} }\) has only m2 independent parameters, we conjecture that going over the Of’s among \({{{{\mathcal{S}}}}}_{{{{\rm{net}}}},{O}^{{\prime} }}\) in Eq. (14) is sufficient for guaranteeing small errors in the local reduced-state test. This conjecture is subject to future study.

Learning states with the same GE cost

Regarding the states with the same GE cost, we have the following proposition:

Proposition 14

(Sample complexity of NGE states): Consider the set of m-mode pure states \({{{{\mathcal{H}}}}}_{m,E}^{2}\) with a GE cost vector \({{{\mathcal{R}}}}={({{{{\mathcal{R}}}}}_{1},\cdots,{{{{\mathcal{R}}}}}_{\ell })}^{T}\) satisfying \({{{{\mathcal{R}}}}}_{f} > 7\). Then, the tomography of such states will take M copies that satisfy:

$$M\ge \Theta \left[\frac{1-\delta }{m\log E}{\left(\frac{E}{\epsilon }\right)}^{{{{{\mathcal{R}}}}}_{f}+1}\right],$$
(22)
$$M \le {{{\mathcal{O}}}}\left[\,{{\mbox{poly}}} \,\left({\ell }^{5{{{{\mathcal{R}}}}}_{f}+9},{E}^{2{{{{\mathcal{R}}}}}_{f}+3},\right.\right. \\ \left.\left.{\left(\frac{1}{\epsilon }\right)}^{2{{{{\mathcal{R}}}}}_{f}+6},\log \frac{1}{\delta },{3}^{2{{{{\mathcal{R}}}}}_{f}+2}\right)\right]$$
(23)

where δ denotes the failure probability and ϵ refers to the trace distance between the input and the reconstructed state. Note that we have \(\ell={{{\mathcal{O}}}}(m)\) by definition.

A detailed proof of Proposition 14 is shown in Supplemental Note 7 C. In addition, it is shown that the sample-complexity scaling is dominated by covariance-matrix estimation when \({{{{\mathcal{R}}}}}_{f}\) is small (e.g., \({{{{\mathcal{R}}}}}_{f}\le 7\)).

Connection to universality

To produce multi-mode non-Gaussian states, a general approach is to enable inline multi-mode non-Gaussian interactions, which is challenging especially in a network setting. Despite the universality50 reduction of such interactions into Gaussian operations and single-mode non-Gaussian gates, the required concatenation of inline single-mode non-Gaussian gates and multiple rounds of Gaussian operations remains a conundrum for experimental realization. In this regard, it is intriguing to consider the class of GE states generated from a single round of multi-mode Gaussian interaction from separable local non-Gaussian states. Avoiding the most challenging inline non-Gaussian gates, GE states are more experimentally friendly.

Related works

So far, various attempts have been made to understand the interplay between entanglement and non-Gaussianity. From the perspective of measurement design, the paradigmatic boson sampling protocol64 employs passive Gaussian operations and single-photon detectors, demonstrating the potential for scalable photonic quantum computing. More recently, a state-driven resource theory about non-Gaussian correlation has been proposed in ref. 65. Nevertheless, this resource theory is non-convex, hence being operationally constrained. Further, refs. 54,66,67,68 consider non-Gaussian entanglement based upon whether a state can be mapped to a separable state via a beam-splitter network. In addition to advancing the understanding of GE states, there are also investigations into the implementation of non-Gaussian operations on Gaussian entangled states69,70. Lastly, ref. 71 focuses on non-Gaussian entanglement in light-atom interactions and the formulation and resource theory of genuine non-Gaussian entanglement is not studied.