Dephasing and Amplitude Damping
A coherence time becomes a channel parameter only after the experiment that produced it has been frozen. This page gives a reproducible crosswalk from protocol-qualified longitudinal relaxation, transverse coherence, and equilibrium-population records to one finite-time phase-covariant qubit channel. The workflow fixes the energy basis and retained subspace, converts the record without counting relaxation twice, translates among density-matrix, Bloch-affine, Pauli-transfer, Kraus, and Choi descriptions, composes scheduled idles in circuit order, and checks held-out population and coherence predictions. It does not infer a bath Hamiltonian, a noise spectrum, or a universal Markov model from a decay curve.
Required background. Quantum Channels for QI supplies the column Pauli-transfer and affine conventions, representation translation, composition order, and finite physicality checks. Dephasing versus Dissipation supplies the population-versus-coherence distinction and the energy-basis language used here without rederiving open-system dynamics.
Helpful background. Common Noise Models supplies the broader model-card and parameter ledger. Metrics for Quantum Hardware supplies protocol, fit-law, uncertainty, and validity-interval reporting.
Dephasing and Relaxation as Distinct Channel Geometry
Section titled “Dephasing and Relaxation as Distinct Channel Geometry”Population flow and transverse coherence
Section titled “Population flow and transverse coherence”Fix the ordered energy basis before naming any decay parameter:
Longitudinal relaxation changes the energy populations and generally translates the Bloch vector toward a thermal fixed point. Dephasing suppresses the off-diagonal element in this basis without, by itself, changing those populations. Bloch’s phenomenological equations already separate longitudinal and transverse relaxation, while Breuer and Petruccione give the modern open-system formulation. This page uses that separation as an input convention; the physical distinction and its limits remain at the prerequisite owner.
For one declared interval, the most useful phase-covariant map is
Here is the surviving population difference, is the equilibrium excited-state population, and is a complex coherence factor. The map separates population contraction, fixed-point translation, transverse contraction, and coherent phase. Those four features are experimentally distinguishable and should not be collapsed into one “decoherence rate.”
Timescale labels are protocol summaries
Section titled “Timescale labels are protocol summaries”A reported , , or is the parameter of a stated fit, not a self-sufficient property of an abstract qubit. Ramsey’s separated-oscillatory-field method and Hahn’s echo sequence establish different experimental sensitivities. Modern analyses by Ithier and collaborators show how control sequence, noise spectrum, and device operating point enter observed decay. Even the word “exponential” is a model choice: an envelope can instead be Gaussian, stretched exponential, multi-exponential, oscillatory, or interrupted by drift.
The record must therefore include the preparation and readout convention, pulse sequence, rotating frame, fit function, fit window, uncertainty, and epoch. A Ramsey is ordinarily sensitive to slowly varying detuning that an echo suppresses. An echo time and a longer dynamical-decoupling time probe different filtered bands. Degen, Reinhard, and Cappellaro review this filter-dependent viewpoint for quantum sensing; Bylander and collaborators demonstrate it in superconducting-qubit noise spectroscopy. These sources support protocol dependence, not permission to infer a unique spectrum from one fitted number.
What this page owns
Section titled “What this page owns”The output here is a finite, testable channel record for a retained two-level system at a named circuit location. Dephasing Channel owns the formal phase-flip and phase-damping channel definitions, environment-record and random-phase pictures, higher-dimensional extension, and formal semigroup limit. Amplitude-Damping Channel owns the zero-temperature definition, dilation, fixed point, and formal thermal extension. Kraus, Choi, and Stinespring Views owns minimal realizations and Kraus freedom.
The master-equation leaves own generator derivations and rate conventions; Metrics for Quantum Hardware owns how , , and state occupancy are acquired and reported; Noise Simulation owns scalable scheduling and sampling algorithms. The narrower task here is conversion, physicality, composition, prediction, and falsification. Nielsen and Chuang and Watrous provide the general channel framework used for those finite checks, but no representation conversion alone establishes a microscopic mechanism.
Freeze the Coherence-Time Record
Section titled “Freeze the Coherence-Time Record”Energy basis, retained subspace, and equilibrium state
Section titled “Energy basis, retained subspace, and equilibrium state”Record which pair of physical levels is called and whether population outside that pair is discarded, postselected, or represented explicitly. A trace-preserving qubit channel is inappropriate if appreciable leakage leaves the retained subspace without a return or flag model. Also specify whether readout labels have been corrected for assignment error and whether the stated ground and excited preparations are physical preparations or fitted endpoints.
Define
This convention makes at zero temperature and for an equally populated doublet. A residual excited-state population may reflect a thermal distribution, nonequilibrium quasiparticles, imperfect reset, readout bias, or leakage. Calling it a temperature requires additional calibration and a licensed equilibrium model. Makhlin, Schön, and Shnirman discuss relaxation and dephasing in solid-state qubits while emphasizing their device dependence.
Pulse sequence, fit law, window, and uncertainty
Section titled “Pulse sequence, fit law, window, and uncertainty”Freeze the inversion-recovery sequence used for and the Ramsey, echo, or decoupling sequence used for transverse coherence. State whether the fitted population is , a thermal recovery about , or another law. For transverse data, retain both quadratures when available and record any fitted detuning. If the complex envelope is , the magnitude and phase are separate observables.
The fit window matters because a local exponential can summarize a nonexponential curve over a restricted interval. Report confidence intervals or posterior uncertainty, residual structure, number of repetitions, and any preprocessing. Do not combine a measured in one epoch with a measured after recalibration without labeling that assumption. Cywiński and collaborators show explicitly how pulse sequences reshape dephasing under low-frequency noise, so a fit parameter cannot be transported across sequences merely because its units are time.
Interval, circuit placement, context, and validation target
Section titled “Interval, circuit placement, context, and validation target”Name the channel interval : an idle between two gates, a measurement latency, a reset wait, or another scheduled segment. State whether the map is placed before or after a basis-changing ideal gate and which frame defines and . Record simultaneous activity, spectator state, control amplitudes, temperature, calibration epoch, and any conditioning variables. These details determine whether one parameter set can be reused.
Finally, name the held-out claim before fitting: perhaps and at unused times, both Ramsey quadratures, or an idle fidelity after an explicitly modeled virtual- correction. A bare time constant has no such prediction contract. The figure summarizes the conversion path and the three cautions that must remain visible throughout it.
A protocol-qualified record becomes a finite channel only after basis, subspace, sequence, fit, context, interval, and fixed point are frozen. The physicality and composition audits do not upgrade a one-time fit into a semigroup.
Dephasing Convention Crosswalk
Section titled “Dephasing Convention Crosswalk”Complex coherence factor
Section titled “Complex coherence factor”Write the measured finite-time factor as
The magnitude is the total transverse contraction over the declared interval. The phase is a coherent -axis frame rotation in the stated sign convention. If a detuning or virtual- correction removes it, report both the raw and corrected predictions; do not silently replace by . The phase convention is fixed by : positive yields the transverse matrix used below, not its transpose.
A standalone dephasing factor describes only the part remaining after relaxation-induced coherence loss has been removed. In the matched Markov model it is real and nonnegative. A measured negative or complex factor can still define a finite channel, but then it includes a coherent phase or a sign reversal and should not be forced into a stochastic phase-flip probability without declaring the extra unitary.
Phase-flip and phase-damping parameters
Section titled “Phase-flip and phase-damping parameters”For real , the stochastic phase-flip ledger is
An alternative phase-damping ledger uses
Complete dephasing is , so and . The endpoint is instead the unitary channel: it preserves the magnitude of coherence and reverses its sign. Confusing those endpoints is a common consequence of calling every displayed parameter “dephasing probability.” The formal dephasing owner derives the corresponding Kraus and Choi forms; this page uses the ledgers only to translate a qualified finite factor.
Markovian rate and nonexponential envelope
Section titled “Markovian rate and nonexponential envelope”Under an exponential pure-dephasing model,
That formula licenses multiplicative composition only when the same time-homogeneous, memoryless model applies across the composed intervals. A measured envelope can define a CPTP dephasing map at each sampled time whenever , yet fail . Gaussian quasistatic decay is the principal fixture below. A stretched exponential is multiplicative only for .
Gorini, Kossakowski, and Sudarshan and, independently, Lindblad characterize generators of quantum dynamical semigroups. Their results justify exponential composition under their assumptions; they do not make every finite CPTP fit divisible. This distinction is why the phrase time-indexed family is used for a collection of one-time maps whose cross-time law has not been established.
| quantity | symbol | protocol or definition | channel role | allowed range or licensed condition | common failure |
|---|---|---|---|---|---|
| longitudinal relaxation time | qualified population-recovery fit | sets in an exponential model | for that fit and context | treated as a context-free constant | |
| homogeneous transverse time | qualified exponential echo or homogeneous fit | sets total | ; sequence must be named | confused with Ramsey | |
| Ramsey inhomogeneous time | Ramsey envelope with stated fit law | summarizes Ramsey coherence | protocol and bandwidth dependent | substituted for another sequence | |
| pure-dephasing time | sets additional | matched exponential Markov model | inferred when the rate difference is negative | ||
| population-difference survival | or finite fit | contracts | here | confused with relaxation probability | |
| relaxation probability | weights thermal jumps | used as an amplitude rather than a probability | |||
| equilibrium excited population | qualified long-time population | fixes affine translation | called a temperature without evidence | ||
| complex coherence factor | ratio | contracts and rotates | exact Choi bound below | phase discarded without a correction | |
| pure-dephasing factor | in matched model | adds dephasing beyond relaxation | in that model | relaxation contribution counted twice | |
| phase-flip probability | stochastic- ledger | for nonnegative contraction | called complete dephasing | ||
| phase-damping parameter | environment-record ledger | identified numerically with |
Zero- and Finite-Temperature Amplitude Damping
Section titled “Zero- and Finite-Temperature Amplitude Damping”Zero-temperature amplitude damping
Section titled “Zero-temperature amplitude damping”At zero temperature the equilibrium excited population is . With , the usual two-Kraus channel is
It sends and . Thus relaxation alone contributes half its population-decay rate to transverse decay. The channel is nonunital because it translates every state toward . It is not a Pauli channel and should not be simulated as a random event: a jump probability depends on the state, and the no-jump branch also changes amplitudes.
Use this zero-temperature form only when upward excitation is negligible for the stated interval and validation precision. A nonzero stationary excited population is direct evidence that the two-Kraus fixed point is wrong, even if the early-time decay of an initially excited state looks approximately exponential.
Upward and downward thermal rates
Section titled “Upward and downward thermal rates”For a Markovian two-level thermal-rate model, define
The finite interval has
Upward and downward rates determine the fixed point as well as the approach rate. If only is reported, their sum is known but their ratio is not. Conversely, together with a qualified determines and within this model. Detailed-balance or effective-temperature interpretations belong to the thermal master-equation owner and require an equilibrium assumption.
Generalized amplitude damping and its fixed state
Section titled “Generalized amplitude damping and its fixed state”An ordered Kraus family with the required fixed point is
Direct multiplication gives . The population update is , and the fixed state has excited population . This Kraus family contributes coherence factor regardless of the fixed point. An independently licensed pure-dephasing channel with factor and a declared phase then gives .
The four operators are a useful physicality certificate, not four uniquely observable histories. Kraus representations can be unitarily mixed without changing the unread channel. Ruskai, Szarek, and Werner analyze the geometry of qubit CPTP maps and supply the broader setting for the affine constraints used below.
One Channel from T1, T2, and Thermal Occupancy
Section titled “One Channel from T1, T2, and Thermal Occupancy”Longitudinal survival and thermal translation
Section titled “Longitudinal survival and thermal translation”For a matched exponential record, translate the longitudinal fit first:
Then
This equation predicts both preparation directions. From , ; from , . Their difference is exactly , while their long-time limit is . Fitting both curves helps separate translation from contrast and preparation errors.
The affine form also makes the zero-temperature and infinite-temperature limits transparent. At , approaches . At , the translation vanishes and population relaxation becomes unital on the retained qubit, even though energy exchange still occurs microscopically.
Remove the relaxation contribution once
Section titled “Remove the relaxation contribution once”Only under an exponential, two-level, phase-covariant Markov model with an independent pure-dephasing term may one write
and therefore
Amplitude damping already supplies . Composing it with an additional dephasing factor would give and count relaxation twice. The correct additional factor is . This bookkeeping is central to the model cards in Common Noise Models; here it is carried through all representations and predictions.
Reject an unlicensed T1–T2 record
Section titled “Reject an unlicensed T1–T2 record”The matched rate relation implies . If a fitted central value violates the inequality, do not clip or set without investigation. Audit whether and used the same levels, sequence labels, epoch, fit window, and operating context. Propagate their uncertainty. Check SPAM offsets, detuning, leakage, nonstationarity, and whether either envelope was nonexponential.
The exact finite-map Choi bound is weaker at nonzero , so some one-step CPTP maps lie outside the independent semigroup construction. Such a map can be retained as a finite empirical channel if it passes physicality and held-out tests, but it does not license an interpolating . The response to a failed model assumption is a narrower or richer model, not a stronger claim.
| model or record | population action | coherence action | fixed point or envelope | licensed use | principal falsifier |
|---|---|---|---|---|---|
| zero-temperature amplitude damping | negligible upward excitation | nonzero stationary excitation | |||
| pure dephasing | populations unchanged | declared transverse envelope | fixed energy basis and no population flow | changing populations | |
| matched Markov T1–T2 idle | thermal affine relaxation | common exponential rates | matched two-level stationary record | or composition failure | |
| thermal relaxation | approaches | contributes | thermal two-level fixed point | qualified upward/downward process | drifting or preparation-dependent fixed point |
| coherent detuning | populations unchanged | unit-modulus phase | calibrated frame rotation | transverse contraction | |
| quasistatic Ramsey decay | populations handled separately | often Gaussian | nonexponential Ramsey envelope | one-time Ramsey prediction | exponential composition assumed |
| echo or dynamical-decoupling envelope | populations handled separately | sequence-specific | filtered-band envelope | same pulse sequence and context | transfer to another sequence |
| piecewise phase-covariant schedule | affine map per segment | ordered factors | segment-specific fixed points | frozen ordering and bases | scalar composition across basis changes |
Bloch, Affine, and Pauli-Transfer Predictions
Section titled “Bloch, Affine, and Pauli-Transfer Predictions”Bloch and affine update
Section titled “Bloch and affine update”Let . From the declared relation , the exact Bloch update is
Thus the transverse disk contracts by and rotates according to the phase convention, while the longitudinal coordinate contracts and translates. A diagonal-only Bloch matrix would miss thermal population flow. Conversely, a translation does not affect the evolution of the difference between two initial values; that difference still shrinks by .
Physical predictions follow without constructing Kraus operators. For input populations, use . For Ramsey data, the measured in-phase and quadrature signals are proportional to and after the declared analysis pulses. This is why both quadratures are needed to separate contraction from coherent detuning.
Pauli-transfer matrix and ordered phase convention
Section titled “Pauli-transfer matrix and ordered phase convention”Use column coordinates and Pauli order . Then
The first row expresses trace preservation in this convention. The lower entry in the first column expresses nonunital translation. Multiplication acts right to left: if is applied first and second, the composite is . Transposing the matrix or reversing the phase sign without simultaneously changing the state-vector and coherence conventions produces a different channel.
Pauli-transfer coordinates are convenient for circuit composition, but they do not by themselves certify complete positivity. The Choi test below supplies that certificate. General conversion rules remain at Quantum Channels for QI so this page can keep one fixed convention rather than restating all alternatives.
Predict populations, quadratures, and idle fidelity
Section titled “Predict populations, quadratures, and idle fidelity”For a declared input , the map predicts the two populations and both transverse quadratures. Those state-resolved predictions retain through the affine term. For the identity target, the raw average fidelity is
If an explicitly declared -phase correction is applied, the phase-stripped value is
The translation does not enter this Haar average, although it strongly affects ground- and excited-state predictions. The stripped value is not the fidelity of the uncorrected idle. Report the raw value when coherent phase remains in the implemented operation, and report the stripped value only with the correction rule and estimation uncertainty. Nielsen and Chuang derive the general average-fidelity relation underlying this qubit expression.
Kraus and Choi Physicality Checks
Section titled “Kraus and Choi Physicality Checks”Kraus composition is a physicality certificate
Section titled “Kraus composition is a physicality certificate”Compose the generalized-amplitude-damping Kraus family with the pure-dephasing Kraus pair
and, if needed, the declared coherent rotation. The products form a Kraus family for the composed map, and
This establishes complete positivity and trace preservation constructively. It also makes the double-counting audit concrete: already yield on coherence, so the pair must use , not , under the matched model.
Kraus branches are representation choices unless the corresponding environment record is actually measured. The focused Kraus–Choi–Stinespring page explains that nonuniqueness and minimality. Here the expanded family is retained because it makes a finite computation auditable.
Choi matrix and exact one-step CP bound
Section titled “Choi matrix and exact one-step CP bound”Use the unnormalized Choi matrix with trace , output tensor input order, and basis
For ,
Trace preservation is . Complete positivity requires the displayed diagonal entries to be nonnegative and the only nontrivial principal block to satisfy
Watrous gives the general Choi criterion; this sparse matrix reduces it to one exact scalar inequality.
Markovian interpolation is a stronger claim
Section titled “Markovian interpolation is a stronger claim”The independent relaxation-plus-pure-dephasing semigroup construction imposes
equivalently for matched exponential fits. At finite , the exact one-step Choi bound permits a slightly larger region because of the positive term . A point in that extra region is a valid finite channel but cannot be assigned the independent used above.
Semigroup claims require a consistent generator and composition law, not just a positive Choi matrix at one duration. Gorini and collaborators and Lindblad establish the generator structure under time-homogeneous Markov assumptions. Passing the finite CP test should therefore be reported as “this one-step map is physical,” not “the dynamics are Markovian” or “the fitted map can be divided into arbitrary substeps.”
Compose Idle Intervals Without Double Counting
Section titled “Compose Idle Intervals Without Double Counting”Same-axis factors multiply
Section titled “Same-axis factors multiply”For intervals then expressed in the same energy basis and transverse frame,
and
When the fixed points agree, this reduces to . Repeating a homogeneous channel four times therefore gives , , and the same fixed point. Direct iteration and the closed form should agree to numerical tolerance.
Multiplication is exact for the declared finite maps; interpreting the powers as samples of one continuous semigroup is an additional claim. Likewise, multiplying is correct only if each factor already includes its own relaxation contribution exactly once.
Different fixed points make order matter
Section titled “Different fixed points make order matter”Suppose two intervals share scalar contraction but have fixed points . Applying then gives translation , whereas then gives . Their difference is
The contractions and coherence magnitudes are identical, yet the population predictions differ. This can represent, for example, two scheduled contexts with different effective excitation balance. Averaging the fixed points before composition changes the experiment and hides the ordering information.
An order-sensitive result does not by itself prove quantum memory: even ordinary affine Markov channels with different fixed points fail to commute. Diagnose temporal correlations only after accounting for the known schedule and context dependence.
Basis-changing gates require ordered composition
Section titled “Basis-changing gates require ordered composition”A basis-changing ideal gate rotates both the linear Bloch block and the translation. If is the ideal-gate Pauli-transfer matrix and the first idle precedes it, the scheduled map contains
with the rightmost operation acting first. Replacing this product by scalar factors and assumes a shared phase-covariant axis throughout and is generally wrong. A Hadamard exchanges longitudinal and transverse directions; an idle translation along before it becomes a translation along afterward.
Freeze whether reported noise is in a laboratory frame, rotating frame, or error frame relative to an ideal gate. The scheduled location is as much a part of the channel as or . Noise Simulation owns the software infrastructure for such schedules; this page supplies the finite affine rule a simulator must implement.
Ramsey, Echo, and Nonexponential Envelopes
Section titled “Ramsey, Echo, and Nonexponential Envelopes”Ramsey, Hahn echo, and decoupling filter different bands
Section titled “Ramsey, Hahn echo, and decoupling filter different bands”Ramsey free evolution is sensitive to detuning and low-frequency fluctuations. A Hahn echo reverses phase accumulated from sufficiently slow quasistatic offsets, while longer pulse trains introduce their own filter functions and control errors. Consequently , echo , and a decoupling coherence time are different protocol summaries, not progressively better estimates of one universal constant.
Hahn’s original spin-echo work establishes the refocusing principle. Bylander and collaborators use pulse sequences for noise spectroscopy, and Degen and collaborators review how sequence filters select frequency bands. Cywiński and collaborators analyze coherence enhancement under pulse sequences. These results justify keeping the sequence in the channel record and holding out at least one different sequence; the detailed derivation of filter functions remains outside this page.
Gaussian and stretched-exponential maps
Section titled “Gaussian and stretched-exponential maps”A commonly fitted magnitude is
For , it is Gaussian; for , exponential. At every fixed , defines a valid standalone dephasing channel. Yet for the family generally fails . The finite map at is therefore not obtained by applying a fitted map and a fitted map as if both were independent increments.
Nonexponential population recovery is possible too. In that case use the measured finite population factor and fixed point at each validated duration, and test the exact Choi bound. Do not force a single merely to make the algebra exponential.
One-time channels need not form a semigroup
Section titled “One-time channels need not form a semigroup”A one-time CPTP map answers: “Given the declared preparation boundary and context, what output is predicted after this duration?” A semigroup answers the stronger question of how every interval composes under a common time-homogeneous law. The first can be valid when the second is false because of quasistatic disorder, memory, drift, preparation correlations, or simply a nonexponential phenomenological fit.
The distinction also limits interpolation. Sampling at several times does not uniquely determine a generator between them. A good finite channel model reports its supported durations and tests composition on held-out pairs. If composition fails, retain the one-time predictions within their validated domain and route general multitime analysis to the appropriate open-system framework rather than labeling the process Markovian or non-Markovian from one curve.
Markovian and Non-Markovian Noise owns the claim ladder separating one-time maps, fixed-step powers, semigroups, CP-divisible time-dependent evolution, revival witnesses, and causal-break memory; this page retains the T1–T2–thermal channel crosswalk and its physicality and composition audits.
Fit, Diagnose, and Falsify the Model
Section titled “Fit, Diagnose, and Falsify the Model”Fit both populations and coherence quadratures
Section titled “Fit both populations and coherence quadratures”Use at least four preparations: approximate ground, excited, , and . The first two constrain and through both and . The transverse pair, measured in both and , determines the two real components of . Fitting only Ramsey contrast loses the sign and phase information; fitting only excited-state decay poorly separates a fixed-point offset from preparation and readout contrast.
Estimate SPAM parameters jointly or calibrate them independently, and propagate their uncertainty into the channel. Check the reconstructed density matrices, Kraus completeness when using that construction, Choi positivity, and the declared affine convention. Report whether the model is fit separately by context or constrained across contexts.
Hold out times, sequences, preparations, and contexts
Section titled “Hold out times, sequences, preparations, and contexts”A model should predict data not used to determine it. Hold out intermediate and longer durations, at least one pulse sequence, one or more preparations, circuit locations before and after a basis change, simultaneous-activity settings, and a later epoch. Compare the full population and quadrature records rather than one aggregate fidelity.
Use residuals with measurement uncertainty, not visual agreement alone. A channel fitted at should be tested both as a direct one-time prediction at and as two scheduled applications, because those are different claims. Agreement supports the stated interval and context; it does not establish a universal bath model.
Failure signatures that require a richer model
Section titled “Failure signatures that require a richer model”Oscillatory residuals suggest unresolved coherent frequencies. Unequal contraction of the two transverse axes breaks phase covariance. Nonexponential population recovery, a drifting fixed point, or preparation-dependent parameters can signal extra levels, context dependence, or invalid SPAM assumptions. Leakage invalidates a trace-preserving qubit boundary. Correlated idles and failed composition can require a latent process or multitime model.
The smallest useful response is specific: add a coherent detuning, separate transverse axes, use a finite-duration lookup, enlarge the Hilbert space, condition on context, or model temporal correlations. Do not repair a failed fit by clipping parameters into the CP region without reporting the projection. Physicality is necessary, but predictive adequacy on the declared validation domain is the deciding test.
Three Reproducible Finite Audits
Section titled “Three Reproducible Finite Audits”Audit 1 — Convert one thermal T1–T2 record
Section titled “Audit 1 — Convert one thermal T1–T2 record”Take , , , , , and input Bloch vector . The matched exponential conversion gives
The output is
so and . The phase-stripped average fidelity is . The program below reconstructs the density matrix and tests Hermiticity, unit trace, positivity, and agreement of density-matrix and affine paths.
Audit 2 — Cross-check representations and repeated intervals
Section titled “Audit 2 — Cross-check representations and repeated intervals”Construct generalized amplitude damping, compose the additional dephasing factor, and independently build the output-tensor-input Choi matrix and affine Pauli-transfer matrix. The Choi eigenvalues in descending order are
Four identical memoryless intervals give , , , and . The audit obtains that state by four direct applications and by one composed affine map. It also rejects the extra factor that would result from applying as pure dephasing after amplitude damping.
Audit 3 — Separate a one-time map from a repeatable channel
Section titled “Audit 3 — Separate a one-time map from a repeatable channel”For with ,
The product minus the direct value is . Each sampled map is CPTP, but these factors are not a time-homogeneous semigroup. The exponential control gives product and direct value . The table and program recompute all finite fixtures from their primitive inputs.
| in | population difference | phase-stripped | ||||
|---|---|---|---|---|---|---|
"use strict";
const tolerance = 1e-12;const assert = (condition, message) => { if (!condition) throw new Error(message);};const assertClose = (actual, expected, message) => { assert(Math.abs(actual - expected) <= tolerance, `${message}: ${actual} != ${expected}`);};const assertVector = (actual, expected, message) => { assert(actual.length === expected.length, `${message}: length`); actual.forEach((value, k) => assertClose(value, expected[k], `${message}[${k}]`));};const add = ([ar, ai], [br, bi]) => [ar + br, ai + bi];const multiply = ([ar, ai], [br, bi]) => [ar * br - ai * bi, ar * bi + ai * br];const conjugate = ([ar, ai]) => [ar, -ai];const scale = ([ar, ai], value) => [ar * value, ai * value];const zeroMatrix = (rows, columns) => Array.from( { length: rows }, () => Array.from({ length: columns }, () => [0, 0]),);const realMatrix = (matrix) => matrix.map((row) => row.map((value) => [value, 0]));const dagger = (matrix) => matrix[0].map((_, column) => matrix.map((row) => conjugate(row[column])),);const matrixMultiply = (left, right) => { const output = zeroMatrix(left.length, right[0].length); for (let row = 0; row < left.length; row += 1) { for (let column = 0; column < right[0].length; column += 1) { for (let k = 0; k < right.length; k += 1) { output[row][column] = add( output[row][column], multiply(left[row][k], right[k][column]), ); } } } return output;};const assertMatrix = (actual, expected, message) => { assert(actual.length === expected.length, `${message}: rows`); actual.forEach((row, r) => { assert(row.length === expected[r].length, `${message}: columns ${r}`); row.forEach((value, c) => { assertClose(value[0], expected[r][c][0], `${message}[${r},${c}] real`); assertClose(value[1], expected[r][c][1], `${message}[${r},${c}] imaginary`); }); });};const applyKraus = (operators, state) => operators.reduce((sum, operator) => { const branch = matrixMultiply(matrixMultiply(operator, state), dagger(operator)); return sum.map((row, r) => row.map((value, c) => add(value, branch[r][c])));}, zeroMatrix(2, 2));const densityFromBloch = ([x, y, z]) => [ [[(1 + z) / 2, 0], [x / 2, -y / 2]], [[x / 2, y / 2], [(1 - z) / 2, 0]],];const blochFromDensity = (state) => [ 2 * state[0][1][0], -2 * state[0][1][1], state[0][0][0] - state[1][1][0],];const applyAffine = ([x, y, z], etaValue, cValue, equilibriumZ) => [ cValue[0] * x + cValue[1] * y, -cValue[1] * x + cValue[0] * y, etaValue * z + (1 - etaValue) * equilibriumZ,];const multiplyRealMatrixVector = (matrix, vector) => matrix.map((row) => row.reduce((sum, value, k) => sum + value * vector[k], 0),);
const deltaTime = 20;const T1 = 80;const T2 = 60;const equilibriumExcited = 0.08;const theta = 0;const inputBloch = [0.6, -0.2, -0.4];const eta = Math.exp(-deltaTime / T1);const gamma = 1 - eta;const coherenceMagnitude = Math.exp(-deltaTime / T2);const Tphi = 1 / (1 / T2 - 1 / (2 * T1));const lambdaPhi = Math.exp(-deltaTime / Tphi);const phaseFlipProbability = (1 - lambdaPhi) / 2;const phaseDampingParameter = 1 - lambdaPhi ** 2;const equilibriumZ = 1 - 2 * equilibriumExcited;const coherence = [ coherenceMagnitude * Math.cos(theta), -coherenceMagnitude * Math.sin(theta),];
assertClose(eta, 0.7788007830714049, "eta");assertClose(gamma, 0.22119921692859512, "gamma");assertClose(coherenceMagnitude, 0.7165313105737893, "|c|");assertClose(Tphi, 96, "Tphi");assertClose(lambdaPhi, 0.8119363461506349, "lambdaPhi");assertClose(phaseFlipProbability, 0.09403182692468254, "pZ");assertClose(phaseDampingParameter, 0.34075936979955634, "g");assertClose(equilibriumZ, 0.84, "zEq");assertClose(coherenceMagnitude, Math.sqrt(eta) * lambdaPhi, "remove T1 once");assert( Math.abs(Math.sqrt(eta) * coherenceMagnitude - coherenceMagnitude) > tolerance, "double-counted T1 factor was not rejected",);
const affineOutput = applyAffine(inputBloch, eta, coherence, equilibriumZ);assertVector( affineOutput, [0.42991878634427355, -0.14330626211475786, -0.1257129710085421], "affine output",);const outputFromFormula = densityFromBloch(affineOutput);assertClose(outputFromFormula[1][1][0], 0.562856485504271, "rho11 output");assertVector(outputFromFormula[0][1], [0.21495939317213678, 0.07165313105737893], "rho01 output");assertVector(outputFromFormula[1][0], [0.21495939317213678, -0.07165313105737893], "Hermiticity");assertClose(outputFromFormula[0][0][0] + outputFromFormula[1][1][0], 1, "unit trace");const outputRadius = Math.hypot(...affineOutput);const outputEigenvalues = [(1 + outputRadius) / 2, (1 - outputRadius) / 2];outputEigenvalues.forEach((value) => assert(value > 0, "output eigenvalue is not positive"));const strippedAverageFidelity = (3 + 2 * coherenceMagnitude + eta) / 6;assertClose(strippedAverageFidelity, 0.8686439007031638, "stripped average fidelity");
const sqrtEta = Math.sqrt(eta);const sqrtGamma = Math.sqrt(gamma);const sqrtGroundWeight = Math.sqrt(1 - equilibriumExcited);const sqrtExcitedWeight = Math.sqrt(equilibriumExcited);const amplitudeOperators = [ realMatrix([[sqrtGroundWeight, 0], [0, sqrtGroundWeight * sqrtEta]]), realMatrix([[0, sqrtGroundWeight * sqrtGamma], [0, 0]]), realMatrix([[sqrtExcitedWeight * sqrtEta, 0], [0, sqrtExcitedWeight]]), realMatrix([[0, 0], [sqrtExcitedWeight * sqrtGamma, 0]]),];const dephasingOperators = [ realMatrix([[Math.sqrt(1 - phaseFlipProbability), 0], [0, Math.sqrt(1 - phaseFlipProbability)]]), realMatrix([[Math.sqrt(phaseFlipProbability), 0], [0, -Math.sqrt(phaseFlipProbability)]]),];const totalOperators = dephasingOperators.flatMap((dephasingOperator) => amplitudeOperators.map((amplitudeOperator) => matrixMultiply(dephasingOperator, amplitudeOperator)),);const completeness = totalOperators.reduce((sum, operator) => { const term = matrixMultiply(dagger(operator), operator); return sum.map((row, r) => row.map((value, c) => add(value, term[r][c])));}, zeroMatrix(2, 2));assertMatrix(completeness, realMatrix([[1, 0], [0, 1]]), "Kraus completeness");const inputDensity = densityFromBloch(inputBloch);const krausOutput = applyKraus(totalOperators, inputDensity);assertMatrix(krausOutput, outputFromFormula, "Kraus and affine output");
const choiFromKraus = zeroMatrix(4, 4);for (const operator of totalOperators) { for (let a = 0; a < 2; a += 1) { for (let i = 0; i < 2; i += 1) { for (let b = 0; b < 2; b += 1) { for (let j = 0; j < 2; j += 1) { const row = 2 * a + i; const column = 2 * b + j; choiFromKraus[row][column] = add( choiFromKraus[row][column], multiply(operator[a][i], conjugate(operator[b][j])), ); } } } }}const explicitChoi = [ [[1 - gamma * equilibriumExcited, 0], [0, 0], [0, 0], coherence], [[0, 0], [gamma * (1 - equilibriumExcited), 0], [0, 0], [0, 0]], [[0, 0], [0, 0], [gamma * equilibriumExcited, 0], [0, 0]], [conjugate(coherence), [0, 0], [0, 0], [1 - gamma * (1 - equilibriumExcited), 0]],];assertMatrix(choiFromKraus, explicitChoi, "Kraus and explicit Choi");const partialTrace = zeroMatrix(2, 2);for (let i = 0; i < 2; i += 1) { for (let j = 0; j < 2; j += 1) { for (let a = 0; a < 2; a += 1) { partialTrace[i][j] = add(partialTrace[i][j], explicitChoi[2 * a + i][2 * a + j]); } }}assertMatrix(partialTrace, realMatrix([[1, 0], [0, 1]]), "Choi partial trace");const choiTrace = explicitChoi.reduce((sum, row, k) => sum + row[k][0], 0);assertClose(choiTrace, 2, "Choi trace");const cpRightSide = eta + gamma ** 2 * equilibriumExcited * (1 - equilibriumExcited);assert(coherenceMagnitude ** 2 <= cpRightSide + tolerance, "exact Choi CP bound");assert(coherenceMagnitude ** 2 <= eta + tolerance, "matched Markov CP bound");const d00 = 1 - gamma * equilibriumExcited;const d33 = 1 - gamma * (1 - equilibriumExcited);const discriminant = Math.sqrt((d00 - d33) ** 2 + 4 * coherenceMagnitude ** 2);const choiEigenvalues = [ (d00 + d33 + discriminant) / 2, gamma * (1 - equilibriumExcited), (d00 + d33 - discriminant) / 2, gamma * equilibriumExcited,].sort((left, right) => right - left);assertVector( choiEigenvalues, [1.6119294298021993, 0.20350327957430753, 0.16687135326920566, 0.01769593735428761], "Choi eigenvalues",);choiEigenvalues.forEach((value) => assert(value >= -tolerance, "negative Choi eigenvalue"));
const choiOutput = zeroMatrix(2, 2);for (let a = 0; a < 2; a += 1) { for (let b = 0; b < 2; b += 1) { for (let i = 0; i < 2; i += 1) { for (let j = 0; j < 2; j += 1) { choiOutput[a][b] = add( choiOutput[a][b], multiply(explicitChoi[2 * a + i][2 * b + j], inputDensity[i][j]), ); } } }}assertMatrix(choiOutput, outputFromFormula, "Choi and affine output");
const pauliTransfer = [ [1, 0, 0, 0], [0, coherence[0], coherence[1], 0], [0, -coherence[1], coherence[0], 0], [(1 - eta) * equilibriumZ, 0, 0, eta],];const transferOutput = multiplyRealMatrixVector(pauliTransfer, [1, ...inputBloch]);assertClose(transferOutput[0], 1, "PTM trace coordinate");assertVector(transferOutput.slice(1), affineOutput, "PTM and affine output");assertVector(blochFromDensity(krausOutput), affineOutput, "density and affine Bloch output");
let repeatedBloch = [...inputBloch];for (let step = 0; step < 4; step += 1) { repeatedBloch = applyAffine(repeatedBloch, eta, coherence, equilibriumZ);}const eta4 = eta ** 4;const c4 = coherenceMagnitude ** 4;const composedBloch = [c4 * inputBloch[0], c4 * inputBloch[1], eta4 * inputBloch[2] + (1 - eta4) * equilibriumZ];assertClose(eta4, 0.36787944117144233, "eta4");assertClose(c4, 0.2635971381157268, "c4");assertVector(repeatedBloch, composedBloch, "direct and composed four-step states");assertClose(composedBloch[2], 0.38382949294741153, "z4");assertClose((1 - composedBloch[2]) / 2, 0.30808525352629423, "rho11 four-step");
const auditTimes = [0, 20, 40, 60, 80];const expectedRows = [ [1, 1, 0, 1, 1, 1], [0.7788007830714049, 0.7165313105737893, 0.01769593735428761, 0.7964967204256925, 0.7788007830714049, 0.8686439007031638], [0.6065306597126334, 0.513417119032592, 0.03147754722298933, 0.6380082069356228, 0.6065306597126334, 0.7722274829629696], [0.4723665527410147, 0.36787944117144233, 0.042210675780718826, 0.5145772285217335, 0.4723665527410147, 0.7013542391806499], [0.36787944117144233, 0.26359713811572677, 0.05056964470628461, 0.41844908587772695, 0.36787944117144233, 0.6491789529004827],];auditTimes.forEach((time, row) => { const etaTime = Math.exp(-time / T1); const cTime = Math.exp(-time / T2); const pOneGivenZero = (1 - etaTime) * equilibriumExcited; const pOneGivenOne = etaTime + pOneGivenZero; const populationDifference = pOneGivenOne - pOneGivenZero; const fidelity = (3 + 2 * cTime + etaTime) / 6; assertVector( [etaTime, cTime, pOneGivenZero, pOneGivenOne, populationDifference, fidelity], expectedRows[row], `audit table row ${row}`, );});
const sigma = 0.02;const gaussian = (time) => Math.exp(-((sigma * time) ** 2) / 2);const lambda20 = gaussian(20);const lambda30 = gaussian(30);const gaussianProduct = lambda20 * lambda30;const lambda50 = gaussian(50);assertClose(lambda20, 0.9231163463866358, "Gaussian lambda20");assertClose(lambda30, 0.835270211411272, "Gaussian lambda30");assertClose(gaussianProduct, 0.7710515858035663, "Gaussian product");assertClose(lambda50, 0.6065306597126334, "Gaussian lambda50");assertClose(gaussianProduct - lambda50, 0.16452092609093283, "Gaussian composition failure");[lambda20, lambda30, lambda50].forEach((value) => assert(value >= 0 && value <= 1, "Gaussian map is not CPTP"));const exponential = (time) => Math.exp(-time / 50);assertClose(exponential(20) * exponential(30), 0.36787944117144233, "exponential product");assertClose(exponential(50), 0.36787944117144233, "exponential direct");
console.log("Dephasing/amplitude-damping finite audits: PASS");Canonical Owners and Common Claim Failures
Section titled “Canonical Owners and Common Claim Failures”Dephasing versus Dissipation owns the physical distinction between coherence loss and energy exchange. Dephasing Channel and Amplitude-Damping Channel own the formal channel families. Pure Dephasing Master Equation, Amplitude Damping Master Equation, and Thermal Master Equations own generator derivations and detailed balance. Decoherence Timescale Estimation owns the computational open-system notebook. Noise in Quantum Information owns mechanism classification and diagnostic response. Pauli Noise and Depolarizing Channels owns Pauli-law propagation and approximation audits.
A bare time called a channel. A value of , , or without basis, subspace, sequence, fit law, window, uncertainty, interval, context, and validation target does not specify a channel.
Dephasing conventions conflated. The quantities , , , , and are related only after the relaxation and phase ledgers are declared. Complete dephasing is , not .
Relaxation counted twice. Generalized amplitude damping supplies . The additional factor is , not the measured total again.
Zero-temperature damping used thermally. Appreciable upward transitions require a finite- map. A two-Kraus zero-temperature model has the wrong fixed point.
One-step CP promoted to Markovianity. The exact Choi bound certifies one finite map. It does not certify divisibility, a time-homogeneous generator, or exponential interpolation.
Affine order erased. Different fixed points and basis-changing gates make scheduled order observable. Multiply complete affine or Pauli-transfer maps in circuit order.
Phase-stripped fidelity misreported. Replacing by assumes an explicit coherent-phase correction. The corrected scalar is not the raw idle fidelity.
Fit quality substituted for validation. A physical in-sample fit can still fail held-out times, preparations, sequences, locations, simultaneous contexts, or epochs. Such failure narrows or falsifies the model.
Exercises
Section titled “Exercises”1. Convert dephasing conventions
Section titled “1. Convert dephasing conventions”For a standalone nonnegative pure-dephasing factor , compute and . Identify the complete-dephasing and unitary- endpoints.
Solution
The two ledgers give
Complete dephasing means zero transverse coherence, so , , and . By contrast, applies on every run and gives : coherence changes sign but not magnitude. Thus the stochastic phase-flip probability is not the same quantity as the phase-damping parameter.
2. Derive the thermal fixed state
Section titled “2. Derive the thermal fixed state”Starting from upward and downward rates, derive , , and the finite population map.
Solution
The excited population obeys
where and
Solving over yields with . Since , the equivalent affine rule is . This derivation assumes constant rates and a retained two-level system; it does not establish thermal equilibrium from a residual population alone.
3. Build a channel from T1, T2, and equilibrium occupation
Section titled “3. Build a channel from T1, T2, and equilibrium occupation”Use the primary fixture , , , , , and input . Reproduce , the output state, and the phase-stripped idle fidelity.
Solution
The matched rate relation gives
so . Also , , and . Applying the affine map gives
Therefore
Finally, .
4. Derive the Choi physicality bound
Section titled “4. Derive the Choi physicality bound”Using the declared output-tensor-input order, compute the output partial trace and derive the nontrivial complete-positivity condition.
Solution
Summing the output labels on the Choi diagonal gives
The two isolated diagonal eigenvalues are nonnegative for the declared parameter ranges. Positivity of the remaining principal block requires its determinant to be nonnegative:
This is the exact one-step condition. The stronger belongs to the independent Markov relaxation-plus-dephasing construction.
5. Compose equal and unequal fixed points
Section titled “5. Compose equal and unequal fixed points”Derive the same-axis composition formula. Then take , , and to show finite order sensitivity.
Solution
Apply interval and then interval :
This is the stated composition formula. If the fixed points agree, the translation is . For the numerical example, applying then gives , whereas applying then gives . The difference is . Scalar contractions agree, but translations retain order.
6. Diagnose double counting and semigroup failure
Section titled “6. Diagnose double counting and semigroup failure”Correct the naive model that composes amplitude damping with an additional factor . Then compare the Gaussian audit with the exponential control.
Solution
Amplitude damping contributes to coherence. The additional factor must therefore be
so the product is exactly . Using again would produce an extra relaxation factor.
For the Gaussian fixture, , so composition fails even though each factor lies in and defines a CPTP dephasing map. For the exponential control with , the product equals the direct value . The control isolates semigroup composition from one-time physicality.
7. Falsify a channel with four preparations
Section titled “7. Falsify a channel with four preparations”Design a held-out test using ground, excited, , and preparations, both transverse quadratures, unused times, and at least two pulse-sequence or circuit contexts.
Solution
Fit and jointly to part of the ground- and excited-preparation data, and fit and to part of both quadrature records from and . Reserve intermediate and longer times. Check whether one affine map predicts , , , and within propagated SPAM and sampling uncertainty.
Repeat the test for Ramsey and Hahn echo, or for an isolated idle and an idle during neighboring activity. Do not require their fitted values to agree; test a shared value only if that is the model claim. Also compare a direct longer-duration map with scheduled repetitions. Population data inconsistent with one fitted and falsify the fixed-point model, transverse mixing inconsistent with the fitted complex exposes a phase-sign or frame mismatch, unequal transverse contractions falsify phase covariance, and failed repetition falsifies the memoryless composition claim. None alone identifies a microscopic bath.
References
Section titled “References”- F. Bloch, “Nuclear induction,” Physical Review 70, 460–474 (1946), doi:10.1103/PhysRev.70.460.
- H.-P. Breuer and F. Petruccione, The Theory of Open Quantum Systems, Oxford University Press (2007), doi:10.1093/acprof:oso/9780199213900.001.0001.
- J. Bylander, S. Gustavsson, F. Yan, F. Yoshihara, K. Harrabi, G. Fitch, D. G. Cory, Y. Nakamura, J.-S. Tsai, and W. D. Oliver, “Noise spectroscopy through dynamical decoupling with a superconducting flux qubit,” Nature Physics 7, 565–570 (2011), doi:10.1038/nphys1994.
- L. Cywiński, R. M. Lutchyn, C. P. Nave, and S. Das Sarma, “How to enhance dephasing time in superconducting qubits,” Physical Review B 77, 174509 (2008), doi:10.1103/PhysRevB.77.174509.
- C. L. Degen, F. Reinhard, and P. Cappellaro, “Quantum sensing,” Reviews of Modern Physics 89, 035002 (2017), doi:10.1103/RevModPhys.89.035002.
- V. Gorini, A. Kossakowski, and E. C. G. Sudarshan, “Completely positive dynamical semigroups of N-level systems,” Journal of Mathematical Physics 17, 821–825 (1976), doi:10.1063/1.522979.
- E. L. Hahn, “Spin echoes,” Physical Review 80, 580–594 (1950), doi:10.1103/PhysRev.80.580.
- G. Ithier, E. Collin, P. Joyez, P. J. Meeson, D. Vion, D. Esteve, F. Chiarello, A. Shnirman, Y. Makhlin, J. Schriefl, and G. Schön, “Decoherence in a superconducting quantum bit circuit,” Physical Review B 72, 134519 (2005), doi:10.1103/PhysRevB.72.134519.
- G. Lindblad, “On the generators of quantum dynamical semigroups,” Communications in Mathematical Physics 48, 119–130 (1976), doi:10.1007/BF01608499.
- Y. Makhlin, G. Schön, and A. Shnirman, “Quantum-state engineering with Josephson-junction devices,” Reviews of Modern Physics 73, 357–400 (2001), doi:10.1103/RevModPhys.73.357.
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary edition, Cambridge University Press (2010), doi:10.1017/CBO9780511976667.
- N. F. Ramsey, “A molecular beam resonance method with separated oscillating fields,” Physical Review 78, 695–699 (1950), doi:10.1103/PhysRev.78.695.
- M. B. Ruskai, S. Szarek, and E. Werner, “An analysis of completely-positive trace-preserving maps on M2,” Linear Algebra and its Applications 347, 159–187 (2002), doi:10.1016/S0024-3795(01)00547-X.
- J. Watrous, The Theory of Quantum Information, Cambridge University Press (2018), doi:10.1017/9781316848142.