A common self-consistent channel diagnostic uses a reference contrast matrix R and a processed contrast matrix P. Under a fixed d-dimensional carrier, a common preparation/readout interface, and an invertible reference, one obtains W = Tr(P R^{-1}) = Tr T, where T is the transfer block on the d^2 − 1 traceless operator coordinates. Every entanglement-breaking d-dimensional channel obeys W ≤ d − 1. The inequality is useful only if the dimension and interface assumptions are part of the experimental contract. We construct an exact countermodel when they are not. For every d ≥ 2, set m = d^2 − 1 and let n_1, …, n_{m+1} be the vertices of a regular simplex in R^m. An affine encoding of a local m-dimensional signal ball into the m + 1 = d^2 classical simplex, paired with binary linear readouts, gives an invertible isotropic contrast matrix R = β I_m. The stochastic memory transition K_q = q I_{m+1} + (1 − q) 11^T/(m+1), 0 ≤ q ≤ 1, acts as r ↦ q r on the encoded local chart. Hence for every depth n the observed contrasts satisfy P_n = q^n R, all semigroup identities P_{n+k} = P_n R^{-1} P_k, and the apparent transfer spectrum is exactly that of the d-dimensional depolarizing channel. Yet the physical realization is a measure-and-prepare channel on a d^2-state classical memory and is therefore entanglement breaking for every q. A naive d-dimensional trace witness returns W = (d^2 − 1)q, which exceeds the legitimate entanglement-breaking threshold d − 1 whenever q > 1/(d + 1). At q = 1 the apparent violation factor is d + 1 although the physical memory is classical. Under affine mixture-preserving encodings, d^2 classical states are also minimal for faithfully representing an open (d^2 − 1)-dimensional interface chart. The result does not contradict valid dimension witnesses or trusted-input quantum-memory tests. It identifies a precise failure mode of transferring a dimension-conditioned trace certificate outside its interface contract: repetition consistency, spectral consistency, and arbitrarily deep Markov consistency do not by themselves recover the missing dimension assumption.
How much distinguishability can a noisy quantum channel preserve when its input is correlated with an untouched quantum memory? This paper gives an exact finite semidefinite program for that question for every finite-dimensional completely positive, trace-preserving channel. The complete coefficient compares joint states with the same memory marginal. The conditional coefficient instead subtracts the distinguishability already present in the memory. Both coefficients, and conditional mutual-information contraction with a separate conditioning system, equal one minus the reciprocal of an optimization in the channel’s unnormalized Choi matrix. The equivalent inverse formula retains an essential range condition, including for singular channels. The proof solves a centered matrix-Gram problem, shows that its optimization center can be positive, and constructs a signed observable lift through an erasure channel. Two weighted quadratic inequalities give the universal entropy bound. A rare coherent memory sector proves sharpness while preserving both local marginals exactly. A memory of bounded dimension suffices, including with prescribed faithful input marginals. The same program gives exact coefficients for regular modular Petz divergences whose generators have finite endpoint value and recession slope, every fixed Petz Rényi order strictly between zero and one, and quantum Chernoff divergence. Further results include a harmonic dual, an exact tensor-product law, a strict-contraction criterion, a sharp comparison with positive quantum Doeblin minorization, and explicit classical, depolarizing and orthogonal-unitary-noise formulas. Ordinary quantum mutual-information contraction is a different optimization. For qubit depolarization the paper determines its exact value on the full completely positive parameter interval. At shrinkage one half, ordinary relative-entropy, ordinary mutual-information and complete entropy contraction are respectively 1/4, 1/3 and 3/8. In higher dimension, bounds and a strict separation are proved without asserting an exact ordinary-MI formula. A discontinuity between nearly complete amplitude damping and pure reset rules out uniformly bounded-use estimation of the exact coefficient from an unknown channel, even with adaptive experiments and quantum ancillas. Thus evaluation from exact supplied Choi data does not imply stable experimental acquisition. Rare sharpness witnesses can carry vanishing absolute information; the results do not assert a communication rate, physical simulator, general recovery map or polynomial cost in physical qubit count.
We provide a complete set of game-theoretic conditions equivalent to the existence of a transformation from one quantum channel into another one, by means of classically correlated preprocessing and postprocessing maps only.Such conditions naturally induce tests to certify that a quantum memory is capable of storing quantum information, as opposed to memories that can be simulated by measurement and state preparation (corresponding to entanglement-breaking channels).These results are formulated as a resource theory of genuine quantum memories (correlated in time), mirroring the resource theory of entanglement in quantum states (correlated spatially).As the set of conditions is complete, the corresponding tests are faithful, in the sense that any non-entanglement-breaking channel can be certified.Moreover, they only require the assumption of trusted inputs, known to be unavoidable for quantum channel verification.As such, the tests we propose are intrinsically different from the usual process tomography, for which the probes of both the input and the output of the channel must be trusted.An explicit construction is provided and shown to be experimentally realizable, even in the presence of arbitrarily strong losses in the memory or detectors.
Exact physical memory is an unstable target: a process of Hankel rank one can be arbitrarily close to processes requiring larger classical and quantum carriers. We make this obstruction quantitative and then identify the extra structure under which a physical finite-sample upper theorem is possible. First, on a stationary binary Markov family whose mixing gap is uniformly at least one half, every estimator of exact linear rank, minimum classical memory, or minimum quantum Hilbert dimension has worst-case error at least 3/8 at local separation
Θ([N(L−1)]−1/2) from the rank-one model. The smallest nonzero singular value of an explicit Hankel core is proportional to the same parameter. Thus a spectral or dynamical margin is necessary even under rapid mixing. Second, finite Hankel data determine a minimum linear realization only up to similarity, whereas nonnegativity and complete positivity are not invariant under a generic similarity. We give an exact two-state counterexample and then formulate the missing assumption as a calibrated physical core. For an invertible core
H, all shifts are recovered in one basis by
A~a=H~−1H~a. An explicit perturbation theorem, followed by Choi positive-part projection and one common trace-preserving correction, returns a genuine quantum instrument. A direct-query finite-sample corollary controls its error uniformly over adaptive policies and exposes every dependence on core conditioning, physical calibration, horizon, and confidence. The resulting linear-in-horizon coefficient is first-order sharp: a one-state classical process attains the exact discrepancy
1−(1−Δ/2)L at one-step diamond radius
Δ. Third, we prove a compact-state classicalization theorem. Any finite-dimensional physical memory described by a compact base-norm state space has, at horizon
L and operational error
η>0, a classical realization whose number of states is the seeded covering number at radius
2η/L, uniformly over adaptive policies. For a
d-dimensional quantum instrument this gives, for
d≥2,
(1+η2(1−d−1)L)d2−1 states, with no extra transient state; one state suffices for
d=1. The ambient exponent
d2−1 is optimal for universal trace-norm discretization, while a compact branch-invariant reachable set replaces it by its own metric entropy. Consequently, an unbounded exact quantum/classical memory separation cannot remain unbounded at fixed
d,
L,
η. Robust quantum advantage must instead be quantified as a joint precision–horizon tradeoff. Deterministic verification code audits the mixing lower bound, the similarity-gauge counterexample, common-shift recovery, physical repair, and finite-net simulation.
Comparing two noisy quantum reference frames as statistical experiments depends on the dimension of the ancillary memory available to the decision procedure. For finite-dimensional channels A and B with invertible A, we show that exact simulation of all measurements assisted by an r-dimensional ancilla is equivalent to r-positivity of the unique factor Gamma = BA^{-1}. The hierarchy can be realized by physical channel pairs: every unital, trace-preserving map that is k-positive but not (k+1)-positive embeds as the factor between the channels D_a and Gamma composed with D_a on an exact interval determined by the smallest Choi eigenvalue. For depolarizing source and target channels D_a and D_b, including negative and singular source parameters, the phase boundary is
Da⪰rDb⟺−1/(dr−1)≤b/a≤1 for
a=0. We derive closed formulas for the restricted level-r deficiency and for the distance to every physical post-processing,
δphys(Db∣Da)=(1−1/d2)dist(b,Ia), where
Ia=conv{a,−a/(d2−1)}. The largest physical conversion cost hidden from all tests through level k is
(d−k)/[d(d2−1)]. An untouched m-level spectator changes the first detecting external level from k+1 to
⌊k/m⌋+1. A transpose--depolarizing construction shows that the separation is not confined to depolarizing factors. The results quantify the distinction between ancilla-restricted statistical simulation and implementation by a single quantum channel.
High-dimensional entanglement offers significant advantages over its low-dimensional counterpart in various information-processing tasks. However, to harness these advantages, it is crucial that the quantum channels used to store or transmit the subsystems of an entangled system not only preserve entanglement but also maintain its dimensionality above a certain threshold. The maximum entanglement dimension that a channel can preserve is referred to as its effective dimensionality, since the channel cannot be used to transmit information of dimension greater than that in a single use. In this work, we present a method to certify whether a quantum channel can preserve entanglement dimension above a given threshold. Unlike existing approaches, our method is faithful, i.e., it can be applied to any channel, and avoids common assumptions such as preparation of entangled states, auxiliary side channels, or perfect measurement devices. Moreover, the method can be extended to faithfully certify other classes of non-resource-breaking channels, such as non-nonpositive-partial-transpose-breaking channels (non-NPT-breaking channels). Finally, we discuss possible experimental realizations of our certification scheme through explicit examples.
We study whether local forgetting in finite-dimensional quantum memory can be composed into attenuation of information across a network. We first prove a reference-stable contraction for repeated partial-SWAP collisions between a system qubit and a memory qubit that is depolarized between collisions: for two joint system--reference states with the same reference marginal, the trace distance contracts over a two-collision block by a factor at most
1−ϵ, with
ϵ=(1−λ)2sin2(2θ), uniformly in the reference system and its dimension. This estimate cannot simply be iterated across a branching structure, because the reference marginals required by the hypothesis are not preserved after the first stage. We therefore analyse one explicit branching channel (
θ=π/8,
λ=4/5) through its numerically recorded Pauli transfer tensor and derive conditional exponential attenuation bounds with rate at most about
0.73 per generation. These bounds are conditional on the correctness of the recorded transfer tensor and on a depth-three base case. Both have numerical support, but neither has yet been rigorously certified. We also prove, unconditionally, a single-path lower bound showing that the contraction coefficient of the depth-
r channel is at least
gr with
g≈0.68. The channel is nearly single-path, so it only weakly tests composition, and we identify the missing ingredients for a discriminating test: symmetric children and reuse of memory. A final section reports finite-chain numerical diagnostics and a conjectured probe-mean formula for a reused-memory model; no theorem is claimed there. No Lieb--Robinson-type or spatial attenuation bound is established. Relationship to the Earlier Preprint The present work develops a substantially revised research program building on the earlier preprint, Lieb–Robinson Bounds and Entanglement Limits in Quantum Dynamics with Finite-Dimensional Memory, published on Zenodo on April 26, 2026. The earlier manuscript proposed a general memory-dependent Lieb–Robinson bound, including an effective propagation velocity and associated correlation estimates. The current work replaces that proposed theorem-level result with a mathematically established local result: reference-stable trace-distance contraction under repeated partial-SWAP collisions with depolarized finite-dimensional memory. Beyond this local result, the manuscript investigates whether such contraction can be composed into spatial attenuation. A branching-channel transfer-tensor framework is developed, with attenuation estimates stated conditionally on outstanding verification requirements. A separate shared-memory extension remains exploratory. The distinction between established, conditional, numerical, and conjectural results is made explicit throughout. In particular, the present manuscript does not claim to establish a general Lieb–Robinson-type or spatial attenuation bound. The overarching research question—whether local reference-stable forgetting can be composed into a general spatial attenuation bound for coupled system–memory networks—remains open.