{'fraction_non_alphanumeric': 0.04605610678849311, 'fraction_numerical': 0.009022771075737027, 'mean_word_length': 4.188592592592593, 'pattern_counts': {'":': 0, '<': 9, '<?xml version=': 0, '>': 19, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 18, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Infinite-Dimensional Programmable Quantum Processors

A universal programmable quantum processor uses program quantum states to apply an arbitrary quantum channel to an input state. We generalize the concept of a finite-dimensional programmable quantum processor to infinite dimension assuming an energy constraint on the input and output of the target quantum channels. By proving reductions to and from finite-dimensional processors, we obtain upper and lower bounds on the program dimension required to approximately implement energy-limited quantum channels. In particular, we consider the implementation of Gaussian channels. Due to their practical relevance, we investigate the resource requirements for gauge-covariant Gaussian channels. Additionally, we give upper and lower bounds on the program dimension of a processor implementing all Gaussian unitary channels. These lower bounds rely on a direct information-theoretic argument, based on the generalization from finite to infinite dimension of a certain replication lemma for unitaries.


I Introduction
A programmable quantum processor takes an input state and applies a quantum channel to it, controlled by a program state that contains all relevant information for the implementation. This concept, introduced by Nielsen and Chuang [1], is inspired by the von Neumann architecture of classical computers and universal Turing machines, which postulate a single device operating on data using a "program", which ultimately is just another kind of data. The main result of Ref. [1] is the No-Programming Theorem, stating that a universal programmable quantum processor, i.e., one capable of the implementation of any quantum channel exactly with finite program dimension, does not exist. If one relaxes the requirement to only approximate implementation, a trade-off between the accuracy of the implementation and the size of the program register occurs.
Exact and approximate quantum processors have been extensively studied, with respect to the required resources, which here are identified with the dimension of the program register. Many efforts have been made to obtain optimal scaling in different regimes. Recently, Yang et al. [2] closed the gap for the universal implementation of unitaries, providing essentially the optimal scaling of the program dimension and the accuracy for a given finite-dimensional Hilbert space on which the unitaries act.
Since infinite-dimensional (also known as continuous-variable) systems are fundamental in quantum theory, and are gaining more and more attention in quantum communication [3,4], quantum cryptography [5,6], and quantum computing [7][8][9], here we investigate programmable quantum processors for continuous-variable systems.
Results. In the present paper, we define programmable quantum processors with infinite-dimensional input and output, assuming an energy constraint. This means that we seek to approximately implement arbitrary energy-limited unitary quantum channels (which are those that map energy-bounded states to energy-bounded states) with finite program dimension, the accuracy of the implementation judged using the energyconstrained diamond norm [10,11] (cf. Refs. [12,13] for a closely related definition) as distance measure. After Definition 5, we argue the intrinsic necessity of both the use of the energy-constrained diamond norm and energy limitation of the channels.
Our first group of main results concerns the resource requirements, determining upper and lower bounds on the program dimension. We achieve this by relating the performance of infinite-dimensional approximate programmable quantum processors to that of their finite-dimensional counterparts in Theorems 9 and 10. In Theorem 9, we construct an infinite-dimensional programmable quantum processor assuming an existing finite-dimensional one whereas Theorem 10 states that a finite-dimensional programmable quantum processor can be constructed assuming an existing infinite-dimensional one. We establish thus a fundamental link between discrete and continuous quantum systems in the context of programmable quantum processors. These results allow us to import known upper and lower bounds on the program register from finite-dimensional processors. The upper bounds we obtain are summarized in Table 1 whereas the lower bounds can be found in Table 2.
The case of unitary channels, in the exact case covered by Nielsen and Chuang's No-Programming Theorem, was analyzed by Yang et al. [2] for the approximate implementation and using an information-theoretic approach. In Lemma 11 we generalize their central tool, the recycling of the program register to implement the same unitary multiple times, to infinite-dimensional unitaries and energy-constrained diamond norm approximation. To do so, we also introduce a multiply energy-constrained diamond norm with several simultaneous constraints rather than a single one, in Eq. (13). At the end of Section IV, we outline what Yang et al.'s information-theoretic lower bound strategy looks like in infinite dimension. The approach of lower bounding the program dimension by relating the Holevo information of program and (compressed) output ensembles is then used in the subsequent consideration of various classes of Gaussian Bosonic channels.
Looking beyond fully universal processors, we furthermore study the approximate implementation of energy-limited gauge-covariant Gaussian channels of a single Bosonic mode. Gauge-covariant channels play an important role physically, since they describe the consequences of attenuation of signals and addition of noise in communication schemes. Furthermore, they preserve the class of thermal Gaussian states [3]. Using -net con-structions, we provide upper bounds on the program dimension in Theorem 17, which diverge with the accuracy of implementation. Due to the energy limitation, our lower bounds for gauge-covariant channels rely only on lower bounds for the implementation of the attenuator channels and of the phase unitaries. The concrete bounds are stated in Theorems 18 for the phase unitaries and Theorem 19 for attenuators, the former diverging with the implementation accuracy.
Another case study is the universal implementation of energy-limited Gaussian unitaries of any finite number of Bosonic modes. We show that there exists an infinitedimensional programmable quantum processor whose program register can be upper bounded in terms of the approximation error in Theorem 20. The upper bound we obtain, using an -net construction, diverges as inverse polynomial in . Due to the phase unitaries treated earlier, we show that the program register of every inifinte-dimensional programmable quantum processor can be lower bounded by a term diverging with the inverse of in Theorem 21 with a different power, though.
Context. Nonuniversal programmable quantum processors, i.e., those implementing (either exactly or approximately) only a prescribed set of, rather than all, quantum channels between two given systems have occurred in various other contexts different from quantum computing, where channel simulation can help reduce the analysis of quantum channels to that of the corresponding program state(s). For example, the quantum and private capacities of a quantum channel, assisted by local operations and classical communication (LOCC), are the same as those of its Choi state, if the channel can be implemented by a processor built from LOCC elements with the Choi state as the program [13,14]. Similarly, if a family of channels can be implemented by the same processor using their Choi states as programs, adaptive strategies to distinguish or estimate the channels cannot be better than nonadaptive ones, for any finite number of channel uses and asymptotically, and in fact boil down to the much better-understood discrimination of the Choi states [12,15], see also Refs. [16,17].
Structure. In Section II we start by introducing basic notions for infinite-dimensional quantum information; in Section III we prove two reductions, first of an infinite-dimensional universal programmable quantum processor for energy-limited channels (unitaries) to a finite-dimensional one for arbitrary channels (unitaries), and second vice versa, and can thus import known program dimension bounds (upper and lower) from the finitedimensional world; in Section IV we prove that a processor implementing unitaries approximately can implement them repeatedly by reusing the same program successively, and sketch how this leads to information-theoretic lower bounds on program registers (cf. Yang et al. [2]); in Section V we turn our attention to quantum processors for gauge-covariant one-mode Gaussian channels, on the one hand, and multimode Gaussian unitaries on the other, proving upper and lower bounds on the program dimension in both settings; in Section VI we conclude, discussing future directions and open questions.
The set of quantum states, which we identify with density operators (positive semidefinite operators in T (H) with unit trace) is denoted D(H), and the subset of pure quantum states by D P (H). The set of all quantum channels is denoted CPTP(H 1 , H 2 ). A quantum channel is a completely positive (CP) and trace-preserving (TP) linear map (superoperator) Φ : T (H 1 ) → T (H 2 ) for separable Hilbert spaces H 1 and H 2 . It can equivalently be described by its adjoint map on the dual spaces of bounded operators, Φ * : B(H 2 ) → B(H 1 ), which is a completely positive and unit preserving (CPUP) map characterized uniquely by the duality relation Let H be a positive semidefinite Hamiltonian H ≥ 0 with discrete spectrum. We denote its spectral decomposition as H = ∞ n=0 e n P n , in the sense of the spectral theorem for unbounded self-adjoint operators, see Refs. [18,19]: it amounts to convergence of n e n φ|P n |φ to φ|H|φ for all |φ , |φ in the domain of H. We additionally assume finite degeneracy of all eigenvalues, i.e., dim P n < ∞ for all n (we call such Hamiltonians finitary). In the following, we always assume that 0 is the smallest eigenvalue of H (such Hamiltonians are called grounded ).
Throughout this paper, we consider energy constraints on the input and output, of the form tr ρH 1 ≤ E 1 and tr Φ(ρ)H 2 ≤ E 2 , respectively, where H 1 ≥ 0 is a finitary and grounded Hamiltonian as above (i.e., with discrete spectrum, smallest eigenvalue 0 and finite degeneracy of every eigenvalue) acting on H 1 , and H 2 ≥ 0 likewise on H 2 . Thus, let us define energy-limited quantum channels, which map energy-bounded states to energy-bounded states.
This can be expressed equivalently as Φ * (H 2 ) ≤ αH 1 + β1, using the adjoint cptp map Φ * : B(H 2 ) → B(H 1 ), which however has to be interpreted suitably, given that the adjoint map is a priori only defined on bounded operators and the same for the semidefinite operator order -see the following explanation.
Since we have the spectral decomposition of H 2 = ∞ 0 e dP (e), with the spectral measure dP on [0; ∞), we can define a positive operator-valued measure (POVM) dM on [0; ∞) by letting M (I) = Φ * (P (I)) for any measurable set I ⊂ [0; ∞), and let Φ * (H 2 ) = ∞ 0 e dM (e), assuming that there is a dense domain on which the convergence with respect to test vectors holds. Equivalently, we can consider the bounded operators H 2 (E) := E 0 e dP (e) + EP (E; ∞) , which form an increasing family that converges to H 2 -as usual, in the weak operator sense with respect to pairs of test vectors from the domain of H 2 ; then, Φ * (H 2 (E)) is an increasing family of bounded positive semidefinite operators on H 1 , whose limit, if it exists, is called Φ * (H 2 ). Note that in either way, the definition makes sure that the result, if densely defined, is an essentially self-adjoint operator.
As for the operator order, A ≤ B for bounded operators means that B − A is positive semidefinite. For unbounded A and B, we only define it if both operators are self-adjoint, in particular with dense domains D(A) and D(B), respectively. Then, A ≤ B is defined as meaning D(A) ⊃ D(B) and ψ|A|ψ ≤ ψ|B|ψ for all |ψ ∈ D(B). Notice that we employ this notation for a positive semidefinite B, where |ψ ∈ D(B) amounts to ψ|B|ψ = +∞, thus automatically fulfilling the inequality also in that case.
So as to allow trivial channels, such as the identity and the constant channel mapping every input state to the ground state of the output space, we always assume α ≥ 1 and β ≥ 0.
The diamond norm is a well-motivated metric to differentiate quantum channels in terms of their statistical distinguishability. Since we consider energy constraints on the channel input, we are motivated to use the energy-constrained diamond norm instead.
Definition 2 (Energy-constrained diamond norm [10,11]). Let H 1 ≥ 0 be a grounded Hamiltonian on H 1 , and E > 0. For a Hermitian-preserving map Φ : T (H 1 ) → T (H 2 ), define the energy-constrained diamond norm (more precisely: E-constrained diamond norm) as From the definition, one may without loss of generality restrict the test states ρ ∈ D(H 1 ⊗ H R ) to be pure states, and H R may be assumed isomorphic to H 1 . For the trivial Hamiltonian H 1 = 0 this definition reduces to the usual diamond norm. On the other hand, Shirokov [10] showed for our class of finitary and grounded Hamiltonians, that the energy-constrained diamond norms · E all induce the strong topology. For more details and properties of the energy-constrained diamond norm we refer to Refs. [10,11]. Note that a slightly different notion of energy-constrained diamond norm was considered earlier in Refs. [12] and [13].
In the following, we adapt the definition of an -universal programmable quantum processor ( -UPQP), originally discussed for finite-dimensional systems, to infinite dimension.
Definition 3 ( -PQP C , cf. Ref. [20]). Let H 1 and H 2 be separable Hilbert spaces. Then, we call P ∈ CPTP(H 1 ⊗ H P , H 2 ), with finite-dimensional H P , an -programmable quantum processor for a set C ⊂ CPTP(H 1 , H 2 ) of channels ( -PQP C ), if for every cptp map Φ ∈ C there exists a state π Φ ∈ D(H P ) such that To address the Hilbert spaces H 1 , H 2 and H P , we refer to the former two as the input and output registers, to the latter as program register. We say that the processor P -implements the class C of channels, leaving out the reference to when it is 0.
When C = CPTP(H 1 , H 2 ), we call the processor universal and denote it as -PQP CPTP . Note that allowing mixed states in the program register is essential, since it allows for example the programming of all depolarizing channels using a qubit H P . On the other hand, we can always replace a mixed program state π Φ by a suitable purification on H P ⊗ H P to obtain a pure program state at the expense of increasing (squaring) the program dimension, and accordingly modify the processor to one acting on H 1 ⊗ H ⊗2 P . Another important special case, that has been considered before, is that H 1 = H 2 = H is a finite-dimensional Hilbert space, and C = U(H) the set of all unitaries, or rather the channels defined by conjugation with unitaries, which has been addressed as "universal" in the literature, but which -in view of the restriction to unitaries -we want to call unitary-universal and denote -PQP U ; in the literature this class is referred to as -UPQP, a "universal" programmable quantum processor. We consider a d 1 -dimensional input space, a d 2 -dimensional output space and an d ∞ P -dimensional program register. In the unitary case, the program states are customarily assumed to be pure, in accordance with the previous literature.
For the exact case, i.e., =0, Nielsen and Chuang proved the No-Programming Theorem [1]. They consider a processor which implements the set C of the channels generated by conjugation with unitaries U 1 , . . . , U N perfectly. ii) the program register is at least N -dimensional, or in other words, it contains at least log 2 N qubits.
While the theorem was originally proved for finite-dimensional H, it is not difficult to see that its proof extends to separable Hilbert spaces. This result shows that no exact universal quantum processor with finite-dimensional program register exists. Indeed, every unitary operation which is implemented by the processor requires an extra dimension of the program Hilbert space. Since there are infinitely, in fact uncountably, many unitary operations, no universal quantum processor with finite-dimensional (or indeed separable Hilbert) space exists. Note that with a separable Hilbert space, one can however approximate every unitary channel arbitrarily well, by choosing C as a countable, dense set of unitaries (see the following construction). On the other hand, using a d-dimensional program register, up to d unitary operations, which are distinct up to a global phase, can be implemented by a series of controlled unitary operations. Therefore, we are interested in > 0 and in particular how the program register depends on the accuracy . Note is a finite set of channels, then we can construct the processor that implements those channels exactly with memory dimension equal to the cardinality K of the set in the following way. We encode the specifying index i from the set of channels into the program state π Φ . The following processor implements the channels Φ i from the set C exactly: The program dimension d ∞ P is equal to the cardinality K of the set C, thus meeting the lower bound from the Nielsen/Chuang No-Programming Theorem 4 (for unitary channels). Since we use this construction several times throughout the paper, we refer to it as the processor-encoding technique (PET).
In the present paper we are interested in programmable quantum processors thatimplement (α, β)-energy-limited quantum channels between infinite-dimensional systems H 1 and H 2 with Hamiltonians H 1 and H 2 , respectively. However, in this case we do not measure the error by the diamond norm, but by the energy-constrained diamond norm: Definition 5 ( -EPQP C ). Let H 1 and H 2 be separable Hilbert spaces and consider a class of quantum channels C ⊂ CPTP(H 1 , H 2 ). A quantum operation P ∈ CPTP(H 1 ⊗H P , H 2 ) is called an -approximate energy-constrained programmable quantum processor for C ( -EPQP C ) if for all Φ ∈ C there exists a state π Φ ∈ D(H P ) such that We denote the dimension of the program register of an -EPQP C as d ∞ P . We consider only classes C of cptp maps that are (α, β)-energy-limited for some α ≥ 1, β ≥ 0. Important classes treated next are the following: the set of all (α, β)-energy-limited quantum channels from H 1 to H 2 is denoted L(α, β). For H 1 = H 2 , the set of (α, β)energy-limited unitary channels is denoted U(α, β). In a Bosonic system of a single Bosonic mode, we look at the set GCG(α, β) of all (α, β)-energy-limited gauge-covariant Gaussian channels; finally, for a general (multimode) Bosonic system, we denote the set of all (α, β)-energy-limited Gaussian unitary channels as GU(α, β).
While the No-Programming Theorem 4 is not directly applicable to an -EPQP U (α,β) , we can reduce the case of infinite dimension to the finite-dimensional case, to rule out the existence of perfect universal programmable quantum processors, by considering only unitaries of the form U = U 0 + ∞ n=2 P n , where U 0 is an arbitrary unitary on the support Namely, a 0-EPQP would imply a 0-UPQP for input register H 1 , and since the latter is a finite-dimensional space, Theorem 4 applies.
Before launching into the rest of the paper, where we derive results about various -EPQP C , it is worth pausing to regard the definition, and to justify why we use the energy-constrained diamond norm and why we restrict our attention to (α, β)-energylimited channels. In fact, it turns out that dropping either restriction results in simple no-go theorems ruling out finite-dimensional program registers.
Remark 6 (Unsuitability of the usual diamond norm). Fix a direct sum decomposition of a closed subspace H 0 of H into orthogonal subspaces, H 0 = ∞ n H n , where dim H n = n, and consider C = n U(H n ) ⊂ U(H), where we regard U(H n ) as a subset of U(H) by identifying each unitary U ∈ U(H n ) with U ⊕ (1 − U U * ) ∈ U(H). An -PQP C would effectively serve as an -PQP U (Hn) for the unitaries on each of the finite-dimensional spaces H n . Previous results [2,20,21], then show lower bounds on d P that diverge as a function of n, showing that d ∞ P must be infinite. The energy-constrained diamond norm, besides inducing the more natural strong topology on the cptp maps, avoids this problem. Note that if the subspaces H n are contained in eigenspaces of the Hamiltonian H ≥ 0, the class C even consist of (1, 0)-energy-limited unitary channels.
The same argument also shows why we have to use a finitary Hamiltonian for the E-constrained diamond norm. Indeed, for a nonfinitary Hamiltonian H ≥ 0 there exists an energy E such that the subspace H ⊂ H spanned by eigenstates of energy ≤ E has infinite dimension. Then, the class of unitaries C = U(H ) ⊂ U(H) is (1, E)-energylimited, and restricted to H , the E-constrained diamond norm equals the unconstrained diamond norm. This includes all Hamiltonians with continuous or partially continuous spectrum.
Remark 7 (Triviality of energy-unlimited quantum channels). The considerations in the preceding remark should have convinced us that we need to consider Definition 5 with a finitary Hamiltonian H 1 on H 1 . Now let us consider how allowing energy-unlimited channels would similarly trivialize our quest for finite program registers. Namely, for every eigenstate |φ n of H 2 with energy e n there exists a well-defined cptp map Φ n that maps all of D(H 1 ) to |φ n φ n |. A processor that can -implement any of the Φ n , even with respect to · E , can approximately prepare an arbitrary eigenstate |φ n φ n | ∈ D(H 2 ), with respect to the trace norm, from the ground state of H 1 , so it is intuitively clear that it requires an infinite-dimensional program register. This can be made precise using the information-theoretic lower bound method explained at the end of Section IV.

III Dimension bounds for energy-limited programmable quantum processors
In the following, we focus on the resources the processor requires to approximately implement all (α, β)-energy-limited unitary channels U(α, β). To obtain upper bounds on the dimension of the program register in Subsection A, we present a construction method based on an existing -PQP U . This can be seen as an extension of a finite-dimensional programmable quantum processor to infinite dimension.
A technical lemma we use in the proof is the gentle operator lemma, which shows that a measurement with a highly likely outcome can be performed with little disturbance to the measured quantum state.
In the following theorem, we construct a processor that maps any input state ρ ∈ D(H) with a certain energy tr ρH ≤ E, We express the approximation parameter γ of our γ-EPQP U (α,β) in terms of the approximation parameter of a given finite-dimensional -PQP U . This is illustrated in Figure 1.
To obtain such a processor, we use the energy constraints to approximate the input and output system by a finite-dimensional subspace of H. Theorem 9. Let H ≥ 0 be a finitary and grounded Hamiltonian on the separable Hilbert space H, and E > 0. Furthermore, let > 0 and d := rank{H ≤ E/ 4 }, the dimension of the subspace of H spanned by eigenvectors of H with eigenvalues ≤ E 4 . Assume that we have an -PQP U P d with d-dimensional input register and program register H P . Then, we can construct an infinite-dimensional γ-EPQP U (α,β) P ∈ CP T P (H ⊗ H P , H) such that for all (α, β)-energy-limited unitaries U ∈ U(H) there exists a unit vector |ψ U ∈ H P such that Figure 1: This is a schematic illustration of the construction method for an γ-EPQP U (α,β) based on an -PQP U . The parts of the figure that we construct in the proof are represented by dashed lines, the parts we assume to exist by regular lines.
Proof. The construction of the infinite-dimensional processor consists of two components: a compression map that projects down to states on a finite-dimensional subspace H d of H spanned by the lowest-lying energy eigenstates, and the application of the given finitedimensional -PQP U P d to that subspace. Define P δ , the projector onto the subspace H δ spanned by all eigenstates with eigenvalue ≤ E/δ, where δ ≤ 1. Consider H δ 2 , which has projector P δ 2 and define the compression map K onto H δ ⊂ H δ 2 as K(ρ) := P δ ρP δ + tr ρ(1 − P δ )|0 0|, where |0 is a ground state of the Hamiltonian H. Now we can define our infinite-dimensional processor as P = P d • (K ⊗ id P ).
Next, we need to describe how to use the processor P to implement an (α, β)-energylimited unitary U ∈ U(H), namely what is the program state |ψ U . To do this, consider the polar decomposition of P δ 2 U P δ , which we can think of as an operator acting on H δ , mapping to H δ 2 : where V d : H δ → H δ 2 is consequently an isometry. We obtain U d as an extension of V d to a unitary on H d := H δ 2 . By assumption, P d can implement U d approximately with error ≤ in diamond norm, using a certain program state |φ U d , and we let |ψ U := |φ U d . The rest of the proof is the demonstration that this construction satisfies the claimed approximation quality in E-constrained diamond norm. To start with, we show that both operators in the difference being understood as operators on H d , and · denoting the operator norm. For this, thanks to Eq. (3) it is enough to show since the square root is operator monotonic, and thus implies The right-hand inequality in Eq. (5) follows trivially from P δ 2 ≤ 1 by conjugation with U * and P δ . The left-hand inequality amounts to showing ψ|U * P δ 2 U |ψ ≥ 1 − δ α + β E for all state vectors |ψ ∈ H δ . Indeed, |ψ ψ| is supported on the subspace H δ , all of whose state vectors have energy ≤ E/δ, in particular tr |ψ ψ|H ≤ E/δ. By our assumption that U is (α, β)-energy-limited, this implies tr U |ψ ψ|U * H ≤ αE/δ + β, and thus by Markov's inequality we get proving the claim.
To prove the bound from Eq. (2), we consider an arbitrary state ρ ∈ D(H ⊗ C k ) with energy bounded by E, i.e., tr ρ(H ⊗ 1 C k ) ≤ E. To start, by Markov's inequality this implies tr ρ(P δ ⊗ 1) ≥ 1 − δ, thus by the Gentle Operator Lemma 8, and the triangle inequality, and Now, from the definition of P and the processor property of P d , we have Noting that ( where we invoke Eq. (4) twice. Continuing, we observe that we can drop the projection P δ in the second term inside the norm, because Next, by Eq. (6) we have another application of Markov's inequality and the Gentle Operator Lemma 8 yields It remains to put everything together: by the triangle inequality and the bounds from Eqs. (7), (8), (9) and (10), we obtain and choosing δ = 2 concludes the proof. To obtain lower bounds on the dimension of the program register in Subsection B, in the following theorem we present a method to construct a finite-dimensional processor assuming an existing infinite-dimensional one, which is illustrated in Figure 2.
Theorem 10. Let H ≥ 0 be the Hamiltonian with a discrete spectrum describing the system on the separable Hilbert space H, E > 0, γ > 0, and furthermore choose d > 0. Assume that we have an infinite-dimensional γ-EPQP U (α,β) P ∈ CP T P (H ⊗ H P , H) for all sufficiently large α and β. Then, there exists an - is the smallest energy such that the space spanned by the eigenstates of energies between 0 and E(d) is of dimension d or larger.
Proof. We assume that an infinite-dimensional γ-EPQP U (α,β) processor P ∈ CP T P (H ⊗ H P , H) exists as described in the theorem, and construct a finite-dimensional one with the same program register, i.e., we aim to bound We start with fixing an isometric embedding V of the d-dimensional Hilbert space H d into H. Namely, with respect to the ordered spectral decomposition H = ∞ n=0 e n P n of the Hamiltonian, let n(d) be the smallest integer such that d ≤ n(d) n=0 rank P n and E(d) := e n(d) the largest occurring energy. Let where the first embedding is an arbitrary isometry. This defines an isometric channel Thanks to V we view H d as a subspace of H, and denote its orthogonal complement by We would like to implement this unitary using the processor P, followed by a cptp compression onto the subspace H d , using its projection operator Π d : where κ 0 is an arbitrary state with energy zero in H d . Since we assume that there exists a γ-EPQP U (α,β) for all sufficiently large α > 0 and β > 0, this unitary can be γimplemented. (In fact, we could choose α = 1 and β = E(d), the largest occurring energy gap in H .) The processor is a concatenation of the isometric channel V, the infinitedimensional γ-EPQP U (α,β) P and the compression map K, namely P := K•P •(V ⊗id H P ), which leads us to where we use the contractivity of the diamond norm under postprocessing and that our subspace goes up to energy E(d), so restricted to it the E(d)-constrained diamond norm equals the unconstrained diamond norm; then, that going to the E-constrained diamond norm blows up the error by a factor of at most 1 E max{E(d), E}; finally, the infinite-dimensional processor makes an error of at most γ. Hence, this is the = γ 1 E max{E(d), E} we get for the resulting finite-dimensional processor.

A Upper bounds
Upper bounds on the program dimension of a finite-dimensional -PQP U were derived in various previous works, most recently in Refs. [20] and [2]. To specify an upper bound for the dimension of the program of the infinite-dimensional γ-EPQP U (α,β) (Definition 5), we thus import the existing bounds via Theorem 9.
Let P be an infinite-dimensional γ-EPQP U (α,β) as in Theorem 9 and P d a finitedimensional -PQP U as required. Since our construction of an infinite-dimensional processor relies on a finite-dimensional one, we reformulate the bound from Eq. (2) as Several upper bounds on the program dimension for finite-dimensional unitary processors can be found in the literature. Note that the bound in the second row of Table 1 was derived from Ref. [28, Lemma 1, Section II.C.] which uses port-based teleportation working with copies of Choi-states. We get upper bounds for our infinite-dimensional γ-EPQP U (αβ) P if we insert into the existing bounds in Table 1.

B Lower bounds
Given an -EPQP U (α,β) for infinite-dimensional (α, β)-energy-limited unitaries, we can build a finite-dimensional -PQP U via Theorem 10, whose program dimension is lower bounded through results from the literature. The following lower bounds for d-dimensional -PQP U are known, as shown in Table 2.
Yang et al. [2], with a slight arithmetic improvement Table 2: Lower bounds on the program dimension for infinite-dimensional processors from bounds for finite-dimensional processors. The last row holds for any α < d 2 −1 2 . The dimension d in the third column is the chosen dimension of the finite-dimensional processor.

IV Recycling the program for implementing unitaries
In this section, we prove a general lemma which was first shown by Yang et al. [2] for finite-dimensional unitaries and using the diamond norm. We generalize their statement to infinite-dimensional systems. This lemma is applicable to any unitary that a given processor implements approximately, and it says that in such a case the processor can be modified to one that reuses the program state several times to approximately implement the same unitary several times sequentially or in parallel. This statement is crucial in the information-theoretic lower bounds obtained in Ref. [2] for the program dimension of a universal PQP in finite dimension. We use our infinite-dimensional, energy-constrained version in the next section to give lower bounds on the program dimension of approximate EPQP's for Gaussian unitaries.
Before we state and prove the lemma, we recall some definitions from Shirokov [30]. The completely bounded energy-constrained channel fidelity between two quantum channels is defined as such that |ψ varies over states on H 1 ⊗ H R with energy constraint tr ρH 1 ≤ E. We take, without loss of generality, the infimum over all pure states |ψ ∈ H 1 ⊗ H R with H R H 1 being a reference system, and F (ρ, σ) := tr ρ From Ref. [30] we have and Finally, for an -partite system with Hilbert space H ( ) = H 1 ⊗ H 2 ⊗ · · · ⊗ H , where each H j carries its own Hamiltonian H j ≥ 0, and for numbers E j > 0, we define the multiply energy-constrained diamond norm, or more precisely the (E 1 , . . . , E )-constrained diamond norm, of a Hermitian-preserving superoperator Φ : T (H ( ) ) → T (H ) as This is evidently a norm, being in fact equivalent to the energy-constrained diamond norm: concretely, with E min = min j E j and E sum = j E j , where we use H = j H j as the Hamiltonian on H ( ) . As with the energy-constrained diamond norm, the induced topology is not the issue, but the fact that the multiple constraints in Eq. (13) allow us to encode more refined metric information.
Lemma 11 (Replication of infinite-dimensional unitaries). Consider a processor, i.e., a quantum channel P ∈ CPTP(H ⊗ H P , H), coming with a Hamiltonian H ≥ 0 and a number E > 0, and an integer ≥ 1. Then, there exists another processor P ∈ CPTP(H ⊗ ⊗H P , H ⊗ ) with the following property: for every unitary channel U(·) = U ·U * whose inverse U * is (α , β )-energy-limited and such that there exists a pure state |ψ U on H P with it holds that In words, whenever P, using a pure program state ψ U , -implements an (α, β)-energylimited unitary channel U(·) = U ·U * with (α , β )-energy limited inverse U * (with respect to the E-constrained diamond norm), then P, using the same pure program state ψ U , 2 -implements U ⊗ (with respect to the (E, . . . , E)-constrained diamond norm). In the finite-dimensional setting and without energy constraint, the above statement reduces to that of Ref. [2].
Proof. Applying Eq. (11), we obtain for the energy-constrained completely bounded fidelity between the output of the processor and the target unitary, F E cb P(· ⊗ ψ P ), U ≥ 1 − . Throughout the proof, we observe the convention to mark states for clarity with the index of the subsystem on which they act; similarly for channels, whenever it is not clear from the setting. Let V : B(H) ⊗ B(H P ) → B(H) ⊗ B(H Q ) be a Stinespring dilation of P, with H Q being a suitable environment space. Then, by Uhlmann's theorem for the completely bounded energy-constrained fidelity of quantum channels, stating that any two channels have isometric dilations with the same completely bounded energyconstrained fidelity [30, Prop. 1] (generalizing the case without energy constraint [31]), there exists a state |φ Q ∈ H Q such that Note that here and in the following, we regard a state ρ ∈ D(H P ) as a channel from a trivial system, denoted 1 (with one-dimensional Hilbert space C), to H P . Using Eq. (12), we get We want to apply the processor several times, and for this we have to recover the program state. So, the first step of the proof is to show that we can modify the processor to a new map P ∈ CPTP(H ⊗ H P , H ⊗ H P ) in such a way that apart from implementing U, it also preserves the program state ψ P (all with the appropriate approximations). For this purpose, choose a pseudoinverse of V, where R is a cp map designed to make W cptp. Note that this is always possible because V V * is a projection, and so V * is completely positive and trace nonincreasing. In fact, denoting Π := V V * the projection operator onto the image of V in H ⊗ H Q , one choice is R(ξ) = ρ 0 tr ξ(1 − Π), with a fixed state ρ 0 ∈ D(H ⊗ H P ). We observe that indeed where we obtain the second line by the invariance of the (energy-constrained) diamond norm under multiplication from the left by an isometric channel (V), and the last line by the equivalence of the energy-constrained diamond norms for different energy levels [11]. Since U * is (α , β )-energy-limited, we can lower bound the last expression in turn by Defining the memory recovery map M : where |0 0| is a ground state (i.e., of zero energy) of the Hamiltonian H, we can now conclude that Note that this map depends only on the chosen Stinespring dilation V of P, and thus we can define P := (id H ⊗M) • V, which by the above reasoning has the desired property that via a simple application of the triangle inequality and the contractivity of the (energyconstrained) diamond norm under multiplication from the left by cptp maps. At this point we are almost there, and the remaining argument only requires careful notation. We have isomorphic copies H j of H, j = 1, . . . , as well as the program register H P in the big tensor-product space H ( ) ⊗ H P , and we use index j or P to indicate on which tensor factor a superoperator acts (implicitly extending the action to the whole space by tensoring with the identity id on the other factors). This allows us to rewrite Eq. (15) as for all j = 1, . . . , . By tensoring this with identities U k (for k < j) and with id k (k > j), and observing the definition of the multiply energy-constrained diamond norm, this results in for j = 1, . . . , . (It is perhaps worth noting that we impose only energy constraints on the nontrivial systems H j , both in the simply and multiply constrained norm expressions.) Adding all the bounds from Eq. (16), and using the triangle inequality results in This means that we can define our desired EPQP via P := tr P •P P • · · · • P 2P • P 1P , concluding the proof.
We do not make use of it, but from the proof (and much more explicitly from that of Ref. [2]), something stronger can be obtained. Namely, the processor can be modified in such a way that, rather than merely implementing instances of U sequentially, it does so by alternating them with instances of U * . This is quite curious and hints at an interesting property of programmable quantum processors for unitary channels, namely that with every unitary it approximately implements, it essentially (i.e., after suitable modification) also implements the inverse of the unitary.
The methodology for lower bounding the program register, expounded in Ref. [2], is information theoretic, and in itself does not rely on the unitarity of the target channels. Namely, choose a fiducial state ρ 0 ∈ D(H) of energy ≤ E to be used in the channels Φ ∈ C and the processor, as well as a probability distribution µ(dΦ) on the class C, so that by Definition 5 [Eq. (1)] we have for all Φ ∈ C, Now we can consider three ensembles of states, all sharing the same probability distribution µ: the first an ensemble on the program register H P , the second the output of the processor, ω Φ = P(ρ 0 ⊗ π Φ ), and the third the ideal ensemble from the implemented channels, if the processor was perfect. The Holevo information of the left-hand ensemble is upper bounded by log d ∞ P , and by data processing it is lower bounded by the middle one. We would like to apply a continuity bound for the von Neumann entropy to lower bound the Holevo information of the middle ensemble in turn in terms of the Holevo information of the right-hand ensemble. This is straightforward in finite dimension using the Fannes inequality, but a bit more subtle in infinite dimension, where however analogous bounds exist when additionally the states obey an energy bound [32]. Assuming that C ⊂ L(α, β), this is indeed given for the states of the ideal ensemble: tr Φ(ρ 0 )H ≤ αE + β. But we have a priori no such bound for the actual output states ω Φ . Lemma 12. Consider two states ρ, σ ∈ D(H), where H carries a grounded Hamiltonian H ≥ 0, and a number E > 0. If 1 2 ρ − σ 1 ≤ η and tr ρH ≤ E, then there exists a state σ with tr σ H ≤ E η and Proof. Take the subspace projector P η onto the energy subspace of all eigenvalues ≤ E η , and construct the compression map where κ 0 is an arbitrary state with support P η , e.g. a ground state of H. Then, let σ := K(σ). This does it, as can be seen as follows: tr ρP η ≥ 1 − η, hence by the trace norm assumption, tr σP η ≥ 1−2η, and now we can apply the gentle operator lemma 8 and get 1 2 σ −P η σP η 1 ≤ √ 2η, hence by the triangle inequality 1 2 σ −σ 1 ≤ 2η + √ 2η ≤ 3 √ η. Using triangle inequality once more, we get the distance from ρ bounded by 4 √ η.
Using Lemma 12, we can process the ensemble further, letting ω Φ = K(ω Φ ), using the compression map from the lemma: and now both Φ(ρ 0 ) and ω Φ have their energy bounded by αE+β =: E. Assuming not only a grounded, but also finitary Hamiltonian H 2 with finite Gibbs entropy at all temperatures on the output space H 2 , we then get the following chain of inequalities, lower bounding the program dimension: where the first three inequalities are by definition of the program ensemble and data processing (twice), and the fourth follows from Ref. [32,Lemma 15]. Here, is the binary entropy and we assume that 4 √ ≤ 1. (Alternatively, one could use the Meta-Lemma 16 from Ref. [32], which results in a similar bound with slightly better constants, but they are not that important for us, so we prefer the use of the simpler continuity bound.) In the case of a class C of unitary channels U, we first use Lemma 11 to get a processor for the channels U ⊗ , and then choose a fiducial state ρ 0 ∈ D(H ⊗ ) such that tr ρ 0 H j ≤ E for all j = 1, . . . , . The rest of the reasoning is then the same, except that to define the compression map in the application of Lemma 12, we have to consider total energy E at the input and (αE + β) at the output.

V Programmable quantum processor for Gaussian channels
We proved upper and lower bounds for a processor that implements all energy-limited channels with finite program register for an infinite-dimensional input state up to a certain energy E > 0, i.e., tr(ρH) ≤ E. In the following, the Hamiltonian is the photon-number operator N := a * a. We now consider a special class of Gaussian channels: gauge-covariant Gaussian channels that are relevant in quantum optics, for instance. As explained in the previous sections, we also assume an energy constraint tr(ρH) ≤ E on the input. Thus, we already know from Section III that there is a processor implementing an approximate version of all energy-limited Gaussian channels with finite-dimensional program register. These bounds also apply here. Since gauge-covariant Gaussian channels obey special properties compared to general channels, we aim to use those to develop better upper and lower bounds on the dimension of the program register. We start with presenting the basic ingredients and fix the corresponding notation.

A Preliminaries and notation
There are many review articles on Gaussian states and channels such as Refs. [3,33,34] and textbooks such as Ref. [35]. Hence we review only briefly the most relevant notions and notations. Density operators have an equivalent representation in terms of a Wigner function defined over the phase space, which is a real symplectic space R 2M equipped with the symplectic form. The most fundamental object is the Weyl displacement operator defined asD (ξ) := exp(iX T Ωξ), The coherent states are the eigenstates of the annihilation operator, They form an overcomplete basis, which means that any coherent state can be expanded in terms of all other coherent states because they are not orthogonal. Certain representations of states are based on a coherent-state expansion. Another class of Gaussian states are thermal states ρ G (0, (2N + 1)1 2 ) with N = tr ρa * a being the mean photon number. Let us now define Gaussian channels.

Definition 14.
A Gaussian channel is a quantum channel, i.e., a cptp map Φ : B(H ⊗n ) → B(H ⊗m ) that maps every Gaussian state ρ G to a Gaussian state, i.e., Φ(ρ G ) is Gaussian as well.
Note that we can also input a non-Gaussian state into a Gaussian channel since Gaussianity is a property of the channel, not the state. The action of a Gaussian channel on a Gaussian state is described by the action on its first and second moments. Gaussian channels acting on M modes are characterized by a vector η ∈ R 2M and two real 2M ×2M matrices K and N . Those transform the displacement vector d and the covariance matrix Γ of the input state as follows The matrices K and N obey the following relations: in order to map positive operators to positive operators and N is symmetric. We can interpret K as being responsible for the linear transformation of the canonical phase variables, while N introduces quantum or classical noise. Recall that any channel can be conceived as a reduction of a unitary transformation acting on the system ρ plus some with s ∈ [0, ∞). It has zero displacement and its covariance matrix is As a special class of channels, we introduce gauge-covariant channels which commute with the phase rotations. Since these channels are invariant under the rotation in phase space, they are also called phase-insensitive.

Definition 15. A channel Φ that maps a single Bosonic mode to a single Bosonic mode is called gauge-covariant if it satisfies
where φ is a real number and N j = a * j a j is the photon-number operator in system j = 1, 2.
Gauge-covariant channels are a concatenation of an attenuation and an amplification part. If one is interested in additivity questions of the Holevo information, for instance, then the parameter specifying the channel is considered to be real because the Holevo information is invariant under phase rotations which are passive transformations. However, viewed from the perspective of a processor, phases yield different outputs which we want to distinguish. Hence, we consider a complex parameter that specifies gauge-covariant channels.
The following proposition states this concatenation of an attenuator channel and an amplifier channel to obtain one-mode gauge-covariant quantum channels. Since we use complex parameters, we combine the phases to an additional phase-rotation part, which yields real parameters for the attenuation and amplification that can be found in Ref. [36], for example. A quantum optical explanation including the complex parameter is given in Ref. [35, p. 31].
Proposition 16. Any one-mode Bosonic gauge-covariant Gaussian channel Φ can be understood as a concatenation of a quantum-limited attenuator channel T λ , a rotation channel R ϕ and a (diagonalizable) quantum-limited amplifier channel A µ , i.e., Φ = A µ • R ϕ • T λ .
We briefly specify the three parts involved in the decomposition. First, there is an attenuator channel T λ with parameter 0 ≤ λ ≤ 1, λ ∈ R, which is called the attenuation factor. The two matrices describing the attenuator channel with the turn out to be K = √ λ1 2 and N = (1 − λ)1 2 . The rotation in phase space is described by the unitary operator which transforms the covariance matrix according tô We denote the corresponding rotation channel as R ϕ (·) = e −iϕN (·)e iϕN . The third part is an amplifier channel A µ with parameter µ > 1. We consider quantum-limited amplifiers which are the least noisy deterministic amplifiers allowed by quantum mechanics. We obtain K = √ µ1 2 and N = (µ − 1)1 2 for µ ∈ (1, ∞) [34].

B Gauge-covariant Gaussian channels
In the first part, we considered an infinite-dimensional input state with a certain maximal energy E and showed that there is a programmable quantum processor able to implement approximations of all (α, β)-energy-limited unitary channels with finite-dimensional program register.
In this section, we study the class of (α, β)-energy-limited gauge-covariant Gaussian channels GCG(α, β). Recall that we denote the processor implementing these channels as -EPQP GCG(α,β) . We give upper and lower bounds on the dimension of the program register of an approximate programmable quantum processor that implements all (α, β)energy-limited gauge-covariant Gaussian channels with an input and output state of a certain maximal energy.

Upper bounds for gauge-covariant Gaussian channels
To obtain upper bounds on the program dimension d ∞ P , we establish an -net on GCG(α, β) to get a discrete approximation of the output. Afterwards, we use the PET to construct a processor that implements the channels of the -net with program dimension equal to the cardinality of the -net. With this construction, we obtain upper bounds on the program dimension of a processor implementing all (α, β)-energy-limited gauge-covariant Gaussian channels.
Proof. Since we consider gauge-covariant Gaussian channels, we use Proposition 16 which states that those channels can be described as concatenation of an attenuator channel T λ , a rotation channel R ϕ and a quantum-limited amplifier channel A µ and thus, we construct one -net on the set of attenuator channels, one on rotations and one on the amplifier channels. They are specified by one parameter each. Let us consider the attenuator channels first. Recall that the parameter 0 ≤ λ < 1 is the attenuation parameter. Thus, we construct an λ -net for λ with {λ i } The range of λ forms a compact interval. The cardinality of such a net is Analogously, we construct an ϕ -net for the parameter ϕ ∈ [0, 2π] such that for every ϕ, there exists an index j ∈ I ϕ with We continue with the parameter describing the amplifier channel. Note that amplifier channels enlarge the energy. The larger the amplification factor, the higher the energy of the output. The (α, β)-energy limitation of the considered channels yields a maximal amplification factor µ max . Let us specify this parameter.
The cardinality of this net reveals as The overall cardinality for the parameter appears as follows where we use Eq. (19) in the last inequality. Since we are interested in the cardinality of -nets in GCG(α, β), we lift the parameter nets to nets on the set of channels. We use the E-diamond norm distance (see Definition 2). First, for the attenuator channel, we know from Ref. [37,Example 5] that Secondly, concerning the rotation channel, we use the result by Becker and Datta [37, Proposition 3.2] for the one-parameter unitary semigroup of rotations Thirdly, the norm of the distance of the amplifier channels can be bounded as [37, Example 5] For the (α, β)-energy-limited gauge-covariant Gaussian channels we overall obtain We express λ , ϕ and µ in terms of the -parameter that specifies the accuracy of the processor: Inserting these expressions into |I Φ | we get We use the PET to construct an -EPQP GCG(α,β) with program dimension concluding the proof.

Lower bounds for gauge-covariant Gaussian channels
In Proposition 16, we obtained three different building blocks for the -net for the upper bounds: attenuation, amplification, and phase rotation. It turns out that for lower bounds, the third part is particularly relevant because it yields -divergence.
Phase rotation. To lower-bound the program dimension d ∞ P of an -EPQP GCG(α,β) , we proceed in two steps. First, we apply Lemma 11 to the phase-rotation channels R ϕ (·) = e −iϕN (·)e iϕN , which are (1, 0)-limited. This results in a modified processor that implements the rotation times in parallel. Motivated by the fact that all information for the implementation of R ϕ is contained in the program state, which has to contain almost the same information as the -tensor power phase rotation, we design an ensemble on the output space to obtain lower bounds on the program dimension by bounding the Holevo information in the second step. The resulting lower bounds are stated in the following theorem.
Proof. The gauge-covariant Gaussian channels contain the one-parameter group of unitaries R ϕ of phase rotations. Applying Lemma 11 to these unitaries, we obtain Next, we create a state of high total energy on which we act with R ⊗ ϕ to generate an ensemble, where ϕ is uniformly distributed on [0, 2π]. The ideal output is the phase rotation R ⊗ ϕ on modes. Since the photon number is the sum of those on the subsystems, the unitary is generated by the total photon number, i.e., R ⊗ ϕ = e iϕ(N 1 +...+N ) . Since this yields a phase multiplication e iϕn on each degenerate subspace of total photon number n, the -fold tensor-product unitary is diagonal in the photon-number basis and we use only one state from each eigenspace.
For each total number n of photons, we define a unique way of distributing them across the modes in an as equilibrated way as possible. For instance, choose a partition of n into non-negative integers, n = n 1 + . . . + n and define |"n" as the unit norm symmetrization of |n 1 · · · |n , |"n" :∝ π∈S |n π(1) · · · |n π( ) .
This state evidently has total photon number n, and the expected photon number in each mode is n .
As input state to the processor we choose |ν = ∞ n=0 c n |"n" , with amplitudes such that ν|N |ν = n n|c n | 2 ≤ E. The following calculations of the Holevo information take place on the subspace spanned by |"n" . Note that on that subspace, the total number operator N = N 1 + . . . + N is isomorphic to a number operator, hence the time evolution of R ⊗ ϕ leaves this "virtual Fock space" Since all information about the output of the processor is contained in the program state, following the approach explained at the end of Section IV. We compare these ensemble states ω ϕ = P(|ν ν| ⊗ ψ ϕ ) with the ideal ones R ⊗ ϕ (|ν ν|), which are supported on H V with projector P V . Thus, defining the compression map onto that subspace, and letting ω ϕ = K V (ω ϕ ), we have, by Eq. (20) and the contractivity of the trace norm, that and on the other hand by data processing for the Holevo information, As mentioned before, the Hamiltonian restricted to the virtual Fock space H V is isomorphic to a normal number operator H V = ∞ n=0 n|"n" "n"|, and the ideal ensemble states have energy tr R ⊗ ϕ (|ν ν|)H V = tr |ν ν|H V ≤ E. Now we invoke Lemma 12 with η = 2 √ 2 , yielding the compression map K onto the subspace with energy ≤ E 2 √ 2 = E 2 √ 2 , which gives rise to states ω ϕ = K(ω ϕ ) with and so finally using Eq. (17) at the end of Section IV, where g(N ) = (N + 1) log(N + 1) − N log N is the well-known formula for the von Neumann entropy of the thermal (Gibbs) state of mean photon number N . On the other hand, it is easily seen that which itself is maximized for the thermal distribution with mean photon number n n|c n | 2 = E, and the maximum is g( E). Using the elementary upper and lower bounds log N ≤ g(N ) ≤ log(N + 1) + log e, and letting , with 0 < δ < 1, we thus get The final form of the bound is hence as claimed.
Note that in this way, considering only the phase-rotation part of the decomposition of gauge-covariant Gaussian channels, we obtain lower bounds on the program dimension that diverge with , confirming that the divergence of the upper bounds is not an artifact of the net construction. Qualitatively, one can see that this is a method to obtain similar lower bounds on the program dimension to implement more general subgroups of unitaries.
Attenuation. The lower bound we obtained in Theorem 18 relies only on the phaserotation unitaries, since they allowed us to invoke the Replication Lemma 11. Here, we want to explore what kinds of lower bounds we can obtain from looking at attenuation only, i.e., on -EPQP T , which denotes processors implementing the attenuator channels T = {R ϕ • T λ : ϕ ∈ {0, π}, λ ∈ [0; 1]}. Note that we allow a single phase rotation of angle π, which in itself cannot give an unbounded lower bound. We could give the subsequent argument without it, but including it makes the following discussion a little nicer.
Theorem 19. Let 0 < < 1 1024 and E ≥ 2 e − 1. Then, for every infinite-dimensional -EPQP T P ∈ CPTP(H ⊗ H P , H), its program register is lower bounded as follows: Proof. As in the previous theorem, and explained at the end of Section IV, to obtain the lower bound, we test the processor on a concrete input state ρ χ which we choose to be a coherent state ρ χ = |ζ ζ| with the highest allowed energy (photon number) E, i.e., ζ = √ 2E. With this fixed input state, the processor generates the output states {Φ(ρ χ )}, Φ ∈ T . These output states ideally are precisely the coherent states |ξ ξ| with −ζ ≤ ξ ≤ ζ.
Rather than describing the ensemble of program states ρ λ , which through the processor lead to unique output states ρ ξ = P(|ζ ζ| ⊗ ρ λ ) (that approximate the coherent state |ξ ξ|), we give instead directly a distribution over the ξ. We choose the truncated Gaussian distribution with variance σ 2 p E (ξ) := with the complementary error function erfc(x) and its well-known upper bound erfc(x) ≤ e −x 2 , see Ref. [38]. Note furthermore that, denoting the density of the centered normal distribution with variance σ 2 by p(ξ) = 1 √ 2πσ e − ξ 2 2σ 2 , we have 1 2 p − p E L 1 = η. Following the method described at the end of Section IV, using data processing, we start off from the inequality where we recall the definition of the Holevo information. The remaining calculation is about controlling the Holevo information on the right-hand side, which we do by first modifying the states from ρ ξ to the compressed state ρ ξ = K(ρ ξ ), and finally to |ξ ξ|, incurring a certain error. According to Eq. (17) we get from Eq. (21) keeping in mind that our channels are (1, 0)-energy-limited and that the attenuator output states |ξ ξ| are pure. It remains to calculate the entropy, which however is challenging. To lower bound it in turn, we modify the distribution from the truncated Gaussian p E to the full Gaussian p, incurring another certain Fannes error, but having the benefit of leaving us with a Gaussian state. We abbreviate the mixtures to which we can apply [32,Lemma 15], noting that both states have energy bounded by σ 2 /2 and E, respectively. We choose σ 2 = 1 t E with t ≥ 1, making the energy bound E, and η ≤ e −t , thus On the other hand, ω is a Gaussian state having a diagonal covariance matrix with eigenvalues 1 and 1 + 2σ 2 . From this we can obtain its symplectic eigenvalue, which is √ 1 + 2σ 2 , as one can see by considering a Gaussian squeezing unitary that transforms the state to a thermal Gaussian state. Hence, where here and in the previous display equation we used the bounds log(x + 1) ≤ g(x) ≤ log(x + 1) + log e.
Putting it all together, using Eq. (22) and the above bounds, we obtain and letting t = ln log(E + 1) ≥ 1, recalling the assumption on E, concludes the proof.
Amplification and attenuation. In the case of α > 1, amplifier channels are also available. Thus, one could try to use attenuators as well as amplifiers to construct an ensemble. Heuristically, it makes sense to input a coherent state with the highest energy. Applying the attenuator channel yields coherent states with lower energy, which serve as input for the amplifier channel. The amplifier channel maps these coherent states to displaced thermal states. However, we did not find an appropriate ensemble where the mixture of ensemble states is still Gaussian (this is a heuristic to be able to calculate entropies in closed form) and the Holevo information is improved compared to the coherent states. Such an ensemble plausibly does not exist, because the amplifier channel introduces noise, which means that to obtain an advantage, the ensemble must use different amplification strengths, otherwise data processing shows directly that the Holevo information is only smaller. On the other hand, using a distribution over amplifications would likely result in an ensemble mixture that is a convex combination of different thermal states, and no nontrivial convex combination of them can lead to a thermal state again.
Hence, to obtain lower bounds for gauge-covariant Gaussian channels, we consider the subset of attenuator channels. In other words, we obtain the same lower bounds for a processor that is merely able to implement attenuator channels and one that implements all Gaussian channels. Note that the lower bound on the processor dimension, such as Theorem 19, in any case do not diverge as a function of , as the net-based upper bounds do. Rather, for → 0 the lower bound converges to an expression that depends only on the energy, which is natural as it is based on an information bound for a single output of the channel that the processor implements, and we do not have access to the Replication Lemma 11.

C Gaussian unitary channels
In analogy to existing programmable quantum processors that implement unitary channels, we aim for (α, β)-energy-limited Gaussian unitary channels. Recall that we denote this processor as -EPQP GU(α,β) . We study resource requirements in terms of the dimension of the program register.

Upper bounds for Gaussian unitary channels
We again aim to determine upper bounds on the program dimension d ∞ P of an -EPQP GU(α,β) in three steps. Firstly, we construct an -net on the parameter set, secondly we relate it to a set of channels and thirdly, we construct a processor with program register equal to the cardinality of the net. We denote the set of all (α, β)-energy-limited Gaussian unitary channels as GU(α, β) with elements Theorem 20 (Upper bound). Let > 0 and E > 0. Then, for a system of M Bosonic modes, there exists an infinite-dimensional -EPQP GU(α,β) P ∈ CP T P (H⊗H P , H) whose program register is upper bounded as follows: for an absolute constant c S .
Proof. A general M -mode Gaussian unitary can be decomposed into a generalized phase rotation, which is a passive operation that does not change the energy, followed by M separate single-mode squeezing transformations, followed by another passive generalized rotation, and finally a displacement, cf. Refs. [39,40]. Thus, we construct two nets: one for the first three operations based on the symplectic group and another one on the displacements. Note that these sets are not compact but due to the energy limitation, we can introduce a cutoff in each of the sets to obtain compact ones. Where we place the cutoff depends on α and β.
For the first net, let us consider the following compact subset of Sp 2M (R) To see what this does, the cutoff yields all elements with maximal singular value r ≤ √ α. Since the singular values of a symplectic matrix come in pairs x and 1/x, this means that the above subset contains all matrices whose singular values lie between 1 √ α and √ α. From the Bloch-Messiah decomposition, which shows that modulo passive Gaussian transformations, every Gaussian unitary described by a symplectic matrix is equivalent to a tensor product of single-mode squeezing operators [41], this means that we only have to consider the (α, β)-energy limitation of those M single-mode squeezers.
It is indeed elementary to see that a squeezing unitary with singular values of the symplectic matrix r ≥ 1 and 1/r is not (α, β)-energy-limited for any r 2 > α and β ≥ 0. Indeed, consider a squeezed vacuum state σ with ∆x 2 = γ 2 1, ∆p 2 = 1 2γ 2 , which has photon number tr σH ≈ γ 2 −1 2 ; after squeezing, we have an even more squeezed vacuum state with photon number tr σ H ≈ r 2 γ 2 −1 2 ≥ r 2 tr σH. On the other hand, it is not difficult to see that the squeezing unitary is r 2 , r 2 −1 2 -energy-limited. Namely, it transforms x to rx and p to p/r, and so the Hamiltonian

Thus, the set Sp
Bringing these two nets together by multiplying the unitaries, results in an overall net cardinality .
Having established -nets on the parameter level, we require an upper bound for So we transfer both nets on the sets of parameters to the corresponding channels. The symplectic matrices correspond to the first three parts of the decomposition, a rotation followed by a squeezing and again a rotation, Since we assume an energy limitation on the set of Gaussian unitary channels, we can construct a compact subset of channels that contains these channels, as follows. In fact, we obtain it from a compact subset of the symplectic group and a compact subset of the displacement group.
For the former, we use Ref. [42,Eq. (4)], which states 2)M < 13M . Hence, in simplified form the result says that For the latter, we consider Ref. [42,Eq. (3)], which states E + 1 and as before we use only the simplified upper bound.
Note that with the action of U S on the input, the input energy of the displacement part changes, i.e., we work with the (αE + β)-energy constrained diamond norm here. Thus we obtain Overall, we obtain for the net of channels We now choose S and d in terms of , E, α and β, as follows: which yields an -net with With the PET, we construct a programmable quantum processor with d ∞ P = |I S,d | which concludes the proof.

Lower bounds for Gaussian unitary channels
Concerning lower bounds on the dimension of the program register of an -EPQP GU(α,β) for an M -mode Bosonic system with Hilbert space H = H 1 ⊗ · · · ⊗ H M , evidently Lemma 11 is applicable to suitably energy-limited unitaries. The difficulty is mainly that of finding a good distribution over those unitaries and a fiducial state with which to calculate a lower bound along the lines of the end of Section IV.
Since phase rotations are a subset of Gaussian unitaries, the bounds from Theorem 18 (Section 2) directly apply here, showing that the program dimension diverges at least with the inverse square root of . We can however immediately do a little better by considering M -fold phase rotations R ϕ = R ϕ 1 ⊗ · · · ⊗ R ϕ M with ϕ = (ϕ 1 , . . . , ϕ M ) ∈ [0; 2π] M in Lemma 11. Note that these are a subset of the passive linear transformations, and as such conserve energy, hence are (1, 0)-energy limited. We get that the modified processor P approximately implements the R ⊗ ϕ : In the M -mode system H ⊗ we address the modes H jk by double indices, where j = 1, . . . , M are the original physical modes and k = 1, . . . , the repetitions. The repetitions of the jth mode have the Hilbert space H ⊗ j = H j1 ⊗ · · · ⊗ H j =: H j• . As in the proof of Theorem 18, we choose a virtual Fock space H V j ⊂ H j• spanned by symmetric number states |"n" j , and let |ν j := ∞ n=0 c n |"n" j , where {|c n | 2 } is the probability distribution of the thermal state (of the virtual mode H V j ) of mean energy (i.e., photon number) E M . The rotation R ⊗ ϕ j acts on H j• and leaves H V j invariant, in fact it puts phases e iϕ j n in the above superposition. Now, |ν := |ν 1 ⊗ · · · ⊗ |ν M is our fiducial state. It has the property that on each copy H •k = H 1k ⊗ · · · ⊗ H M k of the original M -mode system, its energy is E. We can evaluate the Holevo information of the ideal ensemble of uniformly distributed states R ⊗ ϕ (|ν ν|) as we did in Theorem 18: In the above analysis, as in that of Theorem 18, it is helpful that the ensemble is obtained from an orbit of a compact subgroup of the Gaussian unitaries, for which we can impose the Haar measure as probability distribution. It might be possible to extend the analysis of Theorem 21 to the largest compact subgroup, which is the set of all passive linear transformations, parametrized precisely by the orthogonal symplectic matrices Sp 2M (R) ∩ SO 2M (R), which is well known to be isomorphic to the group U(C M ) of M × M -unitary matrices (cf. Ref. [39]). This would give access to a much larger set of ensembles, but in view of the above result (featuring the entropy-maximizing Gibbs states), it would be surprising if it yielded a significant improvement.

VI The future
We introduce approximate programmable quantum processors in infinite dimension and establish a relation to finite-dimensional ones. With two different constructions, the first reducing an infinite-dimensional processor to a finite-dimensional one, and the second vice versa, we obtain upper and lower bounds on the program dimension based on existing bounds. It remains an open question to determine how tight these bounds are, and may best be addressed in a specific setting.
We do this for Bosonic systems and restrict to Gaussian channels. In the unitary case, we obtain lower bounds that diverge with the reciprocal of the approximation parameter, with a polynomial degree of at least half the number of Bosonic modes in the system. We also have upper bounds based on nets on compact sections of the Gaussian unitary group, also polynomial in the reciprocal of the approximation parameter, but the order is quadratic in the number of modes. We leave the determination of the exact optimal degree as an open question. To obtain these lower bounds, the method of Yang et al. [2] by which the program state can be recycled to implement the same unitary several times, is adapted to infinite dimension and the energy-constrained diamond norm (necessitating a generalization of the latter with multiple constraints).
However, this trick cannot be applied in the case of the well-studied and physically relevant class of single-mode gauge-covariant Gaussian channels, because those are genuinely noisy channels. We still provide lower bounds, which are comparatively weak, though. Concretely, while the corresponding upper bounds that we develop (based on nets) diverge with the accuracy of implementation, the lower bounds tend to a constant function of the energy constraint. It remains an open problem to close this gap, and indeed to determine whether an infinite program register is actually necessary to implement all gauge-covariant channels (modulo phase rotations), or even only the attenuator channels. The latter is a particularly interesting subclass, as attenuators map pure coherent states to other pure coherent states, suggesting that perhaps a variant of Lemma 11 could be shown to hold for repeated applications of the channel to coherent states.
Furthermore, one could think of more degrees of generalizations towards a programmable quantum processor that implements all Gaussian channels. This could potentially be done by considering their Gaussian unitary dilations, for which we already have upper bounds. A necessary requirement to carry out this program would be a version of the Stinespring theorem that gives an energy-limited Gaussian dilation for every energylimited Gaussian channel.