Skip to content

Quantum process tomography estimates how a device transforms input states. Preparing a spanning set of known states and measuring their outputs determines a linear map; fitting all counts together can enforce the constraints of a physical quantum channel. Unlike state tomography, both the input preparations and the output measurements must be characterized.

The discussion assumes a finite-dimensional, repeatable operation. A deterministic channel is completely positive and trace preserving (CPTP). A heralded branch instead needs a trace-nonincreasing map, and an operation with memory may require more than one input–output channel.

Required background. State tomography supplies measurement design and statistical estimation; the Choi matrix supplies complete-positivity and trace constraints. Quantum channels explains the equivalent matrix representations.

For each known preparation ρk\rho_k, measure several output observables. The probabilities are

p(a∣k,s)=Tr⁡ ⁣[Ea∣sE(ρk)],p(a|k,s)= \operatorname{Tr}\!\left[E_{a|s}\mathcal E(\rho_k)\right],

where Ea∣sE_{a|s} is a calibrated measurement effect. For a qubit, a useful input family consists of the projectors onto

∣0⟩,∣1⟩,∣+⟩,∣+i⟩.|0\rangle,\quad |1\rangle,\quad |+\rangle,\quad |+i\rangle.

Here ∣+⟩=(∣0⟩+∣1⟩)/2|+\rangle=(|0\rangle+|1\rangle)/\sqrt2 and ∣+i⟩=(∣0⟩+i∣1⟩)/2|+i\rangle=(|0\rangle+i|1\rangle)/\sqrt2. Denote their four output density matrices by σ0,σ1,σ+,σ+i\sigma_0,\sigma_1,\sigma_+,\sigma_{+i}. Linearity gives

E(I)=σ0+σ1,E(Z)=σ0−σ1,E(X)=2σ+−σ0−σ1,E(Y)=2σ+i−σ0−σ1.\begin{aligned} \mathcal E(I)&=\sigma_0+\sigma_1,\\ \mathcal E(Z)&=\sigma_0-\sigma_1,\\ \mathcal E(X)&=2\sigma_+-\sigma_0-\sigma_1,\\ \mathcal E(Y)&=2\sigma_{+i}-\sigma_0-\sigma_1. \end{aligned}

Every qubit operator is a linear combination of I,X,Y,ZI,X,Y,Z, so these measurements determine the map. This is the basic prepare-and-measure construction of Chuang and Nielsen (1997).

The output states must be measured, not assumed to remain pure. Independent fits of the four outputs may produce valid density matrices whose linear extension is not completely positive. If all four fitted outputs have trace one, however, that spanning extension is already trace preserving. Complete positivity is the additional, joint consistency condition (Exercise 3).

If an imperfect gate under investigation also prepares the nominal ∣+⟩|+\rangle probe, that preparation cannot simultaneously be treated as an independently known reference.

The Choi matrix makes joint reconstruction linear

Section titled “The Choi matrix makes joint reconstruction linear”

Use the unnormalized, output–input convention:

∣Ω⟩=∑i∣i⟩∣i⟩,JE=(E⊗id⁡)(∣Ω⟩⟨Ω∣).\begin{aligned} |\Omega\rangle&=\sum_i|i\rangle|i\rangle,\\ J_{\mathcal E} &=(\mathcal E\otimes\operatorname{id}) (|\Omega\rangle\langle\Omega|). \end{aligned}

The first factor is the output; the second is a reference copy of the input. Then

E(ρ)=Tr⁡in ⁣[JE(I⊗ρT)],p(a∣k,s)=Tr⁡(JEMa∣k,s),Ma∣k,s=Ea∣s⊗ρkT.\begin{aligned} \mathcal E(\rho) &=\operatorname{Tr}_{\mathrm{in}} \!\left[J_{\mathcal E}(I\otimes\rho^{\mathsf T})\right],\\ p(a|k,s) &=\operatorname{Tr}(J_{\mathcal E}M_{a|k,s}),\\ M_{a|k,s}&=E_{a|s}\otimes\rho_k^{\mathsf T}. \end{aligned}

The transpose uses the input basis defining ∣Ω⟩|\Omega\rangle. It matters for complex probes: for the identity channel, omitting it changes the predicted probability of projecting ∣+i⟩|+i\rangle onto itself from one to zero.

A deterministic physical channel satisfies

J⪰0,Tr⁡outJ=Iin.J\succeq0,\qquad \operatorname{Tr}_{\mathrm{out}}J=I_{\mathrm{in}}.

In particular, Tr⁡J=din\operatorname{Tr}J=d_{\mathrm{in}}. The normalized Choi state is J/dinJ/d_{\mathrm{in}}, whose input-reference marginal is Iin/dinI_{\mathrm{in}}/d_{\mathrm{in}}.

For dimensions dind_{\mathrm{in}} and doutd_{\mathrm{out}}, the CPTP set has interior dimension

din2(dout2−1).d_{\mathrm{in}}^2(d_{\mathrm{out}}^2-1).

A Hermitian Choi matrix starts with din2dout2d_{\mathrm{in}}^2d_{\mathrm{out}}^2 real parameters; the partial-trace equation imposes din2d_{\mathrm{in}}^2 independent real constraints. Positivity limits their range but does not lower the interior dimension.

The preparation and measurement design must distinguish all trace-preserving perturbations ΔJ\Delta J satisfying Tr⁡outΔJ=0\operatorname{Tr}_{\mathrm{out}}\Delta J=0. Spanning input states and informationally complete output measurements suffice. Very small singular values in this linear design still make inversion unstable.

A bit-flip example and a coherent alternative

Section titled “A bit-flip example and a coherent alternative”

Consider the one-parameter channel

Eq(ρ)=(1−q)ρ+qXρX.\mathcal E_q(\rho)=(1-q)\rho+qX\rho X.

The flip probability satisfies 0≤q≤10\leq q\leq1.

Its Bloch-vector action is

rx′=rx,ry′=(1−2q)ry,rz′=(1−2q)rz.\begin{aligned} r_x'&=r_x,\\ r_y'&=(1-2q)r_y,\\ r_z'&=(1-2q)r_z. \end{aligned}

Thus the four ideal probe outputs have Bloch vectors

Input Output Bloch vector
∣0⟩\lvert0\rangle (0,0,1−2q)(0,0,1-2q)
∣1⟩\lvert1\rangle (0,0,−1+2q)(0,0,-1+2q)
∣+⟩\lvert+\rangle (1,0,0)(1,0,0)
∣+i⟩\lvert+i\rangle (0,1−2q,0)(0,1-2q,0)

If 920920 of 10001000 measurements on the ∣0⟩|0\rangle output give outcome zero, the bit-flip model gives q^=0.08\widehat q=0.08. Its approximate binomial standard error is 0.08(0.92)/1000≈0.00858\sqrt{0.08(0.92)/1000}\approx0.00858.

That one experiment does not establish the bit-flip model. A coherent rotation

Uθ=e−iθX/2,cos⁡θ=1−2q=0.84,U_\theta=e^{-i\theta X/2}, \qquad \cos\theta=1-2q=0.84,

gives the same ZZ probabilities on input ∣0⟩|0\rangle. For 0<θ<π0<\theta<\pi, however,

⟨Y⟩bit flip=0,⟨Y⟩rotation=−sin⁡θ≈−0.543.\begin{aligned} \langle Y\rangle_{\text{bit flip}}&=0,\\ \langle Y\rangle_{\text{rotation}} &=-\sin\theta\approx-0.543. \end{aligned}

The stochastic output has a shorter Bloch vector; the unitary output remains pure.

In the y–z Bloch plane, a stochastic bit-flip output lies inside the circle and a coherent rotation output lies on its boundary, with the same z coordinate.

Both channels return the same ZZ contrast, 0.840.84, on input ∣0⟩|0\rangle. Measuring YY separates their outputs. One population measurement cannot determine the off-diagonal information needed for a channel estimate.

For the bit-flip model, write ∣A⟩ ⁣⟩=(A⊗I)∣Ω⟩|A\rangle\!\rangle=(A\otimes I)|\Omega\rangle. Its Choi matrix is

Jq=(1−q)∣I⟩ ⁣⟩⟨ ⁣⟨I∣+q∣X⟩ ⁣⟩⟨ ⁣⟨X∣.J_q={}(1-q)|I\rangle\!\rangle\langle\!\langle I| +q|X\rangle\!\rangle\langle\!\langle X|.

The normalized matrix Jq/2J_q/2 has eigenvalues 1−q,q,0,01-q,q,0,0. Relative to the identity, Fe=1−qF_e=1-q and

Favg=2Fe+13=1−2q3≈0.9467.F_{\mathrm{avg}}=\frac{2F_e+1}{3} =1-\frac{2q}{3}\approx0.9467.

The coherent alternative has the same average fidelity, despite its different action. Fidelity is a scalar summary, not a reconstruction of the error.

With fixed input–setting counts and independent stationary trials, use the multinomial log-likelihood

ℓ(J)=∑k,s,ana∣k,slog⁡Tr⁡(JMa∣k,s).\ell(J)=\sum_{k,s,a}n_{a|k,s} \log\operatorname{Tr}(JM_{a|k,s}).

Maximizing this concave function over J⪰0J\succeq0 with the correct partial trace gives a physical maximum-likelihood estimate (Fiurášek and Hradil, 2001). Zero-count terms contribute zero. A positive count assigned zero probability makes ℓ=−∞\ell=-\infty.

Linear inversion is useful for exposing poorly determined directions, but can give negative Choi eigenvalues. Constrained least squares and projected least squares use different objectives; projection depends on its norm and weighting. Surawy-Stepney and colleagues (2022) study specific projected estimators and their statistical guarantees.

Low-rank or near-unitary assumptions can reduce the number of unknowns, but must be tested against additional data. A commonly suggested shortcut does not work: for positive trace-preserving Choi matrices,

∥J∥∗=Tr⁡J=din.\|J\|_*=\operatorname{Tr}J=d_{\mathrm{in}}.

The nuclear norm is constant on the feasible set, so adding a multiple of it to a CPTP fitting objective cannot favor low Kraus rank. Useful rank restrictions require a genuinely different model or objective.

Uncertainty must describe the quantity being reported. For a dd-dimensional CPTP map and target unitary UU, the output–input Choi convention gives

Fe=Tr⁡(JEJU)d2,Favg=dFe+1d+1.F_e=\frac{\operatorname{Tr}(J_{\mathcal E}J_U)}{d^2}, \qquad F_{\mathrm{avg}}=\frac{dF_e+1}{d+1}.

Here FeF_e uses the squared-fidelity convention with the pure normalized target Choi state; the average-fidelity relation is general for CPTP maps, not restricted to bit flips (Nielsen, 2002). In the one-parameter example, the approximate standard error of FavgF_{\mathrm{avg}} is (2/3)se⁡(q^)≈0.00572(2/3)\operatorname{se}(\widehat q)\approx0.00572, conditional on the bit-flip and calibration assumptions.

A full channel confidence region permits bounds on these linear fidelities by optimization over the region. A point estimate of diamond distance is not itself a guaranteed experimental upper bound. Refer to hardware metrics for the meanings of these quantities.

Prepare a known maximally entangled state of the input and a reference:

∣Φ⟩=1d∑i∣i⟩S∣i⟩R.|\Phi\rangle=\frac1{\sqrt d}\sum_i|i\rangle_S|i\rangle_R.

Applying the process only to SS produces JE/dJ_{\mathcal E}/d. Joint state tomography therefore reconstructs the channel from one type of joint input. Many repeated preparations and joint measurement settings are still needed.

More generally, expand the known input state in an operator-Schmidt decomposition,

σSR=∑ℓ=1RsℓAℓ⊗Bℓ.\sigma_{SR}=\sum_{\ell=1}^{R}s_\ell A_\ell\otimes B_\ell.

One input is faithful for unrestricted process reconstruction when the input-side operators span all din2d_{\mathrm{in}}^2 directions, equivalently R=din2R=d_{\mathrm{in}}^2 with nonzero coefficients. Small coefficients amplify uncertainty when inverted. Entanglement is not necessary: certain separable correlated states are faithful (Altepeter and colleagues, 2003; Exercise 5). Conversely, an entangled pure state supported on only two levels of a three-level input misses the remaining directions.

For an nn-qubit channel, the generic CPTP dimension is 16n−4n16^n-4^n. Conventional product probes with local Pauli readout use 4n3n=12n4^n3^n=12^n preparation–setting configurations. Ancilla assistance with local Pauli readout uses 32n=9n3^{2n}=9^n settings on 2n2n qubits. These are design counts, not shot counts, and the enlarged state preparation and measurement can be demanding.

Randomized benchmarking answers a narrower question about sequence decay. Choi-state shadow methods can estimate selected process properties. Neither provides an arbitrary channel at uniformly accurate precision with polynomial resources in nn.

Preparation errors, memory, and successful branches

Section titled “Preparation errors, memory, and successful branches”

If all nominal inputs experience the same preparation map P\mathcal P, and all output effects share an imperfection representable by a map M\mathcal M before ideal readout, the data identify

Eeff=M∘E∘P.\mathcal E_{\mathrm{eff}} =\mathcal M\circ\mathcal E\circ\mathcal P.

They do not separate the three factors. Preparation-dependent or setting-dependent errors need not even admit this single composite-map description. More shots improve precision within the assumed model; they do not identify missing calibration information.

Gate-set tomography fits preparations, measurements, and gates together from sequences. In Liouville coordinates, an invertible change

∣ρ⟩ ⁣⟩↦G∣ρ⟩ ⁣⟩,⟨ ⁣⟨E∣↦⟨ ⁣⟨E∣G−1,Gi↦GGiG−1\begin{aligned} |\rho\rangle\!\rangle&\mapsto G|\rho\rangle\!\rangle,\\ \langle\!\langle E|&\mapsto\langle\!\langle E|G^{-1},\\ \mathcal G_i&\mapsto G\mathcal G_iG^{-1} \end{aligned}

leaves sequence probabilities unchanged. This algebraic gauge freedom means individual coordinates are not directly observed; not every arbitrary transformation preserves a chosen physical parameterization. Nielsen and colleagues (2021) explain gauge choices and statistical analysis. See also SPAM errors.

A channel fitted to one use does not automatically predict repeated uses. Suppose a hidden bit chooses either II or ZZ with equal probability and remains fixed for two uses. Every one-use experiment sees dephasing, but two uses apply either I2I^2 or Z2Z^2, both identity. Squaring the fitted dephasing channel would predict dephasing again. Repeated-sequence tests detect this memory; non-Markovian noise explains the more general setting.

For a successful branch K\mathcal K, retain unnormalized outputs and success counts. Its Choi matrix obeys

JK⪰0,Tr⁡outJK⪯I.J_{\mathcal K}\succeq0,\qquad \operatorname{Tr}_{\mathrm{out}}J_{\mathcal K}\preceq I.

The normalized conditional output is

ρsucc=K(ρ)Tr⁡K(ρ).\rho_{\mathrm{succ}} =\frac{\mathcal K(\rho)}{\operatorname{Tr}\mathcal K(\rho)}.

When success depends on the input, this expression is generally nonlinear in ρ\rho and must not be fitted as an ordinary channel. It becomes linear after division by a common success probability only when that probability is state independent.

Additional probe states, repeated settings, and sequences test these assumptions. Compare measured and predicted probabilities by preparation, time, and context. A constrained fit always produces a physical matrix; agreement on observations outside the fit determines whether that matrix is useful for prediction.

Find the CPTP interior dimension for a qubit channel and a channel from a qubit to a three-level system.

Solution

A Hermitian Choi matrix has din2dout2d_{\mathrm{in}}^2d_{\mathrm{out}}^2 coordinates. Its fixed input marginal imposes din2d_{\mathrm{in}}^2 real constraints. Thus the two dimensions are 4(4−1)=124(4-1)=12 and 4(9−1)=324(9-1)=32. Full-rank positive Choi matrices exist in both cases, so positivity does not reduce these interior dimensions.

2. Test the transpose with a complex probe

Section titled “2. Test the transpose with a complex probe”

For the identity channel, calculate the probability of projecting input ∣+i⟩|+i\rangle onto ∣+i⟩|+i\rangle using the Choi formula. What happens without the input transpose?

Solution

For Jid=∣Ω⟩⟨Ω∣J_{\mathrm{id}}=|\Omega\rangle\langle\Omega|,

⟨Ω∣A⊗B∣Ω⟩=Tr⁡(ABT).\langle\Omega|A\otimes B|\Omega\rangle =\operatorname{Tr}(AB^{\mathsf T}).

With E=ρ=∣+i⟩⟨+i∣E=\rho=|+i\rangle\langle+i|, the correct choice B=ρTB=\rho^{\mathsf T} gives Tr⁡(ρ2)=1\operatorname{Tr}(\rho^2)=1. Omitting the transpose gives Tr⁡(ρρT)=0\operatorname{Tr}(\rho\rho^{\mathsf T})=0, since ρT=∣−i⟩⟨−i∣\rho^{\mathsf T}=|-i\rangle\langle-i|. Real probes alone would miss this mistake.

3. Four physical outputs need not define a channel

Section titled “3. Four physical outputs need not define a channel”

Suppose the four probe outputs are the transposes of their inputs. Are they physical? Is the spanning linear extension CPTP?

Solution

Each transposed density matrix is positive and trace one. The extension is the transpose map, which fixes I,X,ZI,X,Z and sends YY to −Y-Y. It preserves trace, but its Choi matrix is the swap operator. Swap has eigenvalue −1-1 on the antisymmetric Bell state, so the extension is not completely positive. Checking each output separately misses this joint requirement.

For q=0.08q=0.08, find the positive YY-measurement probability on input ∣0⟩|0\rangle after the bit-flip channel and after UθU_\theta with cos⁡θ=0.84\cos\theta=0.84.

Solution

The bit-flip output has ⟨Y⟩=0\langle Y\rangle=0, so pY(+)=1/2p_Y(+)=1/2. The rotated output has

⟨Y⟩=−1−0.842,pY(+)=1−1−0.8422≈0.2287.\begin{aligned} \langle Y\rangle&=-\sqrt{1-0.84^2},\\ p_Y(+)&=\frac{1-\sqrt{1-0.84^2}}2\\ &\approx0.2287. \end{aligned}

Both have pZ(0)=0.92p_Z(0)=0.92. Measuring the complementary basis detects their coherence difference.

Let ∣s⟩|s\rangle range over the six Pauli eigenstates and let ∣s∗⟩|s^*\rangle denote computational-basis conjugation. Show that

σ=16∑s∣s⟩⟨s∣⊗∣s∗⟩⟨s∗∣\sigma=\frac16\sum_s |s\rangle\langle s|\otimes|s^*\rangle\langle s^*|

is separable and faithful for qubit process tomography.

Solution

It is explicitly a mixture of product states, hence separable. Pairing the positive and negative eigenstates of each axis gives

σ=I⊗I4+X⊗X−Y⊗Y+Z⊗Z12.\sigma={}\frac{I\otimes I}{4} +\frac{X\otimes X-Y\otimes Y+Z\otimes Z}{12}.

The four independent input operators I,X,Y,ZI,X,Y,Z all have nonzero coefficients. Thus the operator-Schmidt rank is four. Process inversion is possible, although the three traceless correlations are smaller than for a maximally entangled probe, which increases noise amplification.

6. Why nuclear-norm regularization fails here

Section titled “6. Why nuclear-norm regularization fails here”

Compare the nuclear norms of the unnormalized Choi matrices for the identity channel and complete depolarization ρ↦I/d\rho\mapsto I/d. Can that norm distinguish their Kraus ranks under CPTP constraints?

Solution

The identity Choi matrix is ∣Ω⟩⟨Ω∣|\Omega\rangle\langle\Omega|, with one eigenvalue dd. The depolarizing Choi matrix is Id2/dI_{d^2}/d, with d2d^2 eigenvalues 1/d1/d. Both have nuclear norm dd, despite ranks one and d2d^2. Every positive trace-preserving Choi matrix has the same norm, so the penalty is constant.

7. Separate a gate error from a preparation error?

Section titled “7. Separate a gate error from a preparation error?”

A nominal input is followed either by a bit flip of probability 0.10.1 during preparation and a perfect device, or by perfect preparation and a device bit flip of probability 0.10.1. Can arbitrary output measurements distinguish the two cases?

Solution

Both produce exactly the same output for every nominal input. Standard process tomography identifies the same composite channel in both cases. More choices of output measurement or more shots cannot separate the factors without additional preparation information.

8. A normalized successful branch is nonlinear

Section titled “8. A normalized successful branch is nonlinear”

Take K=diag⁡(1,1/2)K=\operatorname{diag}(1,1/2) and K(ρ)=KρK†\mathcal K(\rho)=K\rho K^\dagger. Compare conditioning after applying K\mathcal K to I/2I/2 with the equally weighted mixture of the conditioned ∣0⟩|0\rangle and ∣1⟩|1\rangle outputs.

Solution

The success probabilities are 11 and 1/41/4 for ∣0⟩|0\rangle and ∣1⟩|1\rangle. Their individually normalized outputs remain those pure states, whose equal mixture is I/2I/2.

For the mixture sent through the operation, however,

K(I/2)=diag⁡(1/2,1/8).\mathcal K(I/2)= \operatorname{diag}(1/2,1/8).

Success probability is 5/85/8, giving conditioned output diag⁡(4/5,1/5)\operatorname{diag}(4/5,1/5). Conditioning reweights the ensemble toward the more successful input. The linear object is K\mathcal K, including its trace.

For the persistent hidden I/ZI/Z choice described above, compare the probability of measuring X=+1X=+1 on input ∣+⟩|+\rangle after two actual uses and after applying the fitted one-use channel twice.

Solution

The actual two-use operation is identity for either hidden choice, giving probability one. The one-use fitted map is D(ρ)=(ρ+ZρZ)/2\mathcal D(\rho)=(\rho+Z\rho Z)/2. It sends ∣+⟩⟨+∣|+\rangle\langle+| to I/2I/2 and obeys D2=D\mathcal D^2=\mathcal D, giving probability 1/21/2. One-use data cannot distinguish persistent from freshly resampled noise.

Calculate the generic CPTP dimension, conventional product preparation–setting count, and ancilla-assisted local Pauli setting count for five qubits.

Solution

The counts are

165−45=1,047,552,125=248,832,95=59,049.\begin{aligned} 16^5-4^5&=1{,}047{,}552,\\ 12^5&=248{,}832,\\ 9^5&=59{,}049. \end{aligned}

The last experiment measures a ten-qubit output state, so fewer distinct configurations do not by themselves establish a lower laboratory cost. Repeated shots, calibration, and joint preparation are additional resources.

  • Altepeter, J. B., D. Branning, E. Jeffrey, T. C. Wei, P. G. Kwiat, R. T. Thew, J. L. O’Brien, M. A. Nielsen, and A. G. White. “Ancilla-assisted quantum process tomography.” Physical Review Letters 90, 193601 (2003). doi:10.1103/PhysRevLett.90.193601.
  • Chuang, I. L., and M. A. Nielsen. “Prescription for experimental determination of the dynamics of a quantum black box.” Journal of Modern Optics 44, 2455–2467 (1997). doi:10.1080/09500349708231894.
  • Fiurášek, J., and Z. Hradil. “Maximum-likelihood estimation of quantum processes.” Physical Review A 63, 020101(R) (2001). doi:10.1103/PhysRevA.63.020101.
  • Nielsen, E., J. K. Gamble, K. Rudinger, T. Scholten, K. Young, and R. Blume-Kohout. “Gate set tomography.” Quantum 5, 557 (2021). doi:10.22331/q-2021-10-05-557.
  • Nielsen, M. A. “A simple formula for the average gate fidelity of a quantum dynamical operation.” Physics Letters A 303, 249–252 (2002). doi:10.1016/S0375-9601(02)01272-0.
  • Surawy-Stepney, T., J. Kahn, R. Kueng, and M. Guţă. “Projected least-squares quantum process tomography.” Quantum 6, 844 (2022). doi:10.22331/q-2022-10-20-844.