Yuan Gao of First Principle Science and Gerardo Adesso of Algorithmiq S.r.L. and University of Nottingham have calculated the entanglement cost for any Gaussian quantum channel. Their work demonstrates that for any finite number of modes, entanglement of formation, Gaussian entanglement of formation, and entanglement cost are mathematically equivalent for bipartite Gaussian states.
The researchers also determined the classical capacity of these multimode channels is achieved using pure Gaussian signals with Gaussian displacement modulation, independently across channel uses. These calculations reduce to Gaussian covariance optimizations. They further obtained a closed formula for the entanglement cost of a family of four-mode bound entangled states.
Gaussian States Define Entanglement Cost for Bipartite Systems
and University of Nottingham, is surprising given that these measures typically diverge for more complex quantum states, and establishes a fundamental property of Gaussian systems. The work also establishes a lower bound for entanglement cost and formation for states that are not strictly Gaussian, but share the same covariance matrix, suggesting Gaussian states represent an efficient benchmark for quantifying entanglement in broader systems.
The researchers determined the classical capacity of multimode Gaussian channels, revealing how much information can be reliably transmitted through these channels under a mean energy constraint. “For every finite-energy Gaussian state on an arbitrary bipartition A:B, = = = G(V),” stated the researchers, highlighting the core mathematical relationship they established.
Geodesic Convexity and Relative Entropy Bound Entanglement
The mathematical relationship between entanglement cost and classical capacity in quantum channels relies on geodesic convexity and a relative-entropy inequality for quantum states. This approach builds upon earlier single-mode results, extending the analysis to encompass systems with any finite number of modes. The researchers combined geodesic convexity of entanglement for pure Gaussian states with a relative-entropy inequality for arbitrary states. Comparing quantum relative entropies of input and output states, and using a faithful Gaussian state simplifies the calculation.
The team’s method also relies on a candidate solution and a radius defining the distance of feasible pure states from that solution, expressed as a function of the maximum eigenvalue of a normalized target covariance matrix.
Entanglement of Formation Coincides Across Gaussian States
The researchers demonstrated this holds for states with any finite number of modes, a significant step toward scaling quantum technologies. Every finite-energy bipartite Gaussian state possessing a specific covariance matrix, denoted as V, will have an entanglement of formation and cost at least as high as G(V), a function of that covariance.
This provides a method for assessing entanglement even when dealing with more complex, non-Gaussian quantum systems, and measured quadrature moments provide a means to calculate this bound without assuming Gaussianity. The team’s approach uses a displacement operator, D(ξ), which when applied to a covariance matrix , adds to the overall covariance V.
Strong superadditivity is also proven, meaning the entanglement across a full system is at least the sum of the entanglement values for its disjointed parts. This property, alongside additivity on tensor products, provides a deeper understanding of how entanglement behaves when systems are combined. The team showed that independent local Gaussian shifts of ordinary covariance εI/2 create a state with a quantum covariance of V + εI, yielding a bound on entanglement formation. These results collectively refine the tools available for characterizing and optimizing quantum states and channels.
Strong Superadditivity of Gaussian Entanglement Measures
This finding establishes a fundamental property governing how entanglement scales in complex quantum systems, offering a new lower bound for entanglement even in non-Gaussian scenarios. The research demonstrates that measured quadrature moments, properties of quantum states, can be used to assess entanglement without assuming the state is Gaussian, broadening the scope of entanglement analysis. A relative-entropy inequality was instrumental in extending this principle to arbitrary pure states, while averaging over ensembles reveals that the resulting bounds depend solely on the covariance matrix.
This connection links the geometry of the covariance matrix to optimal state preparation, channel simulation and the limits of classical communication. “Gaussian states also minimize both entanglement of formation and entanglement cost at fixed covariance,” the paper states, highlighting the efficiency of Gaussian states in achieving minimal entanglement for a given covariance. This equivalence extends to tensor products, meaning entanglement adds predictably when combining independent quantum systems.
Entanglement Bounds Extend Beyond Gaussian States
Researchers demonstrated this by establishing that these measures coincide with a quantity, G(V), determined solely by the covariance matrix of the quantum state. This principle applies not only to Gaussian states but also provides a lower bound for non-Gaussian states sharing the same covariance matrix, offering a powerful tool for assessing entanglement even when the state is unknown.
A corollary of this work shows that a finite-support displacement distribution creates non-Gaussian states with entanglement of formation and cost equal to G(V). The proof establishes a quadratic lower bound on pure Gaussian entanglement, and demonstrates that a specific state, , minimizes the sum of entanglement and quadratic energy among all pure Gaussian states.
Entanglement Cost Determined for Multimode Gaussian Channels
This equivalence holds true for every finite-energy Gaussian state, with the common value determined by a quantity related to the covariance matrix. This allows researchers to assess the entanglement requirements of more complex quantum systems using the more easily calculated Gaussian baseline. The team demonstrated this by obtaining a lower bound through an entropy inequality, complementing existing frameworks for strongly superadditive measures. “For every multimode Gaussian channel Φ = (X,Y), = = sup_(s ≥ 1) = lim_(s → ∞)G(V_Φ(s)),” states the paper, outlining the core equation defining the entanglement cost.
Classical Capacity of Gaussian Channels Under Energy Constraint
The classical capacity of any multimode Gaussian channel is definitively determined with a mean energy constraint, a result extending beyond single-mode scenarios. This analysis allows for arbitrary coupling between modes within each channel use, a departure from earlier models that often restricted interactions. The team’s work establishes a maximum achievable rate for transmitting classical information through these channels, quantified by a function dependent on the channel’s covariance matrix and input energy.
A key finding centers on the establishment of a fixed-covariance bound, supported by a new entropy inequality, which complements existing frameworks for strongly superadditive measures. This means the calculated entanglement cost is a benchmark for assessing the resources needed for more complex quantum systems, even those not strictly Gaussian. The theorem, detailed in the paper, defines the classical capacity as the maximum of a function calculated across all valid covariance matrices under the energy constraint.
For a channel using m modes, the input Hamiltonian is defined by a quadratic form, and the allowed mean total photon number per channel use is constrained by the trace of the covariance matrix. Specifically, Theorem 6 states that the classical capacity is determined by maximizing a function dependent on the covariance matrix, with the total capacity for n uses being n times the single-use capacity.
“For every multimode Gaussian channel Φ, quadratic Hamiltonian H as above, and finite E ≥ , C(Φ,H,E) = max_(V ∈ V_H(E))f_Φ(V), = nC(Φ,H,E) (n ≥ 1),” the paper states. This provides a precise mathematical framework for understanding and optimizing classical communication through multimode Gaussian channels.
Gaussian Displacement Modulation Achieves Capacity
This achievement relies on Gaussian displacement modulation, applied independently for each use of the channel, and establishes a precise method for encoding data. This pairing allows for a rigorous determination of the maximum achievable data rate under given energy constraints.
The analysis further demonstrates that the average output entropy of any ensemble, where the average input has a specific covariance, is bounded by a quantity termed . This bound is achievable through Gaussian displacement modulation, confirming its effectiveness as an encoding strategy.
Quadrature Moments Provide Lower Bounds on Entanglement
This advancement allows for estimation of entanglement without requiring complete state tomography, extending previous two-mode applications to encompass arbitrary multimode bipartitions. A newly developed Python toolkit facilitates this analysis, accepting a covariance matrix and mode bipartition to search for optimal Gaussian preparation and evaluate upper and lower bounds on G(V). The toolkit’s structure replaces complex ensemble optimization with a finite matrix problem, streamlining calculations. The research establishes Gaussian extremality for entanglement preparation, meaning Gaussian states minimize both entanglement of formation and cost given identical second moments.
This principle allows for lower bounds on both entanglement quantifiers for non-Gaussian sources, determined solely from measured second moments. “Comparing these bounds with the entanglement of a feasible preparation quantifies the remaining optimization error,” the paper states, highlighting the toolkit’s ability to assess the accuracy of estimations. This approach offers a pathway toward quantifying entanglement in relevant multimode families and estimating resources when symmetry reductions are unavailable, furthering the ability to characterize quantum states.
See today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals.




