Manuscript Em04-A@2 · Em04-A-v2.tex · f5b28abc
Em04-A Exact Reduction, Two-Coordinate Scaling, and Transient Entanglement in a Locally Dissipative XY Chain Local Instruments and Validated Approximation Interfaces
Specifies version 2 of one finite open XY chain with uniform zero-temperature relaxation and local dephasing. Density operators, completely positive channels, Lindblad dynamics, and Born probabilities are assumptions of this construction, not conclusions derived from a measurement-strategy characterization. No earlier landmark is a formal premise. From a single excitation, thm:reduction gives an exact vacuum-plus-single-excitation reduction to an N by N density matrix and a scalar survival probability. thm:concurrence and thm:negativity give pairwise concurrence, the complete partial-transpose spectrum, and logarithmic negativity. At fixed coherent time, two dissipative coordinates (chi, r) are required, and single-chi universality fails. Finite local instruments and typed deferred readout are proved separately. An independently specified oscillator has compressed-position POVM identities, with preparation, composite-trapezoidal, tail, arithmetic, and completed-measurement error bounds. The cellwise residual theorem is an interface for a numerical certificate. It is not evidence that a run has been enclosed. Source alignment remains unresolved: reported simulator correspondences are not validated and are not a completed inspection of an archived export. Independent execution is not asserted. The verification-appendix programs are unexecuted. No validated numerical certificate is supplied. This chain is not a gravitational mediator, not a quantum field, not a microscopic evaporation channel, and not a characteristic-product coefficient. I, IV, En02-A, X-Enter, and Em03-H do not supply the generator or the reduction. Em03-H's fermionic decoder is not this XY reduction. XIV-A's relative master is not this Lindblad generator. V and Em03-D are not this bosonic position measurement. This is not a Page curve, not an island, not passive Hawking evaporation, and not a constructed gravitational dictionary. H2, I3, and J2 remain unresolved. It does not close O.1, discharge the XVI-N insertion, or admit the XIV-XV characteristic coefficient. XVI-P is registered and is not a premise. XV-B is not opened. The series Route B is not discharged. No quantum coefficient is admitted. No compilation is asserted.
Front matter
abstractAbstractFront matter · lines 89–111
Open as its own pageWe specify a finite open XY chain with uniform zero-temperature relaxation and local dephasing. Its evolution from a single excitation admits an exact vacuum-plus-single-excitation reduction to an density matrix and a scalar survival probability. We derive explicit concurrence, logarithmic-negativity, purity, and computational-basis-coherence formulas, including the complete partial-transpose spectrum. At fixed coherent time and fixed dimensionless detunings, two dissipative coordinates are required: excitation survival and a short-time concurrence expansion disprove single- universality. We prove entanglement generation, dissipative decay, conditional mixing, and controlled finite-window limits. Separate results establish finite local instrument consistency and typed deferred readout. For an independently specified oscillator, we prove compressed-position POVM identities, state-preparation and tail bounds, a composite-trapezoidal error estimate, and an arithmetic-aware completion to a valid POVM. A cellwise residual theorem provides a validated state-error interface without assuming positivity of the approximation. Mathematical proofs are distinguished from source alignment, numerical regression, validated numerical certificates, and document construction. No execution or completed verification package is asserted.
Scope, evidence categories, and model specification
sectionScopeScope, evidence categories, and model specification › Scope · lines 116–129
Open as its own pageThis is an independent mathematical construction under specified quantum semantics. Density operators, completely positive channels, Lindblad dynamics, and Born probabilities are assumptions, not conclusions derived from a measurement-strategy characterization. No earlier landmark manuscript is a formal premise of the proofs.
The spin-chain and oscillator constructions are distinct models. Neither is identified with a gravitational mediator, quantum field, microscopic evaporation channel, or characteristic-product coefficient. Documentary programme restrictions are recorded separately in Appendix app:scope.
sectionEvidence categories and present statusScope, evidence categories, and model specification › Evidence categories and present status · lines 131–167
Open as its own pageWe distinguish:
- Analytical proof.
A theorem established by an explicit argument under stated hypotheses.
- Source alignment.
A documented comparison with an identified implementation, including source locations and conventions.
- Numerical regression.
Reproducible floating-point comparisons with predeclared tolerances.
- Validated numerical certificate.
Outward-rounded enclosures and a finite error budget for a specified calculation.
- Document construction.
Successful compilation, resolved references, and inspection of the PDF.
The theorem and proof environments below belong to the first category. A proved error-bound theorem is an interface for a numerical certificate; it is not evidence that its hypotheses have been numerically enclosed for a particular run.
The supplied verification plan reports that an originating simulator export was supplied as documentary material and describes its conventions. These reported correspondences are recorded in Appendix app:alignment. This revision does not include an archived, line-numbered copy of that export or a completed source-inspection record. Source alignment therefore remains to be independently established; it is not replaced by the assertion that code was unavailable, nor by an unsupported assertion that inspection passed.
No execution archive, compiler log, independent symbolic-check output, validated numerical certificate, or machine-checked proof accompanies this revision. The execution-dependent release gates in Appendix app:verification remain unverified.
sectionNotationScope, evidence categories, and model specification › Notation · lines 168–182
Open as its own pageFor matrices,
For density operators,
All entanglement logarithms are base two. A density operator is positive semidefinite and has trace one.
definitionDefinition: Specified zero-temperature chainScope, evidence categories, and model specification › Notation · Em04-A@2#def:model, Em04-A@2#eq:H, Em04-A@2#eq:collapse, Em04-A@2#eq:master · lines 183–227
Open as its own pageLet , , , and , . On , use
and
Subscripts denote tensor-local operators. Set
For any operator , define
The master equation is
There are no bath-raising operators. The default initial state is
where has its unique excitation at site .
remarkRemark: Conventions are part of the theoremScope, evidence categories, and model specification › Notation · Em04-A@2#rem:conventions · lines 229–241
Open as its own pageThe one-excitation hopping amplitude is , because of the factor in (eq:H). With , an isolated qubit's dephasing rate is , while an intersite one-excitation coherence receives dephasing rate . Replacing this collapse operator by doubles these dephasing contributions.
The relaxation vacuum is , since . Software operator names do not substitute for checking this action.
Physicality and exact reduction
lemmaLemma: Physical semigroup and trace-norm contractionPhysicality and exact reduction · Em04-A@2#lem:physical, Em04-A@2#eq:contractivity · proof attached · lines 246–285
Open as its own pageThe finite-dimensional equation (eq:master) has a unique solution for all . Its propagator is completely positive and trace preserving (CPTP). Every CPTP map satisfies
Proof. Existence and uniqueness follow from . Enumerate the collapse operators as , and put
Then . The maps and are completely positive. The norm-convergent Dyson expansion for consists of integrals of compositions of these maps. Complete positivity is preserved by these integrals, sums, and finite-dimensional limits. Cyclicity gives , so the propagator preserves trace. This proves the needed sufficiency statement of the GKSL framework GKS,Lindblad,Kuramochi directly.
For contraction, write the Hermitian Jordan decomposition , . Positivity and trace preservation give
sectionPhysicality and exact reductionPhysicality and exact reduction · lines 285–290
Open as its own pageLet be the isometry , and let in the site basis.
lemmaLemma: Invariant blocksPhysicality and exact reduction · Em04-A@2#lem:blocks, Em04-A@2#eq:R, Em04-A@2#eq:p, Em04-A@2#eq:h · proof attached · lines 291–343
Open as its own pageThe Hamiltonian commutes with
The linear class
is invariant under the generator, with equations
No vacuum–single-excitation coherences are generated.
Proof. The identity
shows excitation conservation by hopping. The detuning terms also commute with . The vacuum energy is , and , proving the Hamiltonian term.
Since , the relaxation jump term is
The anticommutator term on the one-excitation space is , because restricts to its identity.
Finally,
For , conjugation of changes sign at exactly sites . Each contributes . Diagonal excitation matrix units and the vacuum projector are unchanged. These calculations prove all stated block equations.
theoremTheorem: Exact vacuum-plus-single-excitation reductionPhysicality and exact reduction · Em04-A@2#thm:reduction, Em04-A@2#eq:S, Em04-A@2#eq:reduction · proof attached · lines 345–381
Open as its own pageFor the specified model, let be any density matrix on , and take . There is a unique density matrix satisfying
Writing , the full state is exactly
In particular,
The default preparation corresponds to .
Proof. Tracing (eq:R) gives , with initial trace one, hence . Equation (eq:p) gives . For finite , , and substituting gives (eq:S). This conditional equation is itself GKSL:
Thus it has a unique physical solution. The reconstructed state satisfies the full equation and initial condition, so uniqueness proves the identity.
remarkRemark: Exactness and exclusionsPhysicality and exact reduction · lines 383–395
Open as its own pageThe physical tensor factorization remains that of sites. The -level matrix is a computational reduction, not a new factorization for evaluating entanglement.
Uniform relaxation is a hypothesis of this scalar-survival theorem. Nonuniform relaxation still preserves the vacuum-plus-one-excitation block class, but generally replaces by , with the diagonal rate matrix; the universal scalar factorization above then need not hold. Bath raising, higher-excitation preparations, and vacuum–excitation coherences are not covered by the theorem.
Exact diagnostic and entanglement identities
sectionTwo-site concurrenceExact diagnostic and entanglement identities › Two-site concurrence · lines 400–413
Open as its own pageFor a two-qubit density matrix , let
The concurrence is
where the decreasing are the nonnegative square roots of the eigenvalues of Wootters.
theoremTheorem: Exact pairwise concurrenceExact diagnostic and entanglement identities › Two-site concurrence · Em04-A@2#thm:concurrence, Em04-A@2#eq:C, Em04-A@2#eq:Cbound · proof attached · lines 414–454
Open as its own pageFor distinct sites , in the basis ,
Consequently
and
Proof. An excitation outside the pair reduces to . Only coherences supported entirely in the pair survive the partial trace, giving the displayed matrix. Set , , and . Direct multiplication with the spin-flipped matrix gives square-root eigenvalues
Positivity implies . Substitution yields , and the same positivity inequality followed by the arithmetic–geometric mean inequality proves the bounds.
sectionComplete partial-transpose spectrumExact diagnostic and entanglement identities › Complete partial-transpose spectrum · lines 456–468
Open as its own pageFor a partition with both parts nonempty, let have rows in , columns in . Use
with computational-basis partial transpose VidalWerner.
theoremTheorem: Spectrum, negativity, and separabilityExact diagnostic and entanglement identities › Complete partial-transpose spectrum · Em04-A@2#thm:negativity, Em04-A@2#eq:PTspec, Em04-A@2#eq:neg, Em04-A@2#eq:EN, Em04-A@2#eq:ENbound · proof attached · lines 469–559
Open as its own pageLet and . As a multiset, the complete spectrum is
where
Zeros already present in the first three multisets are retained. The formula holds for as well.
Therefore
Within the state class (eq:reduction),
Also,
Proof. A cross matrix unit transforms according to
The vacuum and the states with one excitation on each side therefore carry the block
The cross-sector basis is orthonormal. For , restriction to the vacuum and gives ; the remaining directions give zeros. For , choose any one cross-sector basis vector instead, giving eigenvalues . Such a vector exists because both parts are nonempty.
The other nonzero blocks are and , on mutually orthogonal local single-excitation spaces. All remaining sectors are zero. Their dimensions give exactly additional zeros in (eq:PTspec). The positive local blocks have combined trace , giving the trace norm and the negativity formulas.
If , then . Every separable state has positive partial transpose, by transposing the positive second factor in each product term of a separable decomposition. Hence this state is entangled. If , the vacuum term and the two local excitation blocks are positive product terms. Normalizing the nonzero terms by their traces gives a separable decomposition.
Finally,
Insert this into (eq:EN). The inequality proves the last bound.
sectionPurity and computational-basis coherenceExact diagnostic and entanglement identities › Purity and computational-basis coherence · lines 561–570
Open as its own pageUse the specified normalized diagnostic
Its numerator is the usual basis-dependent coherence BCP; the denominator is an additional convention.
corollaryCorollary: Purity, coherence, and vacuum convergenceExact diagnostic and entanglement identities › Purity and computational-basis coherence · Em04-A@2#cor:diagnostics, Em04-A@2#eq:purity, Em04-A@2#eq:coherence, Em04-A@2#eq:Spurity · proof attached · lines 571–605
Open as its own pageFor (eq:reduction),
For ,
Proof. The vacuum and excitation blocks are orthogonal, proving (eq:purity). All full-state off-diagonal entries belong to . Positivity and Cauchy–Schwarz give
Differentiating conditional purity eliminates the commutator, and . The difference from the vacuum has blocks and , so its trace norm is . The limiting purity follows from (eq:purity).
remarkRemark: Nonmonotone full purityExact diagnostic and entanglement identities › Purity and computational-basis coherence · lines 607–616
Open as its own pageFor the default pure preparation with , remains pure and . At positive relaxation this decreases to at and subsequently increases to one. At fixed , it is also nonmonotone as a function of . Vacuum convergence does not prove monotonicity in relaxation rate. The normalization in (eq:coherence) must likewise be separated from any claimed chain-length dynamical effect.
Scaling and short-time parameter dependence
definitionDefinition: Protocols and coordinatesScaling and short-time parameter dependence · Em04-A@2#eq:coordinates · lines 621–641
Open as its own pageProtocol A fixes physical observation times . Protocol B fixes coherent observation times . Let
When , define
Equivalently,
Here is an isolated qubit's transverse decay rate under the specified convention, not the intersite dephasing rate.
theoremTheorem: Exact two-coordinate scalingScaling and short-time parameter dependence · Em04-A@2#thm:scaling, Em04-A@2#eq:scaledS, Em04-A@2#eq:scaledq · proof attached · lines 643–671
Open as its own pageWith , Protocol-B dynamics satisfy
After fixing , the pair determines these trajectories. A common detuning shift has no effect.
Multiplying by a common replaces the physical-time trajectory by and leaves the corresponding Protocol-B trajectory unchanged. Nevertheless two models with the same finite and different cannot have identical full Protocol-B trajectories.
Proof. Substitution proves the scaled equations. A common detuning shift changes by a scalar identity, which disappears from the commutator. Simultaneous scaling changes the full generator to , because collapse amplitudes scale by . Finally, the excitation expectation is , which differs for different at every .
remarkRemark: Zero dissipationScaling and short-time parameter dependence · lines 673–678
Open as its own pageIf , both rates vanish. The model is unitary, and is not a finite coordinate chart. Limits at fixed are meaningful, but the exactly nondissipative model has no distinguished .
theoremTheorem: Short-time concurrenceScaling and short-time parameter dependence · Em04-A@2#thm:shorttime, Em04-A@2#eq:shortC · proof attached · lines 680–725
Open as its own pageFor the default localized preparation and ,
The formula holds for arbitrary fixed real detunings and includes . In physical time, for all nonnegative rates, it reads
Proof. Set , , and . For , analyticity gives
Direct matrix multiplication on the open chain yields
Thus
The detuning term affects the modulus only at third order. Multiplying by , with , proves (eq:shortC). The same calculation with physical coefficients proves the last formula, including zero dissipation. All remainders concern a fixed model, not unbounded detuning families.
sectionScaling and short-time parameter dependenceScaling and short-time parameter dependence · lines 725–729
Open as its own pageThe survival law and (eq:shortC) independently establish the failure of general single- universality.
Transient entanglement and controlled comparisons
theoremTheorem: Generation and dissipative decayTransient entanglement and controlled comparisons · Em04-A@2#thm:transient · proof attached · lines 733–753
Open as its own pageFor the default localized preparation, finite rates, and finite detunings, on a sufficiently short positive-time interval. Every cut separating sites is entangled there.
If , every pairwise concurrence and bipartite logarithmic negativity tends to zero. The concurrence attains a strictly positive global maximum at finite positive time.
Proof. The leading coefficient in the physical-time expansion is . A cut separating the two sites contains the nonzero coherence in , so Theorem thm:negativity applies. For , , and (eq:Cbound), (eq:ENbound) prove decay. A continuous function vanishing at zero and infinity but positive somewhere attains a positive maximum on a sufficiently large compact time interval, which is also its global maximum.
theoremTheorem: Conditional mixing with dephasingTransient entanglement and controlled comparisons · Em04-A@2#thm:mixing · proof attached · lines 755–792
Open as its own pageIf and , then
For the fixed model there are such that
Consequently when , all the entanglement diagnostics above tend to zero, and the full limiting state is the separable state
Proof. On all complex matrices, the conditional generator obeys
If , , and , then is diagonal. The diagonal equation gives , hence . The neighboring off-diagonal equations give . Connectedness implies .
The invariant trace-zero subspace therefore has its finite spectrum strictly in the left half-plane. Jordan decomposition supplies an exponential bound, with chosen smaller than the spectral decay rate to absorb possible polynomial factors. Apply this bound to . The limiting matrix has no off-diagonal entries; the entanglement formulas vanish and the displayed mixture is separable.
remarkRemark: The localized hypothesis mattersTransient entanglement and controlled comparisons · lines 794–801
Open as its own pageA general mixed need not generate entanglement: is already stationary conditionally. The generation theorem is therefore not asserted for all one-excitation density matrices. With no dissipation, decay also need not occur; the disorder-free two-site chain has .
theoremTheorem: Finite-window unitary limitTransient entanglement and controlled comparisons · Em04-A@2#thm:largechi, Em04-A@2#eq:Sunit, Em04-A@2#eq:unitbound · proof attached · lines 803–849
Open as its own pageFix , and let
For finite ,
All diagnostics above converge uniformly to their unitary counterparts on every fixed . In particular,
Proof. Variation of constants with the unitary propagator gives
Both matrices in the integrand difference are density matrices, so its trace norm is at most two. This proves (eq:Sunit). Reconstruction gives
For Hermitian and distinct orthonormal , , by testing against a phase-aligned Hermitian off-diagonal operator of norm one. Together with (eq:C), this proves the concurrence bound. The remaining diagnostics are continuous functions of ; uniform continuity on their compact finite-dimensional state domain gives the stated uniform convergence.
propositionProposition: Deterministic detuning stabilityTransient entanglement and controlled comparisons · Em04-A@2#prop:disorder · proof attached · lines 851–870
Open as its own pageFor two models with the same , and Hamiltonians ,
Proof. Duhamel's formula has Hermitian source , of trace norm at most . Contractivity from Lemma lem:physical proves the conditional distance bound. The vacuum weights agree, so reconstruction multiplies the conditional distance by .
remarkRemark: Limits of these comparisonsTransient entanglement and controlled comparisons · lines 872–878
Open as its own pageThe finite-window estimate is not a fitted saturation law, global monotonicity theorem, or uniform large-time limit. The detuning bound does not establish a sharp disorder threshold. Ensemble crossover statements require a distribution and statistic. Protocols A and B answer different observation questions.
propositionProposition: Two-site closed-form benchmarkTransient entanglement and controlled comparisons · Em04-A@2#prop:twosite · proof attached · lines 880–910
Open as its own pageFor the localized preparation, , and equal detunings, let and define
Then
For , this is .
Proof. Write , . The equations are
Hence , , whose solution is . Use .
sectionTransient entanglement and controlled comparisonsTransient entanglement and controlled comparisons · lines 910–920
Open as its own pageFor stable overdamped evaluation one can instead use the identical expression
This is an analytical identity, not an executed numerical result.
Finite local instruments and typed records
sectionFinite local instruments and typed recordsFinite local instruments and typed records · lines 922–926
Open as its own pageThe ordinary finite-channel framework is described in Watrous. The identities needed here are proved explicitly.
definitionDefinition: Specified instrumentFinite local instruments and typed records · lines 927–940
Open as its own pageA finite instrument from to has Kraus operators with
Set
The record includes every outcome, including failure labels.
theoremTheorem: Instrument consistency and no-signalingFinite local instruments and typed records · Em04-A@2#thm:instruments · proof attached · lines 942–979
Open as its own pageFor a density matrix :
, and .
If , the conditional state is . If , then ; no normalized branch is assigned.
is CPTP.
Actual tensor-local instruments on disjoint factors commute as selective superoperators after identifying output types.
A remote trace-preserving channel leaves local outcome probabilities unchanged, including for entangled inputs.
Proof. Kraus positivity, cyclicity, and completeness prove (i). A positive matrix of trace zero is zero, proving (ii). The record Kraus operators are complete, proving (iii). For separate factors, composition in either order gives the same Kraus operator , proving (iv).
For a remote channel with ,
remarkRemark: Required implementation checksFinite local instruments and typed records · lines 981–987
Open as its own pageFor a supplied single update operator, require ; for several operators use their sum. Declared footprints do not establish tensor locality. Remote postselection is not a trace-preserving unconditioned channel. Finally, equality of effects does not imply equality of instruments.
theoremTheorem: Typed deferred readoutFinite local instruments and typed records · Em04-A@2#thm:deferral · proof attached · lines 989–1022
Open as its own pageFor a measured factor , complement , and computational basis , define
Reading computationally and retaining gives
Reading and discarding gives instead
These identities hold with any external reference and with the same fixed continuation channel on in both experiments.
Proof. Expand . Coherent recording gives . Reading removes the terms and produces . Tracing out gives the destructive formula. A reference simply enlarges the untouched matrix coefficients. A fixed channel on replaces each by its image.
sectionFinite local instruments and typed recordsFinite local instruments and typed records · lines 1022–1028
Open as its own pageCoherent recording itself is not a classical-record channel. The output types above differ. Arbitrary later interactions with the retained measured factor, carrier, or outcome-dependent feedback require additional hypotheses.
Compressed oscillator position measurements
sectionExact objects and state approximationCompressed oscillator position measurements › Exact objects and state approximation · lines 1032–1051
Open as its own pageLet have oscillator number basis , . In this section denotes the oscillator annihilation operator, not the two-level matrix of Definition def:model. Let
be multiplication by , with PVM
For an integer , define
theoremTheorem: Compressed-position POVMCompressed oscillator position measurements › Exact objects and state approximation · Em04-A@2#thm:compression · proof attached · lines 1052–1072
Open as its own pageThe compressed effects form a countably additive normalized POVM:
Their sum over a countable measurable partition is . They are generally not projections and are not generally the spectral effects of .
Proof. Positivity follows by testing on vectors in . Compression preserves countable additivity of matrix elements, and . For , the vacuum position density is , giving , not a projection. The compressed position operator is zero, whose spectral effect for this set is instead .
lemmaLemma: Normalized projection errorCompressed oscillator position measurements › Exact objects and state approximation · Em04-A@2#lem:projection, Em04-A@2#eq:stateerror · proof attached · lines 1074–1105
Open as its own pageFor any oscillator state , suppose
Embedding into the full space,
For any finite state ,
Every effect-probability difference is bounded by the corresponding trace distance.
Proof. A purification of and its normalized projection have overlap . Their pure-state trace distance is , by diagonalizing their difference on their two-dimensional span. Partial trace is contractive, proving the first assertion. The triangle inequality proves (eq:stateerror). For an effect , the Jordan decomposition of a trace-zero state difference gives .
sectionExact objects and state approximationCompressed oscillator position measurements › Exact objects and state approximation · lines 1105–1109
Open as its own pageNormalized projection is a preparation comparison, not a claim that postselected normalization defines a linear deterministic channel.
propositionProposition: Coherent-state truncation and displacementCompressed oscillator position measurements › Exact objects and state approximation · Em04-A@2#prop:coherent, Em04-A@2#eq:dispbound · proof attached · lines 1110–1171
Open as its own pageFor finite , let and
Its omitted probability is
For and ,
for , .
Define
These preparations need not agree, but
where
Proof. The squared coefficients are Poisson probabilities. For a Poisson variable , . Choose .
For displacement, write , , and . Differentiation gives
with boundary source
Variation of constants and unitarity of give . Normalization adds vector distance . Pure-state trace distance is at most the vector distance, proving (eq:dispbound).
sectionComposite trapezoidal approximationCompressed oscillator position measurements › Composite trapezoidal approximation · Em04-A@2#eq:trapezoid, Em04-A@2#eq:trapbudget · lines 1173–1209
Open as its own pageLet
Set
For real , , and .
Fix . Suppose is a finite union of intervals, partitioned into cells of widths . Boundary points have zero position probability and may be assigned consistently to either bin. Define the exact-arithmetic trapezoidal matrix
and
This rule retains positive weights and half-weight endpoints. It is the quadrature to be checked against the reported simulator.
theoremTheorem: Trapezoidal operator-error boundCompressed oscillator position measurements › Composite trapezoidal approximation · Em04-A@2#thm:trap, Em04-A@2#eq:traperror · proof attached · lines 1210–1231
Open as its own pageThe matrix in (eq:trapezoid) is positive and
Proof. Positivity follows from positive weights. Twice integrating by parts, componentwise, gives for one cell
Since , taking operator norms and summing proves the claim.
remarkRemark: Midpoint alternativeCompressed oscillator position measurements › Composite trapezoidal approximation · lines 1233–1244
Open as its own pageThe earlier midpoint construction is also valid as a different rule:
Taylor expansion at each midpoint proves this bound. A midpoint certificate must not be attached to a trapezoidal implementation.
lemmaLemma: A cellwise derivative-enclosure interfaceCompressed oscillator position measurements › Composite trapezoidal approximation · Em04-A@2#lem:Gbound · proof attached · lines 1246–1269
Open as its own pageOn a cell , suppose validated bounds satisfy
Then
Proof. Differentiate to obtain
A rank-one matrix has operator norm . The triangle inequality proves the bound.
sectionComposite trapezoidal approximationCompressed oscillator position measurements › Composite trapezoidal approximation · lines 1269–1285
Open as its own pageThe must enclose entire cells, not just sampled values. They can be obtained from outward-rounded evaluations of the Hermite formula and its derivatives, with subdivision when necessary. The computable bounds in Lemma lem:Gbound remove the need for an unverified sampled operator-norm supremum.
Arbitrary-precision ball-arithmetic integration with rigorous error bounds is an established methodology Johansson. That reference supplies a general numerical method, not an executed certificate for this manuscript. If complex-analytic integration is used for oscillator entries, the holomorphic integrand is , whose restriction to the real axis is the required product. Extending a real-axis conjugate expression as would not give a holomorphic integrand.
theoremTheorem: Probability comparison with arithmetic errorCompressed oscillator position measurements › Separate preparation, tail, quadrature, and arithmetic errors · Em04-A@2#thm:bosonerror, Em04-A@2#eq:bosonbudget, Em04-A@2#eq:tail · proof attached · lines 1288–1338
Open as its own pageLet be an oscillator state, a density matrix on , and a Hermitian numerical matrix with a certified bound
Then
The tail term is bounded by
The preparation term can use (eq:stateerror) and (eq:dispbound). A separately rounded scalar evaluation of the trace requires its own additional certified error.
Proof. Insert the exact probabilities for on , then on , followed by the exact trapezoidal value. The effect inequality in Lemma lem:projection, the outside-domain probability, Theorem thm:trap, and the arithmetic norm bound control the four differences.
The pointwise inequality proves the first tail bound. For a vector ,
A convex decomposition proves the mixed-state bound.
remarkRemark: Raw numerical values need not be probabilitiesCompressed oscillator position measurements › Separate preparation, tail, quadrature, and arithmetic errors · lines 1340–1346
Open as its own pageExact trapezoidal matrices are positive, but may exceed the identity or fail bin completeness. Rounded matrices may even lose positivity. Thus the raw scalar in (eq:bosonbudget) is an approximation, not automatically a measurement probability. No numerical clipping is implicit in the theorem.
theoremTheorem: Completed POVM with a bin-independent error boundCompressed oscillator position measurements › Arithmetic-aware completion to a genuine POVM · Em04-A@2#thm:completion, Em04-A@2#eq:arithrepair, Em04-A@2#eq:completion, Em04-A@2#eq:TVcompletion · proof attached · lines 1350–1425
Open as its own pagePartition into interval bins , and let
Suppose and certified nonnegative bounds satisfy
Define
and
These are the effects of a valid POVM. For each interior bin,
For every finite input state, the total variation distance from the exact compressed-position law, including the outside bin, is at most
For a full-space state and finite preparation , comparison with the full exact position law for the same bins adds at most .
Proof. The arithmetic bound gives , so . Also . Writing and ,
Thus , and the effects sum to the identity. The individual norm estimate follows from
For a finite input state, put and . Then
The completed interior probability difference is
Consequently
The outside difference is , so total variation is no greater than . It is also at most one. Finally, applying any exact POVM contracts state trace distance to outcome total variation; the triangle inequality proves the last assertion.
remarkRemark: What is and is not completedCompressed oscillator position measurements › Arithmetic-aware completion to a genuine POVM · lines 1427–1446
Open as its own pageThe shift in (eq:arithrepair) is essential unless positivity of the numerical has been independently certified. Scaling an arbitrary rounded matrix alone cannot repair a negative eigenvalue.
The displayed effects are exact mathematical matrices defined by the stored centers and certified bounds. Exact rational centers and rational outward bounds permit an exact rational completion. If the completed effects or reported probabilities are subsequently rounded, those errors require additional enclosures.
One possible finite instrument uses update operators . The effect-law estimate above does not, by itself, certify an approximation of a particular post-measurement instrument. Because the exact outside effect is included, its probability is retained rather than postselected away. The domain-tail bound is needed when outside events are omitted or when a truncated raw quadrature is compared as in (eq:bosonbudget).
Validated dynamical residual interfaces
sectionExact vectorized generatorValidated dynamical residual interfaces › Exact vectorized generator · lines 1451–1468
Open as its own pageWith column-stacking, . If projects onto diagonal entries, then
The matrix-exponential representation is exact but not an execution claim. Storing requires entries; a dense generator need not be stored.
theoremTheorem: Cellwise a posteriori residual boundValidated dynamical residual interfaces › Accuracy without a positivity assumption · Em04-A@2#thm:residual, Em04-A@2#eq:residual, Em04-A@2#eq:rawreconstruction · proof attached · lines 1471–1528
Open as its own pageFix the scaled generator
Let , and let be continuous, Hermitian, and piecewise continuously differentiable. No positivity or trace condition is required. Define on each cell
Suppose validated bounds give
For ,
For exact survival , the Hermitian reconstruction
satisfies
It is a density matrix only if is positive and has trace one.
Proof. The error satisfies on each cell. Continuity allows variation of constants over the whole interval:
The propagator is CPTP and contracts trace norm on Hermitian matrices. Integrating the cell bounds proves (eq:residual). The reconstruction difference is , whose trace norm is , proving (eq:rawreconstruction).
corollaryCorollary: Survival approximation and diagnostic errorValidated dynamical residual interfaces › Accuracy without a positivity assumption · Em04-A@2#cor:residualdiagnostics · proof attached · lines 1530–1563
Open as its own pageUnder Theorem thm:residual, suppose , , and reconstruct with . Then, without a positivity assumption,
If is a density matrix, this is a trace-distance certificate after division by two. With exact , the physical reconstructed approximation obeys
Proof. Write
The first parenthesis has trace norm two. For concurrence, use the Hermitian off-diagonal inequality from Theorem thm:largechi. For purity,
sectionFinite polynomial data and arithmetic enclosureValidated dynamical residual interfaces › Finite polynomial data and arithmetic enclosure · lines 1565–1577
Open as its own pageOn a cell of width , choose a concrete polynomial
Store its coefficients and endpoint-matching conditions. Its derivative is explicit. Outward-rounded interval or ball evaluation must enclose the residual on the entire cell, including input-parameter and coefficient-evaluation uncertainties.
propositionProposition: Entrywise certificateValidated dynamical residual interfaces › Finite polynomial data and arithmetic enclosure · Em04-A@2#prop:entrywise · proof attached · lines 1578–1597
Open as its own pageIf certified bounds satisfy
then an admissible residual bound is
with the displayed value rounded upward.
Proof. For singular values , Cauchy–Schwarz gives . Hence . The entrywise bounds enclose its Frobenius norm.
sectionFinite polynomial data and arithmetic enclosureValidated dynamical residual interfaces › Finite polynomial data and arithmetic enclosure · lines 1597–1609
Open as its own pageSampling the residual at solver output times does not certify this supremum. The trace norm is not a holomorphic integrand in general; an analytic integration routine must not be applied to it without an appropriate enclosure argument. The conservative cellwise bound above avoids that issue.
If a piecewise approximation has jumps instead of matching endpoints, variation of constants additionally charges the trace norm of every jump before the observation time. A certificate must either verify continuity or include those jump terms.
propositionProposition: Certified positivity repairValidated dynamical residual interfaces › Physicality repair with a charged error · Em04-A@2#prop:physicalrepair · proof attached · lines 1612–1646
Open as its own pageLet , exactly, and suppose a certified number gives . Define
Then is a density matrix and
If , then
Proof. Positivity and trace normalization follow directly. The negative spectral mass of is at most , so . Also
Taking norms gives
The final assertion is the triangle inequality.
sectionPhysicality repair with a charged errorValidated dynamical residual interfaces › Physicality repair with a charged error · lines 1646–1654
Open as its own pageFor example, an outward-enclosed Gershgorin lower bound can certify . Such a bound may be conservative. If trace one is not exact, any trace correction must also be charged. The repair is a controlled approximation operation, not a claim that the repaired trajectory solves the original ODE or defines a linear CPTP evolution.
Mathematical release and remaining verification gates
theoremTheorem: Em04-A analytical releaseMathematical release and remaining verification gates · Em04-A@2#thm:release · proof attached · lines 1658–1698
Open as its own pageUnder the explicitly stated hypotheses:
The chain has a unique physical evolution and the exact reduction (eq:reduction).
Concurrence, the complete partial-transpose spectrum, logarithmic negativity, separability, purity, and coherence have the proved formulas and bounds above.
Protocol-B scaling uses , and single- universality fails in general.
The localized preparation generates entanglement, with the stated dissipative decay and conditional mixing conclusions.
Finite-window unitary and detuning comparisons, the two-site benchmark, and the residual interfaces hold.
Specified finite local instruments and readout types satisfy the proved probability, completeness, locality, no-signaling, and deferral identities.
Compressed oscillator position effects form a POVM, with the proved preparation, trapezoidal, tail, arithmetic, and completed-measurement error bounds.
The release is analytical. It does not assert completed source alignment, numerical regression, instantiated validated certificates, successful compilation, machine verification, or any excluded physical identification.
Proof. Lemma lem:physical and Theorem thm:reduction prove (i). Theorems thm:concurrence, thm:negativity, and Corollary cor:diagnostics prove (ii). Theorems thm:scaling and thm:shorttime prove (iii). Theorems thm:transient and thm:mixing prove (iv). Theorem thm:largechi, Propositions prop:disorder, prop:twosite, and the results of Section sec:residual prove (v). Theorems thm:instruments and thm:deferral prove (vi). The results of Section sec:bosonic prove (vii). None of those arguments requires an executed evidence package.
sectionMathematical release and remaining verification gatesMathematical release and remaining verification gates · lines 1698–1706
Open as its own pageThermal raising, higher-excitation or GHZ preparations, nonuniform relaxation, and additional interactions require separate hypotheses and equations. General finite GKSL physicality does not supply the model-specific reduction for these extensions.
Reported source correspondences and extraction requirements
sectionReported source correspondences and extraction requirementsReported source correspondences and extraction requirements · lines 1708–1757
Open as its own pageThe following table records the implementation descriptions in the supplied verification plan. It is a model-contract checklist, not a completed source audit.
{}1.15
Mathematical contract Reported implementation correspondence Excited basis vector basis(2, 1)Lowering matrix destroy(2); verify its entries and tensor placementOne-excitation hopping 0.5 * JmultiplyingRelaxation Zero-occupation downward collapse operator Dephasing Reported local dephasing collapse operator; verify prefactor Localized preparation initial_state(N, "single")No bath raising n_thermal == 0Uniform rates Common relaxation and dephasing parameters Position quadrature Reported composite trapezoidal construction; verify cells, endpoints, weights, and bin assignments For every row, a completed audit must record the export hash, source file, line range, actual expression, checked restriction, and outcome. The sentence “agrees by source-level inspection” is admissible only after that record exists.
The plan also reports notebook commands such as
!pipand!cp, and a secondfrom __future__ import annotationsinside a combined export. Preserve the export unchanged. Extract ordinary Python modules with any future import at the beginning of each module; isolate notebook installation and copy commands from model execution. The presence and exact locations of these reported export issues also require source inspection.
Independent verification and evidence-package specification
sectionIndependent verification and evidence-package specificationIndependent verification and evidence-package specification · lines 1759–1763
Open as its own pageThis appendix specifies future acceptance tests. It does not report their execution.
sectionIndependent algebra checksIndependent verification and evidence-package specification › Independent algebra checks · lines 1764–1793
Open as its own pageFor the partial-transpose test, generate a positive matrix independently of the dynamical code, for example
Embed it into the full tensor space and transpose directly:
Compare the full spectrum, including multiplicities, with (eq:PTspec). The transpose routine must not construct its answer from the theorem's spectrum.
Use , contiguous and noncontiguous cuts, complex coherences, pure and mixed matrices, , positive vacuum weight, and . Also test , for which the full state is the vacuum even though no normalized conditional matrix is determined by .
For the short-time check, independently form and from matrix-unit operations. Include unequal detunings and . Compare with the two-site closed form as a separate benchmark. Written derivations are supplied in the main text; an independently executed symbolic check remains a distinct gate.
sectionFull and reduced solver regressionIndependent verification and evidence-package specification › Full and reduced solver regression · lines 1794–1851
Open as its own pageThe full implementation must build the tensor Hamiltonian and local collapse operators. The reduced implementation should independently implement
as a matrix equation and reconstruct with the exact survival law.
QuTiP documents dictionary options and distinguishes solver options from integrator-specific options QuTiPOptions. An illustrative, unexecuted configuration is:
options = "store_states": True, "method": "bdf", "atol": 1e-10, "rtol": 1e-10, "normalize_output": False, "progress_bar": "",
The normalization option is documented in the solver source QuTiPSolver. Query the installed version's actual interface:
help(MESolver.options) help(MESolver.integrator("bdf").options)
Archive the package version, integrator, effective options, time grid, initial density matrix, tensor ordering, and input parameters. Use explicit density matrices in both representations, including nondissipative comparisons, so that a ket-based alternative solver path does not silently change the experiment.
Cover no dissipation, each channel separately, both channels, zero and unequal detunings, localized and mixed one-excitation preparations, and simultaneous scaling partners. Compare
and all stated diagnostics using independently constructed full-space reductions and partial transposes.
A proposed initial regression threshold is at all predeclared observation times. Declare separate diagnostic thresholds before execution, repeat with tighter integration tolerances, and retain raw Hermiticity, trace, and minimum-eigenvalue diagnostics. A tolerance value is not a rigorous global-error bound.
Negative tests must reject application of the scalar-survival theorem to raising operators, unsupported initial sectors, and unsupported nonuniform relaxation. They should reject the claimed formula, not falsely claim that every smaller invariant block is lost.
sectionValidated quadrature and residual recordsIndependent verification and evidence-package specification › Validated quadrature and residual records · lines 1852–1882
Open as its own pageA position certificate must contain:
dimensions, bins, domain endpoints, and exact quadrature weights;
the identified finite preparation and its error to the target;
cellwise bounds for , quadrature totals, and arithmetic errors including wavefunction evaluation;
numerical centers , positivity shifts, total , completed effects, and the outside effect;
backend, precision, outward-rounding conventions, and scalar readout errors;
target error, certified upper bound, and pass/fail outcome.
A residual certificate must contain:
exact model data or certified enclosures for those data;
time endpoints and concrete Hermitian polynomial coefficients;
matching conditions or charged jump bounds;
initial-error enclosure and whole-cell residual enclosures;
each , the final partial-cell contribution, and total ;
survival-error budget, physicality status, and any charged repair;
backend, precision, target accuracy, and pass/fail outcome.
Changing , , quadrature cell widths, time-cell widths, polynomial degree, and arithmetic precision addresses different terms. A failed or overly large certificate must remain visible. Ordinary agreement between two solvers does not replace these records.
sectionCompilation and reference auditIndependent verification and evidence-package specification › Compilation and reference audit · lines 1883–1907
Open as its own pageAn automated build specification is:
latexmk -norc -pdf -Werror -halt-on-error -file-line-error \ -interaction=nonstopmode -outdir=build Em04-A-v2.tex
The
-pdfroute uses pdfLaTeX, and latexmk manages repeated passes. Its-Werroroption treats unresolved or multiply defined references and citations as errors after the final pass Latexmk. It does not promote every typographical warning to an error. Inspect the complete log and rendered PDF, including overfull boxes, equations, tables, and page breaks. Retain the build environment, command, exit status, transcript, final log, and PDF hash.Compilation verifies document construction, not the proofs. No successful build is claimed here.
For every bibliography entry, an audit record should identify its primary source, authors, title, publication data, identifier, version where relevant, and the exact role of the citation. Bibliographic metadata and the applicability of a cited theorem are separate checks. Mutable software documentation requires a pinned commit or archived snapshot before reproducibility is claimed.
sectionArchive layout and claim registerIndependent verification and evidence-package specification › Archive layout and claim register · lines 1908–1977
Open as its own pageA suggested package is:
Em04-A-verification/ manuscript/ Em04-A-v2.tex revision_notes.md source/ original_pipeline.txt full_chain_model.py reduced_chain_model.py tests/ algebra_checks.py solver_comparison.py quadrature_checks.py certificates/ residual_bounds.json position_povm_bounds.json evidence/ environment.json compilation.log references_audit.csv verification_report.md claims_register.csv
This is a proposed layout, not a list of files created by this manuscript. Preserve original material unchanged and hash versioned artifacts.
{}1.15
Claim class Evidence required Present status Analytical model theorems Explicit proofs and hypotheses in the main text Proved here Error-bound interfaces Residual, quadrature, arithmetic, and completion proofs Proved here Source alignment Archived export and source-location audit Reported mappings; audit pending Independent algebra execution Symbolic output and independently coded transpose tests Unverified Solver regression Reproducible runs and predeclared thresholds Unverified Instantiated numerical certificates Validated enclosures and finite accepted budgets Unverified Compilation and PDF inspection Successful build record and visual inspection Unverified Archived bibliography audit Per-entry primary-source and applicability records Pending The complete verification package is not released until the execution-dependent gates have evidence. The analytical manuscript does not acquire a “fully verified pipeline” designation merely by providing the acceptance specification.
Documentary non-transfer boundary
sectionDocumentary non-transfer boundaryDocumentary non-transfer boundary · lines 1979–1992
Open as its own pageThe supplied programme identifiers serve only as documentary bookkeeping. No result here closes O.1, opens the downstream quantum-admission exit called XV-B, discharges the XIV–XV characteristic-product chain, admits its separate quantum coefficient, or changes XVI-N's hypotheses or discharges its Route B.
Comparisons with I, IV, En02-A, X-Enter, or Em03-H do not supply the present generator, its reduction, or a gravitational identification. A restriction on an earlier programme is not a premise of the spin-chain proof. This appendix does not claim a new audit of those manuscripts or an exhaustive corpus scan.
Revision and citation-role notes
sectionRevision and citation-role notesRevision and citation-role notes · lines 1994–2025
Open as its own pageVersion 2 makes the following substantive corrections:
It separates reported source availability from completed source inspection and from executed verification.
It includes every partial-transpose eigenvalue and zero multiplicity, including the zero cross-block case.
It states the finite-coordinate hypothesis and supplies the physical-time expansion at zero dissipation.
It uses the trapezoidal constant for the reported trapezoidal implementation, retaining the midpoint rule only as a labeled alternative.
It includes arithmetic errors, a positivity repair for rounded quadrature matrices, and a bin-independent completed-law bound.
It distinguishes residual accuracy from positivity, provides whole-cell entrywise certificates, and charges any repair.
It corrects the reconstruction norm notation and avoids interpreting a perturbation bound as a sharp-threshold theorem.
It moves unrelated programme identifiers outside the main proof.
The foundational semigroup references support the framework; they do not prove this chain's invariant-sector calculation. Wootters and Vidal–Werner supply diagnostic definitions, while the specialized matrix formulas are derived here. Baumgratz–Cramer–Plenio supplies the basis-coherence framework. Watrous supplies finite-channel background. Johansson supplies a rigorous-integration methodology, not a completed numerical enclosure. QuTiP and latexmk documentation support the proposed execution interfaces, not mathematical accuracy or a successful run.
bibliographyReferencesRevision and citation-role notes · lines 2026–2109
Open as its own pageGKS
V. Gorini, A. Kossakowski, and E. C. G. Sudarshan, “Completely positive dynamical semigroups of -level systems,” Journal of Mathematical Physics 17, 821–825 (1976). DOI:
10.1063/1.522979.Lindblad
G. Lindblad, “On the generators of quantum dynamical semigroups,” Communications in Mathematical Physics 48, 119–130 (1976). DOI:
10.1007/BF01608499.Kuramochi
Y. Kuramochi, “Nonstandard derivation of the Gorini–Kossakowski–Sudarshan–Lindblad master equation of a quantum dynamical semigroup from the Kraus representation,” arXiv:
2406.03775v2, 15 June 2024.Wootters
W. K. Wootters, “Entanglement of formation of an arbitrary state of two qubits,” Physical Review Letters 80, 2245–2248 (1998). DOI:
10.1103/PhysRevLett.80.2245. arXiv:quant-ph/9709029.VidalWerner
G. Vidal and R. F. Werner, “Computable measure of entanglement,” Physical Review A 65, 032314 (2002). DOI:
10.1103/PhysRevA.65.032314. arXiv:quant-ph/0102117.BCP
T. Baumgratz, M. Cramer, and M. B. Plenio, “Quantifying coherence,” Physical Review Letters 113, 140401 (2014). DOI:
10.1103/PhysRevLett.113.140401. arXiv:1311.0275.Watrous
J. Watrous, The Theory of Quantum Information, Cambridge University Press (2018). Chapters 2–3: finite quantum operations and state distances.
Johansson
F. Johansson, “Numerical integration in arbitrary-precision ball arithmetic,” arXiv:
1802.07942v1, 22 February 2018. DOI:10.48550/arXiv.1802.07942.QuTiPOptions
QuTiP developers, “Setting options for the dynamics solvers,” official QuTiP repository documentation,
doc/guide/dynamics/dynamics-options.rst,masterbranch. The branch is mutable; an execution archive must identify its actual commit or snapshot.QuTiPSolver
QuTiP developers, official solver source and option documentation,
qutip/solver/mesolve.pyandqutip/solver/integrator/scipy_integrator.py,masterbranch. These describe normalization, solver settings, and integrator-specific tolerances; an execution must pin its installed version.Latexmk
J. Collins, latexmk: General Commands Manual, version 4.88, 9 March 2026. CTAN distribution documentation,
support/latexmk/latexmk.pdf. Used for build-option semantics and multipass reference resolution.