We study the entanglement-breaking lifetime of a qubit subjected repeatedly to one fixed noise channel. Let m_U denote the best lifetime obtained by repeating one unitary control, N_U the lifetime under varying unitary controls, and N the lifetime under arbitrary deterministic qubit channels. We construct a nonempty open set of strictly completely positive channels with m_U = 3 and N_U = N = 4, disproving the stationary-control clause of the Lami–Giovannetti conjecture. A fixed Lindblad generator also produces weak-step channels for which N_U − m_U diverges. Nevertheless, every channel with finite m_U satisfies N_U < 50m_U and N < 128m_U. For such a non-entanglement-breaking channel, write C for its normalized Choi concurrence and δ for its minimum output eigenvalue over pure inputs. The scale T = 1 + log(1 + (1 − C)/δ)/(−log C) satisfies T/50 < m_U ≤ N_U ≤ N ≤ 14T. The proof combines a concurrence estimate for the positive-partial-transpose criterion, a stationary purity alignment, and a partition that charges purifying controls for their concurrence loss. The constants are conservative, and the separation constructions have existential small-parameter ranges. The lifetime comparisons exclude retained ancillas, persistent measurement records and postselection; N = N_U remains open. A visual guide records the reasoning routes and distinguishes inherited premises, numerical leads and proved conclusions.
We study the entanglement-breaking lifetime of a qubit subjected repeatedly to one fixed noise channel. Let m_U denote the best lifetime obtained by repeating one unitary control, N_U the lifetime under varying unitary controls, and N the lifetime under arbitrary deterministic qubit channels. We construct a nonempty open set of strictly completely positive channels with m_U = 3 and N_U = N = 4, disproving the stationary-control clause of the Lami–Giovannetti conjecture. A fixed Lindblad generator also produces weak-step channels for which N_U − m_U diverges. Nevertheless, every channel with finite m_U satisfies N_U < 50m_U and N < 128m_U. For such a non-entanglement-breaking channel, write C for its normalized Choi concurrence and δ for its minimum output eigenvalue over pure inputs. The scale T = 1 + log(1 + (1 − C)/δ)/(−log C) satisfies T/50 < m_U ≤ N_U ≤ N ≤ 14T. The proof combines a concurrence estimate for the positive-partial-transpose criterion, a stationary purity alignment, and a partition that charges purifying controls for their concurrence loss. The constants are conservative, and the separation constructions have existential small-parameter ranges. The lifetime comparisons exclude retained ancillas, persistent measurement records and postselection; N = N_U remains open. A visual guide records the reasoning routes and distinguishes inherited premises, numerical leads and proved conclusions.
We determine the exact performance of a qubit memory subjected to a prescribed finite sequence of independent unital noise channels. The controller may use adaptive instruments, fresh ancillas, unlimited classical records, and conditional recovery, but only one qubit persists between noise steps. If s(j,1) ≥ s(j,2) ≥ s(j,3) are the Bloch singular values of step j and P = Σ(i=1 to 3) Π(j=1 to m) s(j,i), both the optimal average and worst-case pure-state fidelity equal max{2/3, 1/2 + P/6}. We also obtain the exact entanglement fidelity, diamond-distance error, and a concurrence ceiling max{0, (P − 1)/2} valid even for selective branches. Every optimum is attained by a finite protocol. The proof bounds the singular values of each noise derivative in the Klein hyperbolic metric, composes the bounds through arbitrary filters, and combines the resulting normal-form inequality with established two-qubit filtering results. It follows that selective adaptive control cannot extend the entanglement lifetime beyond unitary axis alignment. Two separate consequences concern heralded control of positivity-improving nonunital noise and qualitative entanglement-source placement. The deterministic storage theorem does not cover general nonunital noise, additional persistent qubits, or correlated noise. A visual guide records the reasoning routes, their joint proof premises, and the distinction between inherited tools and the present results.
A seminal result of Hastings showed that entangled inputs can increase the rate of classical communication through independent uses of a quantum channel. While Hastings' result proved the existence of this phenomenon, it has remained a major open problem to find an explicit channel with this property. In this work, we resolve this question by constructing an explicit family of finite-dimensional quantum channels for which entangling inputs between pairs of channel uses yields an unbounded separation from the achievable communication rate using unentangled inputs. We describe a circuit implementation of our channel that uses only deterministic qudit Clifford unitaries and a single binary measurement with classical feedforward. The key ingredient is a careful design of the measurement and feedforward process that yields the required one-copy and two-copy output entropy bounds from moment estimates alone, without requiring strong convergence of the underlying unitary family.
We determine exact resource limits for a qubit memory with retained classical records. For every qubit noise channel A, the largest output generalized entanglement-breaking robustness under an input budget R_G ≤ r is a semidefinite program in two 4 × 4 positive matrices, attained with at most five classical outcomes. For amplitude damping we solve the full budget curve, including two mixed-state regimes, and attain it with one classical bit. Its contraction coefficient is one, approached with vanishing input resource, although every fixed positive resource budget contracts strictly. A different argument controls memories prepared from a perfect qubit: for prescribed independent noise channels A_1, …, A_n, arbitrary adaptive instruments and finite classical records obey R_G(Γ_n) ≤ R(Γ_n) ≤ ∏_j ν(A_j), where ν(A) = max{0, 2λ_max J_A − 1} and J_A is normalized. The proof propagates a positive 2 × 2 operator over the branches. For amplitude-damping survivals with product b, both robustness optima equal b; the optimal average and worst-case pure-state fidelities are (2+b)/3, the optimal Bell fidelity is (1+b)/2, and the minimum half-diamond error is (1−b)/2. Finite protocols attain all four operational optima simultaneously. Thus classical control can improve fidelity while leaving optimal robustness unchanged. The model permits one persistent qubit and excludes quantum bypass, environment access, and postselection. A visual guide records the reasoning routes, their joint premises, and the distinction between prior tools and the results developed here.
We characterize the bath resources needed to supply repeated uses of a fixed finite-dimensional quantum channel in a closed device. For each horizon T, one bath, one initial state and one repeated unitary are fixed before the user. Each output is returned before the next input arrives; no reset, discard, fresh ancilla or uncounted controller is available. Approximation error must vanish against arbitrary adaptive users with quantum memory and references. Writing r=limlog2(RT)/T for the bath dimension rate and s=limS(ωT)/T for the actual initial entropy rate, we prove that the achievable region is exactly s≥0, r+s≥h and r−s≥κ. Here h is maximum entropy exchange and κ is a smoothed independent-reference extension cost, with the zero-error limit taken before the supremum over full-rank inputs. Its exact fixed-input form is an affine transform of the zero-leakage quantum privacy funnel. The minimum dimension rate is (h+κ)/2. The proof combines entropy converses, a bath-dimension-independent support repair, and a closed adaptive implementation of encoder-only fully quantum Slepian--Wolf recycling. All seeds, clocks, workspace and retained residues are counted. Worked examples include dephasing, pure replacement and a qubit channel with 0<κ<h. No computability of κ or efficient circuit synthesis is claimed.
How much internal quantum memory is needed to reproduce a stationary stochastic process, and how does reducing that memory change the environmental resources required when output records are retained? This paper establishes exact quantum-source constructions and resource bounds under explicitly specified readout and retained-output conditions. A general completion theorem identifies the minimum Hilbert-space dimension for stationary triple data in the orthogonal-current-symbol source class: it equals the sum of the complex positive-semidefinite ranks of the middle-symbol slices. An attaining construction reproduces the entire canonical stationary order-two process. For the delayed trine process, the minimum classical hidden Markov model requires nine states at every non-independent parameter value. Quantum instruments reproduce the same complete output law using four-dimensional memory throughout the parameter range, with four dimensions proved necessary in a certified low-noise regime and three dimensions both sufficient and necessary on an explicit high-noise interval. The paper then separates reusable memory dimension from environmental dilation cost. On the certified high-noise interval, the exact one-step Pareto frontier consists of a three-dimensional source with recorded-channel Choi rank nine and a four-dimensional source with rank three. Here, Choi rank measures the minimum initially pure environmental remainder dimension for the channel retaining both the emitted classical symbol and final quantum memory. A separate mixed-support qutrit construction at noise parameter 0.99 improves complete-history costs and gives upper bounds close to universal lower bounds. These results show why optimizing a single step need not optimize a retained multi-step history. The analysis also distinguishes complete channels, fixed-input states and archive-only outputs, and demonstrates how access to a retained reference can distinguish generators with identical passive output statistics. Full-word proofs, algebraic complete-positivity certificates, a technical companion and reproducibility materials accompany the results. The exact intermediate memory boundary and complete-history optimum remain open. All results use standard quantum probabilities and apply to the stated operational resource models; they do not establish total hardware, energy or thermodynamic minima.
We analytically characterize entanglement generation by two paradigmatic coherently controlled quantum processes, the quantum switch and time-flip. Retaining rather than measuring or discarding the control, we treat the control and target as the bipartite system and assume pure product inputs, so that any output entanglement reflects the entangling capability of the process. For the switch of qubit unitaries, we derive exact expressions for entanglement, together with a geometric characterization and a coherence-entanglement conservation relation. We then extend our analysis to binary random unitary, Pauli, amplitude damping, and generalized amplitude damping channels. We prove that switch of channels commuting under composition cannot entangle a separable input. Yet maximal entanglement is possible even with dissipation, e.g., an entanglement-breaking damping channel switched with a bit-flip can transform a product input into a maximally entangled state. For two generalized amplitude damping channels, a common stationary state prevents entanglement, while different stationary populations can enable it. We present an analogous study for the time-flip of unitary and binary random unitary channels. Our findings provide a systematic analysis of how much entanglement can be generated by coherent control of channel order or input-output direction.