How complex can the responses of a quantum device become as it runs longer with a fixed internal memory? We quantify this complexity through sequential response capacity: how many adaptive testing stages, each using a fresh run, can continue to separate possible processes by a prescribed gap in response probabilities. For fixed system and memory sizes, we establish a tight law relating this capacity to run length and probability resolution. At fixed resolution, the capacity grows on the order of
KlogK, where
K is the number of time steps in each run. Our construction attains this growth using time-dependent phase rotations on a single visible qubit with no additional internal memory; its tests give response probabilities exactly zero or one. Under the same tests, classical stochastic processes that measure in a fixed basis at every step have only linear capacity at fixed sizes and resolution. For phase sequences selected by a stored classical label, we then quantify how known independent Pauli noise changes this logarithmic enhancement. With ideal controls and weak residual phase noise after correction, we prove matching capacity bounds at a fixed small probability gap. These bounds identify the inverse residual phase-flip probability as the coherence timescale that limits the extra logarithmic growth.
How much memory does a device need to apply one quantum channel n times, if each output must leave before the next input arrives? The paper counts the qubits the device keeps, the qubits it exchanges for fresh ones, and the purity it is given, with error measured on the whole experiment against an adaptive observer. Immediate release has a price. For the qutrit Werner-Holevo channel, vanishing error requires log2 3 bits of purity per use, a known rate; the paper adds a bound at finite error. If all outputs may leave together, O(log n) bits suffice in total at polynomially small error, refining a known zero rate. At error n^-2 the change comes when outputs wait in batches of about log n, and the zero supplied-purity-rate side holds for every unital channel. Purity separates cheap from expensive repeated use along one set of channels, the closure of those that a finite, maximally mixed bath implements exactly: outside it, linear purity is known to be needed at small error, hence linear memory when fresh qubits are maximally mixed. The paper proves a converse for memory, keeping maximally mixed fresh qubits and the optimal exchange rate: a channel in the closure with a flat probe (an input that leaves the minimal environment maximally mixed) can be served with sublinear memory at any error that is not exponentially small. For channels built from finitely many group relations, memory at fixed error is at most logarithmic, divergent but sublinear, or linear, and some are linear exactly when some finitely presented group is not hyperlinear. Along the way, Rybar and Ziman's question on repeating a channel without resets is answered. At high precision, the memory of n uses of such a channel equals, up to squared logarithms, the cost of the best single use that never leaves the channel's support. That cost is the bath entropy plus n times the entropy one use adds to the bath. For Houghton's group, devices acting through the group need and attain memory n^(1/3) up to logarithmic factors. Whether the single-use law holds at fixed error is open. This archive includes the paper, its LaTeX source and the finite numerical checks; they support but do not replace the proofs.
How much quantum information must a sequential optical test retain, and how reliably must that information survive between source preparations? This paper gives preparation budgets and impossibility bounds that distinguish useful quantum storage from regimes where the classical sample order is unavoidable. Optical source and fully counted memory A fixed unknown normal state supplies independent, identical preparations on
m bosonic modes. The null consists of all pure Gaussian states with total mean photon number at most one. Alternatives have half trace distance at least
1/32 from every pure Gaussian state; neither their energy nor the comparison family's energy is capped. Mixed states and infinite photon tails are included. Each visit accesses one entire original once. The total quantum dimension retained between visits is at most
D, while classical records and computation are unrestricted. At every actual waiting interval, the entire register independently survives unchanged with known probability
a, or is erased with a classical flag. The quantity
ka(D,m) is the smallest deterministic original-preparation cap achieving worst-case error at most
1/3. Failed preparations, discarded trials and reserved positions are all charged. A retained register of
q qubits has
D=2q. An exact threshold for statistical advantage Without retained quantum information, the optimal sample order is
Θ(m). Along arbitrary growing-mode sequences, the precise criterion for improving that order is
ka(D,m)=o(m)⟺am→∞ and maD→∞. The two conditions express separate capacity and survival requirements. Arbitrarily large storage cannot reduce the linear sample order when
a=O(1/m), yet a survival probability tending to zero can still permit an advantage. Let
A=max{1,m2/D}. At the fixed energy and separation above, constants
c,C>0, independent of
m,D,a, give
cmin{m,A/a}≤ka(D,m)≤Cmin{m,A/a+min(a−2,m2/3)},0<a≤1. At
a=0, the sample cost is
Θ(m). For ideal memory the complete rate is
k1(D,m)=Θ(min{m,max(1,m2/D)}). With loss, the bounds match whenever
A≥min{a−1,am2/3}. For example,
a=m−1/6 and
D=⌈m11/6⌉ give
Θ(m1/3) preparations. The existence of sublinear advantage is fully characterized even where its optimal exponent remains bracketed: for
D≥m2,
a=m−1/2, the stated bounds are
Ω(m1/2) and
O(m2/3). Why the construction and converse fit the same resources A physical completely positive contraction combines first- and second-moment information before the next wait. Although the temporary pair output has order
m2 labels, only a positive register of dimension
m+1 is retained. The three-visit route requires
D≥m+1 and pays two actual survival events; a classical alternative handles the centering statistics. The converse covers arbitrary adaptive instruments and persistent noncommuting memory. Erasure removes the coherent prediction contribution while preserving information already learned in the full classical history. Unflagged noise and applicability For a fixed memoryless channel on the entire retained register with a physical reset decomposition
N=aΨ+(1−a)Rτ, where
Ψ is CPTP and
Rτ(X)=Tr(X)τ, an exact flagged-erasure simulation gives
kN(D,m)≥ka(D,m). The established positive quantum Doeblin coefficient optimizes this lower obstruction. Whole-register depolarizing noise with unchanged fraction
1−q=O(1/m) therefore forces
Θ(m) samples for every memory dimension. General unflagged noise inherits a converse, not the flagged model's complete achievability guarantees. The results quantify asymptotic preparation and persistent-memory resources under ideal visit-local control. Temporary auxiliary systems and gate complexity have no imposed budget, and the explicit sufficient finite-sample constants are conservative. The task is pure Gaussianity testing, rather than membership in the full family of mixed Gaussian states. The single integrated PDF contains the short main text, full proofs, four figures and precise resource accounting.
In modular quantum computing architectures, communication between hardware modules is mediated by traveling qumodes sent through transmission lines. Each output qumode interacts with the emitting module only once through a beam-splitter-type interaction and becomes inaccessible to that module after emission. Information required for subsequent outputs must therefore remain in long-lived memory qumodes. For a prescribed multimode Gaussian transformation on
N qumodes, this work determines the minimum memory cost for any given emission order, constructs an explicit sequential protocol attaining this minimum, and develops a greedy method for identifying memory-efficient emission orders. The transformation is represented by a symplectic matrix
S, specified either directly or through a Gaussian gate sequence. The exact minimum memory cost is obtained from the ranks of submatrices of
S and further reduces to a support-based counting rule whose computational cost is linear in the size of the support data. When
S is specified directly, a matrix-based protocol attains the minimum memory cost. If instead
S is specified through a gate sequence, the original gates can be reused without additional synthesis, although the resulting memory usage need not be minimal. Gaussian transformations with local support on a
D-dimensional cubic lattice can be realized sequentially with
O(N(D−1)/D) memory qumodes. The protocols also apply to non-Gaussian inputs, including GKP and cat states, and thereby provide an explicit, resource-efficient scheme for intermodule communication in modular architectures for universal continuous-variable quantum computation.
Quantum catalysis, the ability to enable previously impossible transformations by using auxiliary systems without degrading them, has emerged as a powerful tool in various resource theories. Although catalytically enabled state transformations have been formally characterized by the monotonic behavior of entropic quantifiers (e.g., the von Neumann entropy or nonequilibrium free energy), such characterizations often rely on unphysical assumptions, namely, the ability of using catalysts of infinitely large dimension. This approach offers very limited insights into the practical significance of using catalysis for quantum information processing. Here, we address this problem across a broad class of quantum resource theories. Leveraging quantum information tools beyond the asymptotic regime, we establish sufficient conditions for the existence of catalytic transformations with finite-size catalysts. We further unveil connections between finite-size catalysis and multicopy transformations. Notably, we discover a phenomenon of catalytic resonance: by carefully tailoring the catalysts's state, one can drastically reduce the required dimension of the catalyst, thus enabling efficient catalytic transformations with minimal resources. Finally, we illustrate our findings with examples from the resource theories of entanglement and thermodynamics, as well in the context of catalytic unitary transformations.
We study the persistent quantum and classical memory required for exact heralded storage and retrieval of quantum measurements. Given only black-box access to the measurement channel, we construct an exact compression of the port-based program into an outcome-type record and a quantum register, with total dimension polynomial in the query count. For every universal retrieval processor we prove the bounds
Q+C≥log2n and
2Q+C≥log2((n−1)d2+1) on the numbers
Q of qubits and
C of bits of the program, for
n-outcome POVMs on
Cd with
d≥2. For
n≥2, no finite classical memory removes the need for quantum memory: any such processor requires a quantum program of dimension at least
d, at that dimension its classical alphabet must have at least
n symbols, and both minima are attained by a single-query protocol with success
1/d2. Combining direct-program compression with a converse from approximate measurement programming gives logarithmic total-memory scaling in
1/(1−p) as the uniform success probability
p approaches one, at fixed
d,n≥2. At fixed input dimension and target success below one, the optimal total-memory scaling is logarithmic in
n. We also construct self-contained programs under branch-decomposition access and compare the quantum and classical costs of all constructions, including where the outcome-type record is kept: for POVMs with
n nonzero rank-one effects the direct program admits a purely quantum allocation whose register is never larger than that of the minimal-Naimark unitary program and which succeeds more often whenever
n>d.