betaFeedback

WorksPhysics and Astronomy

Entanglement cost and classical capacity of multimode Gaussian states and channels

Abstract

Gaussian states and operations are central to continuous-variable quantum information and communication. For systems with any finite number of modes, we prove that entanglement of formation, Gaussian entanglement of formation, and entanglement cost coincide for every finite-energy bipartite Gaussian state. Their common value is strongly superadditive and lower-bounds entanglement of formation and entanglement cost for arbitrary non-Gaussian states with the same covariance matrix. We then determine the entanglement cost of every multimode Gaussian channel as well as its classical capacity under a mean energy constraint. These quantities reduce to Gaussian covariance optimizations, and the capacity is attained by pure Gaussian signals with Gaussian displacement modulation, independently across channel uses. The proof combines geodesic convexity of entanglement for pure Gaussian states with a relative-entropy inequality for arbitrary states. We also obtain a closed formula for the entanglement cost of a family of four-mode bound entangled states.

Introduction

Gaussian states and operations are central to continuous-variable quantum information, in which information is encoded in the quadratures of light and other bosonic systems [1]. In quantum optics, this framework encompasses coherent and squeezed light, optical interferometers, and Gaussian channels modeling loss, amplification, and thermal noise [2]. Gaussian states are completely specified by their first moments and covariance matrices, while Gaussian channels are specified by their action on these moments, giving a compact description even when many modes are correlated [3, 4].

This framework brings together a wealth of fundamental questions: on one hand, how much entanglement is required to prepare a shared state or simulate a channel, and on the other hand, what rates of classical communication can a channel support under an energy constraint? Answering these questions would require in principle a formidable optimization over arbitrary quantum protocols, including non-Gaussian states and correlations across many copies or channel uses.

For a shared Gaussian state, a simple preparation starts with a pure Gaussian state and adds correlated random displacements. The least entanglement required by such an ensemble is the Gaussian entanglement of formation EFGE_{\mathrm{F}}^{\mathrm{G}}: a minimum over pure covariance matrices lying below the target covariance [5]. The entanglement of formation EFE_{\mathrm{F}} instead minimizes the average entanglement over all pure-state decompositions [6], including possibly non-Gaussian ensembles, while the entanglement cost ECE_{\mathrm{C}} is the asymptotic entanglement consumed per copy under local operations and classical communication [7, 8]. The central questions are whether Gaussian ensembles are optimal for the entanglement of formation (Gaussian optimality) and whether preparing many copies jointly can or cannot reduce the cost per copy (additivity).

Gaussian optimality was established first for symmetric two-mode states [9]. The general two-mode problem subsequently prompted analytic proposals, bounds, and numerical methods [10–16]. Wilde established Gaussian optimality and additivity for states obtained by sending one mode of a two-mode squeezed vacuum through a quantum-limited attenuator or amplifier [17]. More recently, Adesso established both Gaussian optimality for every two-mode Gaussian state and additivity on tensor products of such states, using a many-pair entropy inequality valid for arbitrary correlated states [18]. Those results also extend to bisymmetric multimode states, whose entanglement can be concentrated onto a single pair of modes by local Gaussian unitaries [19].

In this work, we solve the problem in full generality for arbitrary bipartitions comprising any finite number of modes. For every finite-energy Gaussian state on such a multimode bipartition, we prove

EC(ρV)=EF(ρV)=EFG(ρV)=G(V).(1)E_{\mathrm{C}}(\rho_{V}) = E_{\mathrm{F}}(\rho_{V}) = E_{\mathrm{F}}^{\mathrm{G}}(\rho_{V}) = G(V). \tag*{(1)}

Here ρV\rho_{V} denotes the centered bipartite Gaussian state with covariance VV, and G(V)G(V) is the attained minimum over pure Gaussian preparations described above. We also prove strong superadditivity: the entanglement of formation and entanglement cost across the full bipartition are at least the sum of their values for reduced states on disjoint groups of Alice’s and Bob’s modes. Both quantities are additive on tensor products.

The result also provides entanglement bounds beyond Gaussian states. Every finite-energy state with covariance VV has entanglement of formation and entanglement cost at least G(V)G(V). Measured quadrature moments therefore give lower bounds on both quantities without any assumption of Gaussianity. We establish this fixed-covariance bound through a supporting entropy inequality, complementing the general Gaussian-extremality framework for strongly superadditive measures [20].

The theorem captured by Eq. (1) for states has two closely connected applications to channels. First, it determines the entanglement cost of every multimode Gaussian channel in the sequential setting of Wilde [17], where later inputs may depend on earlier outputs. Second, it determines the classical capacity of every multimode Gaussian channel under a mean energy constraint. This extends the recent single-mode result by Adesso, Lami, and Giovannetti [21]. For the capacity problem, the connection to state entanglement is provided by the identity between the minimum average output entropy at a fixed average input state and the entanglement of formation of the corresponding output–environment state in a dilation of the channel [22].

A common bound on pure-state entanglement underlies all three results. Geodesic convexity supplies the bound within the Gaussian family, expressed through the expectation of a quadratic Hamiltonian. A relative-entropy inequality establishes it for arbitrary pure states. After averaging over any preparation ensemble, the bound depends only on the covariance matrix, connecting the geometry to optimal state preparation, channel simulation, and classical communication.

The paper is organized as follows. Section II proves Gaussian optimality, strong superadditivity, and covariance bounds on the entanglement of arbitrary states. Sections III and IV determine the entanglement cost and classical capacity of Gaussian channels. Section V develops analytic state and channel examples and introduces the numerical toolkit, while Sec. VI summarizes our results and their broader implications. The Appendices contain auxiliary lemmas and technical parts of the proofs.

Entanglement of formation and cost of multimode Gaussian states

Preliminaries

We consider bosonic continuous-variable systems containing finitely many modes. For a system of kk modes, we collect the canonical quadrature operators in the vector R=(x1,p1,…,xk,pk)TR=(x_1,p_1,\ldots,x_k,p_k)^{\mathsf T}, where T\mathsf T denotes matrix transposition and †\dagger denotes the adjoint. Setting ℏ=1\hbar=1, their commutation relations read

[Rj,Rl]=i(Ωk)jl,Ωk=⨁j=1k(01−10).(2)[R_j,R_l]=\mathrm{i}(\Omega_k)_{jl},\qquad\Omega_k=\bigoplus_{j=1}^{k}\begin{pmatrix}0&1\\-1&0\end{pmatrix}. \tag*{(2)}

where Ωk\Omega_k is the standard symplectic form on the 2k2k-dimensional phase space; we omit its subscript when the number of modes is clear.

For a state ρ\rho with finite second moments, we write ⟨O⟩=Tr⁡(ρO)\langle O\rangle=\operatorname{Tr}(\rho O) and define its first-moment vector dd and covariance matrix VV by

d=⟨R⟩,Vjl=⟨{Rj−dj,Rl−dl}⟩.(3)d=\langle R\rangle,\qquad V_{jl}=\langle\{R_j-d_j,R_l-d_l\}\rangle. \tag*{(3)}

where {A,B}=AB+BA\{A,B\}=AB+BA denotes the anticommutator. This normalization assigns to the vacuum state the identity covariance I2kI_{2k}. Note that, relative to the convention in Ref. [18], here all quantum covariance matrices are doubled; the quadrature operators and first moments are unchanged.

A real symmetric matrix VV is a physical covariance matrix if and only if it satisfies the bona fide condition [23], which expresses the uncertainty principle:

V+iΩk≥0.(4)V+\mathrm{i}\Omega_k\ge0. \tag*{(4)}

A physical covariance matrix Γ\Gamma describes a pure Gaussian state precisely when

ΓΩkΓ=Ωk.(5)\Gamma\Omega_k\Gamma=\Omega_k. \tag*{(5)}

Equivalently, det⁡Γ=1\det\Gamma=1.

Every real symmetric positive-definite 2k×2k2k\times2k matrix VV admits a Williamson decomposition [23] [3],

V=ΞDΞT,D=⨁j=1kνjI2.(6)V=\Xi D\Xi^{\mathsf T},\qquad D=\bigoplus_{j=1}^{k}\nu_j I_2. \tag*{(6)}

where Ξ\Xi is real and symplectic, meaning ΞΩkΞT=Ωk\Xi\Omega_k\Xi^{\mathsf T}=\Omega_k, and the numbers νj>0\nu_j>0 are the symplectic eigenvalues of VV, equivalently the positive eigenvalues of iΩkV\mathrm{i}\Omega_kV. For a physical covariance matrix, the uncertainty relation (4) requires νj≥1\nu_j\ge1. For a Gaussian state, the normal modes with quadratures Ξ−1R\Xi^{-1}R are independent thermal modes up to displacement, with mean occupations (νj−1)/2(\nu_j-1)/2.

With natural logarithms, the von Neumann entropy is S(ρ)=−Tr⁡ρlog⁡ρS(\rho)=-\operatorname{Tr}\rho\log\rho and the Gaussian entropy is SG(V)=∑jg((νj−1)/2)S_G(V)=\sum_j g((\nu_j-1)/2), where

g(u)=(u+1)log⁡(u+1)−ulog⁡u,g(0)=0.(7)g(u)=(u+1)\log(u+1)-u\log u,\qquad g(0)=0. \tag*{(7)}

Let N=∑jaj†ajN=\sum_j a_j^\dagger a_j, with aj=(xj+ipj)/2a_j=(x_j+\mathrm{i}p_j)/\sqrt{2}, be the total photon-number operator. Its expectation is Tr⁡ρN=Tr⁡V/4+∥d∥2/2−k/2\operatorname{Tr}\rho N=\operatorname{Tr}V/4+\lVert d\rVert^2/2-k/2; finite energy means that this expectation value is finite. For the finite number of modes considered here, this also guarantees finite local entropies, which are continuous in trace norm on sets with a common mean energy bound [24, 25]. Throughout the paper, entanglement measures and rates are expressed in nats; division by log⁡2\log2 gives bits or ebits. The displacement operator D(ξ)=e−iξTΩRD(\xi)=e^{-\mathrm{i}\xi^{\mathsf T}\Omega R} obeys D(ξ)†RD(ξ)=R+ξD(\xi)^\dagger R D(\xi)=R+\xi. A classical random shift ξ\xi of ordinary covariance KξK_\xi therefore adds 2Kξ2K_\xi to VV.

The Gaussian entanglement of formation quantifies the least average entanglement required to prepare a bipartite Gaussian state from an ensemble of pure Gaussian states [5]. For a fixed bipartition A:BA:B, it admits the covariance characterization

EFG(ρV)=G(V),E_F^G(\rho_V)=G(V),

where

G(V)=min⁡Γ≤VΓ pure GaussianE(Γ),E(Γ)=SG(ΓA).(8)G(V)=\min_{\Gamma\le V\atop\Gamma\ \mathrm{pure\ Gaussian}}E(\Gamma),\qquad E(\Gamma)=S_G(\Gamma_A). \tag*{(8)}

Here the entanglement of a pure Gaussian state is the entropy of its reduced state on AA, with subscripts on states denoting reductions by partial trace and those on covariance matrices denoting the corresponding principal blocks.

The pure Gaussian covariance matrices satisfying Γ≤V\Gamma\le V form a compact set, so the minimum is attained by a covariance Γ∗\Gamma_*. The corresponding pure Gaussian state provides an explicit preparation of ρV\rho_V: applying displacements drawn from a centered Gaussian distribution with ordinary covariance $(V-\Gamma_*)/2 produces the target state. Since these displacements are local unitaries, every member of the ensemble has the same entanglement E(Γ∗)E(\Gamma_*), while a further fixed local displacement sets any desired first moments without changing GG.

For a general bipartite state, the entanglement of formation is the least average pure-state entanglement over all ensemble decompositions [6, 8],

EF(ρ)=inf⁡μ:∫∣ψ⟩⟨ψ∣dμ=ρ∫S(ψA)dμ(ψ).(9)E_{\mathrm{F}}(\rho)=\inf_{\mu:\int\lvert\psi\rangle\langle\psi\rvert d\mu=\rho}\int S(\psi_A)d\mu(\psi). \tag*{(9)}

Here ψA=Tr⁡B∣ψ⟩⟨ψ∣\psi_A=\operatorname{Tr}_B\lvert\psi\rangle\langle\psi\rvert, and the infimum ranges over probability measures on pure states whose average is ρ\rho, allowing both discrete and continuous ensembles [26]. When the bipartition needs to be explicit, we write EFA:B(ρ)E_{\mathrm{F}}^{A:B}(\rho) and GA:B(V)G^{A:B}(V).

The entanglement cost ECE_{\mathrm{C}} is the least asymptotic entanglement required per copy to prepare a state by local operations and classical communication (LOCC), allowing collective protocols with vanishing trace-distance error. For the finite-energy states considered here, it equals the regularized entanglement of formation [7, 8],

EC(ρ)=lim⁡n→∞EF(ρ⊗n)n.(10)E_{\mathrm{C}}(\rho)=\lim_{n\to\infty}\frac{E_{\mathrm{F}}(\rho^{\otimes n})}{n}. \tag*{(10)}

Main result

Theorem 1 (Optimality of multimode Gaussian entanglement). (a) For every finite-energy Gaussian state ρV\rho_V on an arbitrary bipartition A:BA:B,

EC(ρV)=EF(ρV)=EFG(ρV)=G(V).E_{\mathrm{C}}(\rho_V)=E_{\mathrm{F}}(\rho_V)=E_{\mathrm{F}}^{\mathrm{G}}(\rho_V)=G(V).

(b) For any disjoint mode groups Aj⊆AA_j\subseteq A and Bj⊆BB_j\subseteq B, the common value satisfies strong superadditivity,

GA:B(V)≥∑jGAj:Bj(VAjBj).(11)G^{A:B}(V)\ge\sum_j G^{A_j:B_j}(V_{A_jB_j}). \tag*{(11)}

and it is additive on finite tensor products of bipartite Gaussian states.

(c) Gaussian states also minimize both entanglement of formation and entanglement cost at fixed covariance: every finite-energy state ρ\rho with covariance VV satisfies

EF(ρ)≥G(V),EC(ρ)≥G(V).(12)E_{\mathrm{F}}(\rho)\ge G(V),\qquad E_{\mathrm{C}}(\rho)\ge G(V). \tag*{(12)}

Proof of Theorem 1. The following four subsections develop the proof, beginning with strong superadditivity and additivity for the covariance minimum GG in part (b). Its convexity then provides a quadratic lower bound on pure Gaussian entanglement, which we extend to arbitrary pure states through a relative-entropy inequality. Averaging over ensembles gives Gaussian optimality and the fixed-covariance bound for entanglement of formation, while regularization gives the corresponding statements for entanglement cost in parts (a) and (c).

Geometry of pure Gaussian preparations

To compare pure Gaussian preparations, we use paths that preserve both purity and the covariance constraint. For positive-definite matrices XX, YY and 0≤t≤10\le t\le1, the weighted geometric mean is

X#tY=X1/2(X−1/2YX−1/2)tX1/2.(13)X\#_tY=X^{1/2}(X^{-1/2}YX^{-1/2})^tX^{1/2}. \tag*{(13)}

We abbreviate the midpoint as X#Y:=X#1/2YX\#Y:=X\#_{1/2}Y. The mean is covariant under congruences, jointly monotone in its arguments, and bounded above by the arithmetic mean [27, 28]. Pure covariances are positive symplectic matrices: their positive powers and symplectic congruences preserve purity. Consequently Γ0#tΓ1\Gamma_0\#_t\Gamma_1 is pure whenever its endpoints are pure. Monotonicity also preserves the constraint Γ≤V\Gamma\le V.

The Williamson decomposition (6) supplies a pure Gaussian covariance ΞΞT≤V\Xi\Xi^{\mathsf{T}}\le V, since Ξ\Xi is symplectic and D≥I2kD\ge I_{2k}. If L=λmax⁡(V)L=\lambda_{\max}(V), every feasible pure covariance obeys

L−1I≤Γ≤LI,Γ−1≤ΩΓΩT.(14)L^{-1}I\le\Gamma\le LI,\qquad\Gamma^{-1}\le\Omega\Gamma\Omega^{\mathsf{T}}. \tag*{(14)}

The purity equation and upper constraint are closed on this compact positive interval, proving attainment of GG. The same argument gives the one-sided continuity

G(V+D)⟶G(V)as D≥0, ∥D∥⟶0.(15)G(V+D)\longrightarrow G(V)\quad\text{as }D\ge0,\ \lVert D\rVert\longrightarrow0. \tag*{(15)}

References

  1. [21]Adesso, Lami, and Giovannetti established additivity and the resulting classical capacity [21].
  2. [22]K. Matsumoto, T. Shimono, and A. Winter, Remarks on additivity of the Holevo channel capacity and of the entanglement of formation, Commun. Math. Phys. 246, 427 (2004).DOI
  3. [23]R. Simon, N. Mukunda, and B. Dutta, Quantum-noise matrix for multimode systems: U(n) invariance, squeezing, and normal forms, Phys. Rev. A 49, 1567 (1994).pubmed.ncbi.nlm.nih.gov/9910403
  4. [24]J. Eisert, C. Simon, and M. B. Plenio, On the quantification of entanglement in infinite-dimensional quantum systems, J. Phys. A: Math. Gen. 35, 3911 (2002).DOI
  5. [25]A. Winter, Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints, Commun. Math. Phys. 347, 291 (2016).DOI
  6. [26]Holevo, A. S., Shirokov, M. E., & Werner, R. F. (2005). On the notion of entanglement in hilbert spaces. Russian Math. Surveys, 60, 359.
  7. [27]L. Lami, C. Hirche, G. Adesso, and A. Winter, From log-determinant inequalities to Gaussian entanglement via recoverability theory, IEEE Trans. Inf. Theory 63, 7553 (2017).DOI
  8. [28]L. Lami, A. Serafini, and G. Adesso, Gaussian entanglement revisited, New J. Phys. 20, 023030 (2018).DOI
  9. [29]A. Botero and B. Reznik, Modewise entanglement of Gaussian states, Phys. Rev. A 67, 052311 (2003).DOI
  10. [30]OpenAI. (2026). The entropy photon-number inequality. In OpenAI Math Release preprint.
  11. [31]S. Pirandola, R. Laurenza, C. Ottaviani, and L. Banchi, Fundamental limits of repeaterless quantum communications, Nat. Commun. 8, 15043 (2017).DOI
  12. [32]M. M. Wilde, M. Tomamichel, and M. Berta, Converse bounds for private communication over quantum channels, IEEE Trans. Inf. Theory 63, 1792 (2017).DOI
  13. [33]Caruso, F., Eisert, J., Giovannetti, V., & Holevo, A. S. (2008). Multimode bosonic Gaussian channels. New J. Phys., 10, 083030.
  14. [34]M. Berta, F. G. S. L. Brandão, M. Christandl, and S. Wehner, Entanglement cost of quantum channels, IEEE Trans. Inf. Theory 59, 6779 (2013).DOI
  15. [35]S. L. Braunstein and H. J. Kimble, Teleportation of continuous quantum variables, Phys. Rev. Lett. 80, 869 (1998).DOI
  16. [36]M. M. Wilde, Strong and uniform convergence in the teleportation simulation of bosonic Gaussian channels, Phys. Rev. A 97, 062305 (2018).DOI
  17. [37]S. Pirandola, R. Laurenza, and S. L. Braunstein, Teleportation simulation of bosonic Gaussian channels: strong and uniform convergence, Eur. Phys. J. D 72, 162 (2018).DOI
  18. [38]H. K. Mishra and M. M. Wilde, Gaussian entanglement and quantum communication: geodesic optimization and multimode bounds (2026), arXiv:2610.18827v1 [quant-ph].arXiv
  19. [39]Finite-energy teleportation simulations for single-mode phase-insensitive channels were developed in Refs. [39, 40].
  20. [40]Finite-energy teleportation simulations for single-mode phase-insensitive channels were developed in Refs. [39, 40].
  21. [41]used to bound private communication in Refs. [41, 42].
  22. [42]used to bound private communication in Refs. [41, 42].
  23. [43]under phase-invariant quadratic energy constraints [43, 44].
  24. [44]under phase-invariant quadratic energy constraints [43, 44].
  25. [45]Ji established Gaussian optimality in the single-use Holevo information [45].
  26. [46]the output Holevo information is [46]
  27. [47]with sums replaced by integrals [47].
  28. [48]Gao, Y., & Adesso, G. (2026). Gaussian entanglement of formation: numerical toolkit. Zenodo.
  29. [49]M. Horodecki, P. Horodecki, and R. Horodecki, Mixed-state entanglement and distillation: Is there a “bound” entanglement in nature?, Phys. Rev. Lett. 80, 5239 (1998).DOI
  30. [50]R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Quantum entanglement, Rev. Mod. Phys. 81, 865 (2009).DOI
  31. [51]R. F. Werner and M. M. Wolf, Bound entangled Gaussian states, Phys. Rev. Lett. 86, 3658 (2001).pubmed.ncbi.nlm.nih.gov/11328047
  32. [52]J. DiGuglielmo, A. Samblowski, B. Hage, C. Pineda, J. Eisert, and R. Schnabel, Experimental Unconditional Preparation and Detection of a Continuous Bound Entangled State of Light, Phys. Rev. Lett. 107, 240503 (2011).pubmed.ncbi.nlm.nih.gov/22242981
  33. [53]X. Y. Chen, M. Miao, R. Yin, and J. Yuan, Bosonic Gaussian channel and Gaussian witness entanglement criterion of continuous variables, Phys. Rev. Research 5, 033066 (2023).DOI
  34. [54]Schuchkin, E., & van Loock, P. (2026). Revisiting Gaussian genuine entanglement witnesses with modern software. Phys. Rev. Research, 8, 023124.
  35. [55]G. Singh, S. Roy, and Arvind, Noisy dynamics of Gaussian entanglement: A transient bound entangled phase before separability, Phys. Rev. A 112, 052424 (2025).DOI
  36. [56]P. Horodecki, J. A. Smolin, B. M. Terhal, and A. V. Thapliyal, Rank two bipartite bound entangled states do not exist, Theor. Comput. Sci. 292, 589 (2003).DOI
  37. [57]C. Lupo, O. V. Pilyavets, and S. Mancini, Capacities of lossy bosonic channel with correlated noise, New J. Phys. 11, 063023 (2009).DOI
  38. [58]B. Windt, A. Jahn, J. Eisert, and L. Hackl, Local optimization on pure Gaussian state manifolds, SciPost Phys. 10, 066 (2021).DOI
  39. [59]Gao, B., & Kloc, K. (2026). Finite Gaussian assistance protocols and a conic metric for extremizing spacelike vacuum entanglement. Phys. Rev. A, 113, 012430.
  40. [60]Krüger, O., & Werner, R. F. (2005). Some open problems in quantum information theory. arXiv:quant-ph/0504166
  41. [61]Shor, P. W. (2004). Equivalence of additive questions in quantum information theory. Commun. Math. Phys., 246, 453.
  42. [62]M. B. Hastings, Superadditivity of communication capacity using entangled inputs, Nat. Phys. 5, 255 (2009).DOI
  43. [63]M. Walschaers, Non-Gaussian Quantum States and Where to Find Them, PRX Quantum 2, 030204 (2021).DOI
  44. [64]G. Gwak, C. Roh, Y.-D. Yoon, M. S. Kim, and Y.-S. Ra, Completely characterizing multimode second-order nonlinear optical quantum processes, Nat. Photonics 20, 156 (2026).DOI
  45. [65]M. Takeoka and S. Guha, Capacity of optical communication in loss and noise with general quantum Gaussian receivers, Phys. Rev. A 89, 042309 (2014).DOI
  46. [66]Cui, C., Postolwaite, J., Saif, B. N., Fan, L., & Guha, S. (2025). Super-additive communication with the green machine as a practical demonstration of nonlocality without entanglement. Nat. Commun., 16, 3760.
  47. [67]Gao, Y. (2026). The geometry of Gaussian entanglement of formation. arXiv:2610.01476v1
  48. [68]Gao, Y. (n.d.). Gaussian optimality of multimode entanglement of for.
  49. [69]Z. He, A universal energy–entanglement capacity frontier for Gaussian optical channels, Zenodo (2026), version 1, 19 October 2026.DOI
  50. [70]M. Berta, D. Sutter, and M. Walter, Quantum Brascamp–Lieb dualities, Commun. Math. Phys. 401, 1807 (2023).DOI
  51. [71]A. Lesniewski and M. B. Ruskai, Monotone Riemannian metrics and relative entropy on noncommutative probability spaces, J. Math. Phys. 40, 5702 (1999).DOI
  52. [72]M. Nussbaum and A. Szkoła, The Chernoff lower bound for symmetric quantum hypothesis testing, Ann. Statist. 37, 1040 (2009).DOI

Paper details

vlnc:W_747zk9ca
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 2

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Artificial intelligence tools

View statement
Looking for related papers…
Contents