 Research
 Open Access
 Published:
Qubit noise deconvolution
EPJ Quantum Technology volume 9, Article number: 29 (2022)
Abstract
We present a noise deconvolution technique to remove a wide class of noises when performing arbitrary measurements on qubit systems. In particular, we derive the inverse map of the most common single qubit noisy channels, and exploit it at the data processing step to obtain noisefree estimates of observables evaluated on a qubit system subject to known noise. We illustrate a selfconsistency check to ensure that the noise characterization is accurate providing simulation results for the deconvolution of a generic Pauli channel, as well as experimental evidence of the deconvolution of decoherence noise occurring on Rigetti quantum hardware.
1 Introduction
Quantum noise is currently the largest limiting factor in the adoption of quantum computation and quantum technology. Their theoretical performances are in fact hindered by the intrinsic fragility of quantum systems, and over the last years many proposal have been put forward to mitigate, ideally correct, the effect of noise and recover reliable results. On the computing side, as faulttolerant quantum computers remain out of reach at the moment [1–4], various error mitigation techniques have been proposed to extend the capabilities of current small scale noisy quantum devices [5–7]. These ranges from correcting the readout noise via inversion of probability assignment matrix [8], extrapolating the noise in the device to the zero error case [9–11], using a probabilistic sampling on specific circuits to approximate the noise free computation [9, 10, 12], to also using machine learning approaches to learn how to recover ideal results [13].
While these methods are concerned with mitigating noise occurring in a computation, here we instead focus on the more generic task of correcting the expectation value of arbitrary observables evaluated on a system which is subject to a known noise happening before the measurement stage. Such a scenario is relevant in quantum communication and quantum tomography tasks [14].
Noise in quantum systems is described by means of quantum channels [15]
where \(A_{k}\) are operators acting on the system named Kraus operators. While the effect of unitary dynamics can be reversed using realizable operations, quantum channels cannot be undone, and one can only hope to find operations which only approximately invert the noise process at hand. Examples of this approach leverages for example Petz recovery maps [16–18], or unitaries which, on average, are able to best reverse the noise based on given distance measures [19–21].
Here instead we show that noise can be eliminated by means of a deconvolution process, provided that the noise map describing the process is known and invertible. In fact, we drop the requirements of the inverse transformation being itself a quantum channel, since the transformation is not applied to the quantum system itself, but to the outcome statistics as a classical postprocessing step. We derive the inversion maps of the most common singlequbit noisy channels (both unital and nonunital), and show how to use these to remove the effect of noise from the expectation values of general observables. In Fig. 1 we schematically summarize the noise deconvolution idea. The mitigation is effectively obtained by multiplying the noisy estimates by a factor depending on the noise \(\langle O \rangle _{\mathrm{mitig}} \sim c \langle O \rangle _{\mathrm{noisy}}\), which comes at the cost of increasing the variance of the estimation, as \(\operatorname{Var}[\langle O \rangle _{\mathrm{mitig}}] \sim c^{2} \operatorname{Var}[\langle O \rangle _{\mathrm{noisy}}]\), so one needs to gather more statistic to reach a target precision. A related post processing technique specialized for quantum manybody systems and quantum field theory is put forward in ref. [22]. In addition, we provide both numerical simulations of the noise deconvolution process, as well as evidence of deconvolution of decoherence noise occurring on the superconducting quantum computer “Aspen9” provided by Rigetti, accessed using the Quantum Cloud Services (QCS) [23]. We show how simple selfconsistency checks can test whether the known noise map is accurate and how a feedback scheme can be used to adjust the noise parameters. Our contributions then include: (i) formalization and discussion of CPTP (namely, completely positive trace preserving) noise deconvolution of expectation values through (mathematical) inversion of the noise map; (ii) explicit derivation of the inverse map of the most common single qubit noise channels; (iii) numerical and experimental application of the ideas introduced before.
Before continuing, we briefly describe the relation of the proposed noise deconvolution idea to probabilistic error mitigation (PEC) [10, 12], a quantum error mitigation technique aimed at correcting noisy operations during a quantum computation. Given a characterization of the noise, PEC works by using the inverse noise map of the operations to build an ensemble of suitably generated quantum circuits. These are sampled according to specific weights, and the results combined to build an approximation of the action of the noisefree quantum circuit. In particular, the mitigation procedure is active, in the sense that the experimenter need to generate new quantum circuits and run them against the quantum device. On the contrary, we are instead concerned with the correction of expectation values evaluated on a noisy state, with no computation or dynamics involved. In addition, within our framework, the mitigation is passive, in the sense that the mitigation happens classically as a postprocessing step, and no action on the quantum system is necessary. Appropriately limiting PEC to the specific case of measurement error mitigation, and realizing that sampling on quantum circuits is no longer a necessary step, then one can recover the noise deconvolution procedure presented here, whose regime of application is not restricted to quantum computation, but applies to a general quantum mechanical measurement scenario. As such, some of the results presented here can be recovered also with the techniques proposed in [10, 12]. That said, the explicit calculations presented here for the general noise maps we analyze have not been presented elsewhere in full generality, e.g. see Table 1 below.
The paper is organized as follows. In Sect. 2 we recall some basic concepts about quantum channels and the Pauli transfer matrix formalism, and the idea of noise deconvolution in Sect. 3. In Sect. 4 we leverage the Pauli transfer matrix formalism to explicitly derive the inverse map of the most common single qubit noise channels, and use inside the noise deconvolution procedure to obtain noisefree estimates. In Table 1 we summarize all the maps taken in consideration as well as their inverse. In Sect. 5 we show by means of simulations that the noise deconvolution process can be used to cancel out the effect of a general Pauli channel, and also provide experimental evidence of the deconvolution of decoherence noise as performed on a real quantum device by Rigetti.
2 Methods
In this section we introduce the notation and the theoretical tools used to derive the main results of the work. We will denote with \(\mathcal{H}\) the Hilbert space, and with \(\mathcal{L}(\mathcal{H})\) the space of squared linear operators acting on \(\mathcal{H}\). For those interested, a brief overview of quantum channels and Kraus decomposition can be found in Appendix A.
2.1 Quantum channels
In general quantum channels cannot be physically inverted, as there is no quantum evolution capable of reversing their actions. Formally stated, let \(\mathcal{E}\) be a CPTP map, it is not possible to find another CPTP map \(\mathcal{D}=\mathcal{E}^{1}\), such that \((\mathcal{D \circ \mathcal{E}})(\rho ) = \rho \) ∀ρ. The only trivial case when this is possible, is for maps having only a single Kraus operator, in which case they reduce to standard unitary evolution \(\mathcal{E}(\rho ) = U\rho U^{\dagger}\), with the inverse given by \(\mathcal{D}(\cdot ) = U^{\dagger}\,(\cdot )\,U\).
The CPTP conditions impose hard constraints to the operatorial form that physically realizable evolutions must match, namely the Kraus representation. However, the requirement for admitting a more general operatorsum representation are looser. In fact, any Hermiticity preserving map, i.e. a map such that \(\Phi (\rho )^{\dagger }= \Phi (\rho )\) for \(\rho =\rho ^{\dagger}\), admits an operatorsum representation as [24, 25]
with \(\lambda _{k} \in \{+1,1\}\). Clearly if all the coefficients are \(\lambda _{k} = 1 \) ∀k, then the map Φ is also completely positive, since it is in standard Kraus form (1). Moreover, another useful characterization is given by
Corollary 1
(Corollary II.2 of [25])
Let \(\mathcal{M}_{N}\) be the space of complex \(N\times N\) matrices. Suppose \(\Phi :\mathcal{M}_{N}\rightarrow \mathcal{M}_{N}\) is a completely positive map having the form
where \(\{A_{k}\}_{k}\) is linearly independent in \(\mathcal{M}_{N}\), and \(\beta _{k} \in \mathbb{R}\) ∀k. Then \(\beta _{k} \geq 0 \) ∀k.
Conversely, if a map has form (3) with linearly independent operators \(\{A_{k}\}_{k}\) but has some of the coefficients \(\beta _{j}<0\), then the map is not completely positive. This result is steadily applied to maps acting on qubit systems where \(\mathcal{M}_{N} = \mathbb{C}^{2\times 2}\). In fact, Pauli matrices \(\sigma _{x}\), \(\sigma _{y}\) and \(\sigma _{z}\) together with the identity {\sigma}_{0}={\mathbb{1}}_{2}, form a linearly independent set in the space of \(2\times 2\) complex matrices, and then any map of the form
having some negative coefficients is not a CP map, thus it is not a physically realizable channel. In the following we will derive many inverse maps having this form, for which this result holds. Of course, we already know that a quantum channel cannot be inverted (apart from the trivial unitary case), so that if an inversion map is found, then it is certainly not CP. Nonetheless, this result is still of interest because it gives a nice and clear condition that can be used to quickly assess the nature of the maps under investigation. In addition, as shown in ref. [26], if a CPTP map is invertible, then its inverse is Hermitian preserving (HP), and so can be expressed in operatorform (2).
2.2 Qubit systems and Pauli transfer matrix formalism
We focus on quantum systems made of qubits, and briefly review some useful results on qubit channels.
The identity and the Pauli matrices \{\mathbb{1},{\sigma}_{x},{\sigma}_{y},{\sigma}_{z}\} form a basis on \(\mathcal{L}(\mathcal{H})=\mathbb{C}^{2\times 2}\), and so any operator \(O \in \mathcal{L}(\mathcal{H})\) can be expressed in this basis as
where we have introduced the vector of Pauli matrices \(\boldsymbol{\sigma} = (\sigma _{x}, \sigma _{y}, \sigma _{z})\), and the vector of coefficients \(\boldsymbol{o} = (o_{1}, o_{2}, o_{3}) \in \mathbb{C}^{3}\). Similarly, density operators are expressed in this basis in terms of their Bloch vector as \rho =(\mathbb{1}+\mathit{r}\cdot \mathit{\sigma})/2, with \(\boldsymbol{r}=(r_{x}, r_{y}, r_{z}) \in \mathbb{R}^{3}\), and \(\boldsymbol{r}\leq 1\), where equality holds only for pure states \(\rho = \psi\rangle \langle\psi\) [15].
Since any operator O is completely specified by its components in the Pauli basis, we define its vector of coefficients as the column vector O\u300b:={({o}_{0},{o}_{1},{o}_{2},{o}_{3})}^{\mathsf{T}}. We refer to [27, 28] for a detailed discussion on the correspondence between operators and vectors.
In addition, every linear map \(\Phi : \mathcal{L}(\mathbb{C}^{2}) \rightarrow \mathcal{L}( \mathbb{C}^{2})\) can be represented in this basis as a \(4\times 4\) matrix Γ [25, 29–31], whose action is given by
where γ and t are row and column vectors respectively, and T is a \(3\times 3\) matrix. The matrix Γ associated to the map Φ is called Pauli Transfer Matrix (PTM), and its elements are given by
If we restrict to tracepreserving maps, then \(\boldsymbol{\gamma} = \boldsymbol{0}\) and \(\gamma _{0} = 1\), so the Γ matrix reduces to the simpler form
Furthermore, if the map is also unital (i.e. \mathrm{\Phi}(\mathbb{1})=\mathbb{1}), then also \(\boldsymbol{t} = \boldsymbol{0}\). As an example, the quantum bitflip channel described by the map
has a corresponding PTM representation as
2.3 Quantum tomographic reconstruction
Quantum tomography [32–35] is a method to estimate the ensemble average of any arbitrary operator by using measurement outcomes of a quorum of observables. The goal of a tomographic reconstruction of an observable is to identify a set of observables \(\{Q_{\lambda}\}\), called quorum [36], such that the mean value \(\langle O \rangle = \operatorname{Tr}[O \rho ]\) of any observable \(O \in \mathcal{L}(\mathcal{H})\), for all states ρ, can be reconstructed by using measurements outcomes of the quorum observables. A tomographic reconstruction formula for an operator O is obtained by using a spectral decomposition of the identity in the operator Hilbert space [36–39]
where λ is a parameter living in either a continuous or discrete manifold Λ, and operators \(C_{\lambda}\) depend on the quorum observables. The term \(\mathbb{E}[O](Q_{\lambda}) := \operatorname{Tr}[C^{\dagger}_{\lambda }O] C_{ \lambda}\) is called quantum estimator of the operator O, and given a quantum state ρ, the expectation value \(\langle O \rangle \) on such state amounts to
For qubit systems, the most common choice (but non unique, e.g. [35]) for the quorum are the Pauli matrices \(\{Q_{\lambda}\}_{\lambda} = \{\sigma _{x}, \sigma _{y}, \sigma _{z} \}\), and the tomographic reconstruction formula results in the standard expansion in the Pauli basis, albeit with a slightly different notation (see Appendix B for the explicit derivation):
Note that the quantum tomographic reconstruction can be straightforwardly applied to multipartite quantum systems by simply using as a quorum the tensor product of singlesystem quorums [36].
3 Noise deconvolution
The tomographic reconstruction formula can be used whenever one has access to the quantum state ρ and measurements of the quorum observables. In practical scenarios however, estimations are performed in the presence of noise and one generally deals with noisy quantum states \(\rho \rightarrow \tilde{\rho} = \mathcal{N}({\rho})\) which then leads to noisy estimates \(\langle O \rangle _{\tilde{\rho}} = \operatorname{Tr}[O\mathcal{N}({\rho})]\). The idea of noise deconvolution is to correct the errors by considering a new quorum of observables taking into account the noise, and then use a noise inverted quantum estimator to recover the ideal estimates, namely the ones that we would obtain in the absence of noise.
Suppose the noise map \(\mathcal{N}\) acting on the quantum system can be formally inverted, that is there exist a linear (not CP) map \(\mathcal{N}^{1}\) such that \((\mathcal{N}^{1}\circ \mathcal{N})(\rho )=\rho \) for all ρ. Then, we say that the noise can be deconvoluted in the following sense: instead of measuring the original observable O, we can evaluate the expectation value of the noiseinverted operator \(\hat{\mathcal{N}}^{1}(O)\), thus obtaining as a result the desired noisefree ideal result \(\langle O \rangle \), that is
where \(\hat{\mathcal{N}}^{1}(\cdot )\) denotes the adjoint of the inverse map \(\mathcal{N}^{1}(\cdot )\), and in the second line we made explicit use of the definition of the adjoint map.
The conditions for deconvolving the effect of a noise channel \(\mathcal{N}\) are [36, 37]:

the inverted noise map exists, that is there is a \(\mathcal{N}^{1}\) such that \((\mathcal{N}^{1}\circ \mathcal{N})(O) = O\) \(\forall O \in \mathcal{L}(\mathcal{H})\).

the quantum estimator \(\mathbb{E}[O](Q_{\lambda})\) is in the domain of \(\mathcal{N}^{1}\).

the map \(\mathcal{N}^{1}(\mathbb{E}[O](Q_{\lambda}))\) is a function of \(Q_{\lambda}\).
If these hold, then one can substitute the quantum estimator in Eq. (13), with the deconvolved quantum estimator \(\hat{\mathcal{N}}^{1}(\mathbb{E}[O](Q_{\lambda}))\), yielding
This procedure yields the ideal expectation value of any observable O on the state ρ, even if having access only to a noisy version of it and provided that the noise map is known (and invertible). Note that this definition is similar to that recently reported in ref [6], regarding invertible noise channels with nonCPTP inverse. Specializing it for qubits, using Eq. (18) in (16), leads to (see Appendix C for further details)
Similarly to standard tomographic reconstruction, noise deconvolution can be applied also to multi qubits systems, in which case the mitigated tomographic estimates are obtained considering the tensor product of the deconvolved quantum estimator of each subsystem. Clearly, this holds only for singlequbit noisy channels acting independently on each qubit. In addition, generally noninvertible maps could still be deconvoluted if one restricts the attention only to a subset of states of interest upon which the given map is invertible [40, 41].
As shown later, the correction of the expectation value of a Pauli matrix is obtained by multiplying the noisy estimate—the one the experimenter has access to—by a constant depending on the noise, i.e. \(\langle \sigma _{\alpha} \rangle _{\mathrm{mitig}} = c\langle \sigma _{\alpha} \rangle _{\mathrm{noisy}}\). This clearly increases the variance of the estimation, since \(\operatorname{Var}[\langle \sigma _{\alpha} \rangle _{\mathrm{mitig}}] = c^{2} \operatorname{Var}[ \langle \sigma _{\alpha} \rangle _{\mathrm{noisy}}] \sim c^{2} / M\), where M is the number of measurements performed on the system, and thus the experimenter need to increase the outcome statistics proportionally to \(c^{2}\) to reach a desired target precision.
We now proceed discussing how the deconvolution behaves in the presence of multiple noise channels. Consider two noise processes \(\mathcal{N}_{0}\) and \(\mathcal{N}_{1}\) separated by a unitary gate \(\mathcal{U}(\cdot ) = U \cdot U^{\dagger}\), as shown in Fig. 1(d). The action of the circuit is
with \(\tilde{\rho}_{U} = U\mathcal{N}_{0} (\rho )U^{\dagger}\). Using (18), it is possible to deconvolve the outermost noise \(\mathcal{N}_{1}\) with
but not \(\mathcal{N}_{0}\), since the unitary U is in the way. Actually, one could decide to deconvolve the unitary as well, using the trivial inverse \(\mathcal{U}_{1}^{1}(\cdot ) = U_{1}^{\dagger }\cdot U_{1}\), and thus making it possible to deconvolve also the first noise channel \(\mathcal{N}_{0}\), as
However, this procedure cannot be employed to invert the noise that happens before a generic unitary U, since it essentially offloads the computation from the quantum computer to the classical one, by simulating the inverse evolution of the quantum system.
A more interesting case is obtained when the error map happens to commute with all the remaining operation in the computation, as is the case for the depolarizing noise, described by the map
for which it is easy to see that \((\mathcal{N}_{\mathrm{dep}}\circ \mathcal{U} )(\rho ) = ( \mathcal{U}\circ \mathcal{N}_{\mathrm{dep}} )(\rho )\) \(\forall \mathcal{U}(\cdot )=U\cdot U^{\dagger}\). Suppose one is performing a quantum computation given by a sequence of operations \(U_{i}\), each one followed by depolarizing noise
with \(\mathcal{N}_{\mathrm{dep}}^{\mathrm{tot}} = \prod \mathcal{N}_{\mathrm{dep}}^{(i)}\) the composition of all the depolarizing channels, and \(\rho _{U} = \prod \mathcal{U}_{i}(\rho _{0})\) the state obtained by the ideal noisefree computation. Most importantly, one can check that the composition of multiple depolarizing channels is still a depolarizing channel with probability parameter \(1p_{\mathrm{tot}} = \prod (1p_{i})\), where \(p_{i}\) is the probability associated with each depolarizing noise. In such case it is possible to deconvolve all noise at once, using the deconvolution formula for the depolarizing noise with the total noise parameter \(p_{\mathrm{tot}}\) (see Eq. (39)). Similarly, this also holds for computations involving multi qubits subject to global depolarizing errors. The authors in ref. [42] leverage this property to perform a simple yet effective error mitigation technique for quantum computers, based on the assumption that noise in quantum circuits is well described by global depolarizing error channels. While exact depolarizing errors (either local or global) are hardly found in realistic quantum circuits where errors are both due to coherent (i.e. unitary) and incoherent noise (i.e. interaction), Pauli twirling and randomized compiling techniques [43–46] can be used to approximately tailor noise to stochastic Pauli channels, preferably depolarizing noise, and then use the procedure above to mitigate it [47].
4 Inversion of common noise maps
We now proceed by explicitly evaluating the inverse maps of some of the most common noisy channels, leveraging the Pauli Transfer Matrix formalism introduced in Sect. 2. The general method for finding the inverse map goes as follows: we first evaluate the matrix representation (7) of the channel, we then invert this matrix, and from this recover the operator sum representation of the inverse channel whenever this exists. We start from simpler cases to build some intuition on the construction of the inverse maps, and then proceed towards more complicated cases. In Table 1 we summarize the results obtained in this section, comprising all noise channels considered in this analysis together with their inverse maps.
4.1 Bitflip, phaseflip and bitphaseflip
The bitflip, phaseflip and bitphaseflip channels are described by the Kraus operators, {A}_{0}=\sqrt{p}\mathbb{1} and \(A_{1,\alpha} = \sqrt{1p} \sigma _{\alpha}\), with \(\sigma _{\alpha }\in \{\sigma _{x},\sigma _{z},\sigma _{y}\}\) respectively. For simplicity, in the following we focus only on the bitflip channel (generated by \(\sigma _{x}\)), but the results hold equivalently also for the other two channels. The bitflip channel acts as:
and its PTM is given by
In order to find an operator sum expression for the inverse map \(\mathcal{N}_{x}^{1}\), we consider the inverse matrix \(\Gamma _{x}^{1}\)
It’s clear that \(\Gamma _{x}\) can be inverted provided that \(p\neq 1/2\), since in that case \(\operatorname{det} \Gamma _{x}=0\). This is not a problem for realistic case scenarios, where the probability of errors are small, so that one can safely assume \(0< p<1/2\). We now proceed using a similar procedure found in [25].
Note that \(\Gamma _{x}^{1}\) is diagonal in the Pauli basis, thus has eigenvectors \{\mathbb{1}\u300b,{\sigma}_{x}\u300b{\sigma}_{y}\u300b{\sigma}_{z}\u300b\} with eigenvalues \(\boldsymbol{\lambda} = \{1, 1, (12p)^{1}, (12p)^{1}\}\) respectively. Now, consider the generic map
Also this map has eigenvectors \{\mathbb{1},\mathit{\sigma}\}, but with eigenvalues \(\boldsymbol{\beta}=\{\beta _{0}, \beta _{1}, \beta _{2}, \beta _{3}\}\). Since two maps are equal if they have the same action on a basis, if we can find a way to match the two sets of eigenvalues λ and β, we would then recover the operatorsum representation for \(\Gamma _{x}^{1}\).
By evaluating the PTM \(\Gamma _{\mathcal{E}}\) of \(\mathcal{E}\), we can relate the coefficients in the operatorsum representation (28), with those appearing in the expression for \(\Gamma _{x}^{1}\) (see Appendix D for a derivation). In particular, we want these to hold:
plus the tracepreserving condition \(1 = \beta _{0} + \beta _{1} + \beta _{2} + \beta _{3}\), that the inverse map must satisfy because the direct map is tracepreserving. This condition is inherently satisfied by \(\Gamma _{x}^{1}\), since its first row has the form \((1, 0, 0, 0)\). This system has solutions \(\beta _{0} = (1p)/(12p)\), \(\beta _{1}=p/(12p)\), and \(\beta _{2}=\beta _{3}=0\), and substituting them back into Eq. (28), we obtain the operatorsum representation of the inverse bitflip map
By virtue of Corollary II, and noticing that the coefficients appearing in the expression above have always opposite signs, we are sure that this map is not CP, as expected, yet it possesses an operator sum representation. Note how similar the direct and inverse map are, a feature which we will encounter in all the cases discussed here.
The same procedure can be applied to phaseflip (or dephasing, generated by \(\sigma _{z}\)), and bitphaseflip (generated by \(\sigma _{y}\)) channels, yielding inverse maps
We can plug these inversion maps in the deconvolution formula (19) to obtain noisefree expectation values. In particular, assume we are measuring a Pauli matrix \(O=\sigma _{\alpha}\), and that the system is subject to one of the noise processes \(\rho \rightarrow \rho _{\beta }= \mathcal{N}_{\beta}(\rho )\) with \(\beta = \{x,y,z\}\). Then the ideal expectation values \(\langle \sigma _{\alpha} \rangle _{\rho} = \operatorname{Tr}[\sigma _{\alpha}\rho ]\) can be expressed in compact form as (see Appendix D for the explicit derivation)
It is then clear that if the noise happens along the measurement direction (\(\alpha =\beta \)), then the noise does not affect the measurement statistics, as the ideal and noisy value coincide. While for orthogonal directions (\(\alpha \neq \beta \)), these are equally contracted by a factor \(12p\), thus recovering the usual pictorial representation of the contracting Bloch sphere on the plane orthogonal to the noise [15].
4.2 Depolarizing noise
The depolarizing noise, introduced above,
leaves the state untouched with probability \(1p\), and sends it to the completely mixed state \mathbb{1}/2 with probability p. The channel can be expressed in Kraus form in multiple ways, one of them being [15]
with Kraus operators \{{A}_{0}=\sqrt{13p/4}\mathbb{1},{A}_{1}=\sqrt{p}{\sigma}_{x}/2,{A}_{2}=\sqrt{p}{\sigma}_{y}/2,{A}_{3}=\sqrt{p}{\sigma}_{z}/2\}. Following the same procedure used for the bitflip channel, one obtains the inverse linear map (see Appendix D)
While this is already a known result in the literature [10, 36, 39, 48, 49], it is presented without an explicit constructive derivation, as given here.
Using this formula in the deconvolution tomographic reconstruction (19), we find
where it is clear that to counterbalance the effect of the depolarizing channel, whose effect on the Bloch sphere is to contract it uniformly, one needs perform an expansion of the same amount, obtained dividing by \(1p\).
While our analysis is focused only on single qubit systems, it is worth noticing that a similar approach can be used to correct correlated and asymmetric depolarizing channels acting on multiqubits systems [50], as recently shown in [27].
4.3 General Pauli channel
A more general and interesting case is the general Pauli channel, where noise intensities are different along the three Pauli axes
The channel is parametrized by the probabilities \(\boldsymbol{p}=(p_{0}, p_{x}, p_{y}, p_{z})\), with the tracepreserving condition implying \(p_{0} = 1p_{x}p_{y}p_{z}\). Upon choosing appropriate values for p, this channel reduces to all noise maps treated before. Though of considerable more general structure, the inverse map of this channel is derived using the same machinery developed above, and eventually one obtains
One can check that varying p it is possible to recover the inverse maps of all the cases treated before. For example, for \(\boldsymbol{p} = (1p, p, 0, 0)\) corresponding to the bitflip channel, one gets \(\beta _{0} = (1p)/(12p)\) and \(\beta _{1}=p/(12p)\), as in Eq. (32).
The noise deconvolution applied to measurements of Pauli matrices \(O \in \{\sigma _{x}, \sigma _{y}, \sigma _{z}\}\), leads to the following relations
which can be used together with (19) to reconstruct the expectation value of a general observable O. Again, we see that the noise disturbs the estimation along orthogonal directions, as in all previous cases. Note that the explicit inversion of the general Pauli channel was also recently reported in ref. [5].
4.4 Amplitude damping
The amplitude damping (AD) channel describes the energy loss of a quantum system, for example obtained through relaxation from the excited to the ground state. Its Kraus representation is
where \(\gamma \in [0,1]\) is a parameter that encodes the strength of the energy loss process, which for real systems is often expressed in terms of characteristic decay times, as discussed in Sect. 5.
While still being trace preserving (TP), amplitude damping channel is not unital, since {\mathcal{N}}_{\mathrm{AD}}(\mathbb{1})=\mathbb{1}+\gamma Z. This in turn implies that the Pauli Transfer Matrix \(\Gamma _{\mathrm{AD}}\) is not diagonal, but has an addition nonzero element in the last row of first column. This changes the derivation of the inverse map with respect to the previous cases, but it can still be carried out without major changes (see Appendix E). The inverse linear map in operator sum representation is then found to be
Up until now, all noisy channels (and their inverse maps) had trivial adjoint map, since all Kraus operators were Hermitian. However this is not the case for amplitude damping, since both \(V_{1}\neq V_{1}^{\dagger}\) and \(K_{1}\neq K_{1}^{\dagger}\). Thus, one must be careful in applying the adjoint inverse \(\hat{\mathcal{N}}^{1}\) in Eq. (19), and not just \(\mathcal{N}^{1}\) of (44) (see Appendix E for an extended discussion). Deconvolution of amplitude damping for measurements of the Pauli matrices leads to
Similarly, one can also obtain the inverse map of the generalized amplitude damping (GAD) channel, used to model the interaction of a qubit with an environment at a finite temperature [15, 51]. Such channel is parametrised by two parameters γ and p, and it is defined as
One can check that the following map is the inverse of the GAD channel
with corresponding noise deconolved Pauli expectation values given by
4.5 TwoKraus channels
We now move our attention to the set of channels generated by two parametrized Kraus operators
with \(A_{1} = \cos \alpha 0 \rangle \langle 0+\cos \beta 1 \rangle \langle 1\), and \(A_{2} = \sin \beta {0}\rangle \langle {1}+\sin \alpha {1}\rangle \langle {0}\). This channel reduces to bitflip for \(\alpha =\beta \), and to amplitude damping for \(\alpha =0\).
Following a procedure similar to the amplitude damping case, the inverse map of the twoKraus channels is found to be
Similarly to amplitude damping, one of the generators (\(B_{2}\)) is not Hermitian, thus we must employ the adjoint inverse map when evaluating the deconvolved expectation values. By straightforward calculations the following holds:
with \(h_{\alpha \beta} = 2 / (\cos (2\alpha )+\cos (2\beta ))\).
Note that upon varying the parameters α and β, the formulas above correctly reduce to the other limiting channels. For example, setting \(\alpha =0\) leads to amplitude damping channel (45), with \(\cos (\beta ):=\sqrt{1\gamma}\).
5 Experimental deconvolution
In this section we provide some concrete applications of the noise deconvolution procedures for qubit tomography outlined above. In particular, we show both numerically and by experimentation on quantum hardware by Rigetti how to address a dechoerence noise model, and we also provide numerical evidence for the deconvolution of the general Pauli channel (40). All simulations are performed using PyQuil and the real quantum device usded is “Aspen9”, accessed via Rigetti’s Quantum Cloud Services (QCS) [23, 52].
5.1 Decoherence noise model
The concurrent action of a dephasing channel followed by amplitude damping is referred to as decoherence noise, which is an effective way to describe the noisy evolution a qubit undergoes due to uncontrolled interaction with its external environment. Using the definitions (25) and (43), one obtains
where we have introduced the relaxation times \(T_{1}\) and \(T_{2}\) characterizing the “quality” of the physical qubits. These are related to the noise parameters γ and p through the following relations
where t is a time parameter indicating the duration of the noise process.
Since the correction terms in the deconvolution formulas for dephasing (45) and amplitude damping (35) are multiplicative, for a decoherence channel these combine as
Additionally, if the quantum system under investigation is subject to repeated applications of a decoherence noise channel, i.e. \(\mathcal{N}_{\mathrm{dec}}^{\circ m}(\rho ) =\mathcal{N}^{(1})_{ \mathrm{dec}}\circ \mathcal{N}^{(2)}_{\mathrm{dec}} \cdots \circ \mathcal{N}^{(m)}_{\mathrm{dec}}(\rho )\), then the ideal expectation values are obtained through the following equations
In Fig. 2 we show the application of these formulas to deconvolve the decoherence noise occurring on a qubit. The specific quantum circuit used for the experiments is showed in Fig. 2(a): first the system is prepared in the superposition state \({+}\rangle =H{0}\rangle =({0}\rangle +{1}\rangle )/\sqrt{2}\), then we let qubit decohere for a certain amount of time dictated by the number m of (noisy) identities each of which takes a time t, and at last we measure the expectation value of the operator \(\sigma _{x}\). Clearly, in a noisefree scenario, the result would always be \(\langle \sigma _{x} \rangle =1\), independent of the depth m. Figure 2(c) shows a simulation of these circuits with stochastic measurement outcomes for different values of m, and for a given choice of noise parameters p and γ. For comparison, the individual effect of dephasing and amplitude damping channels alone are also showed. Thanks to Eq. (55) we can invert the effect of the decoherence noise, and so retrieve the ideal noisefree results.
We also tested this procedure on quantum hardware provided by Rigetti, in particular on the device “Aspen9”, whose topology is reported in Fig. 2(b). The device comes with the calibration data reporting the \(T_{1}\) and \(T_{2}\) parameters for any qubit, as well as the time duration of a single gate. Identities in the circuits are used to introduce time delays, and thus let the qubit decohere for longer intervals of time, depending on the depth m. Differently from the previous simulations where only the identities are supposed to introduce (decoherence) noise, in the real case scenario noise happens along the whole computation, including state preparation, application of all gates in the circuit (both Hadamards and Identities), and finally measurement errors. Of these, the most detrimental are undoubtedly readout errors, and we addressed them by using the standard mitigation technique of calibrating the device and inverting the assignment probability matrix to recover readout mitigated results. Calibration data reports that the time it takes to execute a single qubit identity gate is \(t=40\text{ ns}\), and together with \(T_{1}\) and \(T_{2}\), these are used to calculate the parameters p and γ of the decoherence noise, using relations (53). These are in turn used inside the deconvolution formulas to recover the noisefree results. Figures 2(d) and 2(e) show the results of the execution of circuit Fig. 2(a) on qubits 4 and 25, respectively.
The noise mitigation procedure on qubit 4 shown in panel 2(d), yields slightly unphysical results, in the sense that the mitigated value exceeds one, which is of course not possible. A naive solution to this problem could be to impose that the mitigation results are in the physical range \([1,+1]\), so that if the result exceed the limits, it should be substituted with the appropriate physical bound. Though, assuming a gate time duration of \(t=35\text{ ns}\) instead of standard 40 ns, yields results which are more in agreement with the expected theoretical behaviour for decoherence noise, as the deconvoluted results are compatible with one, as expected. This hints that either the quality of the qubit is better then reported in the available calibration data (either due to shorter gate times t, or larger \(T_{1}\) and \(T_{2}\)), or that the decoherence model alone poorly describes the noise happening on idle qubit 4 left interacting with the external environment. However, the good accordance between the deconvoluted results with \(t=35\text{ ns}\) and the experiments suggests the first hypothesis to hold.
Such conclusion is also corroborated by the experimental results obtained with qubit 25. In fact, using the deconvolution formulas with reported \(T_{1}\), \(T_{2}\) and standard gate time (\(t=40\text{ ns}\)), we are able to mitigate the effect of noise with good accuracy, as showed in Fig. 2(e), hinting that indeed the decay law of the qubit is well described through a decoherence noise model. Also, note that the simulation in Fig. 2(c) is tuned with the same noise parameters p and γ characterizing qubit 25. Apart from fluctuations due to, e.g imperfect readout, stochastic measurement outcomes, and noisy Hadamards, there is good agreement between the simulated (red curve in panel (c)) and experimental result (red curve in panel (e)). We do not report analogues experiments using other qubits in the device that produced obviously biased data.
5.2 Arbitrary Pauli channel
We implemented a simulation of the noise deconvolution of the general Pauli channel (40), using the quantum virtual machine (QVM) simulator provided with PyQuil [52]. The simulated circuit is showed on top of Fig. 3. A qubit starting in the ground state is rotated in the Bloch sphere around the y axis via \(R_{y}(\theta ) = e^{i\theta \sigma _{y}/2}\), and then it is subject to the general Pauli noise (yellow box), simulated applying a Pauli transformation chosen randomly with probabilities \(p_{x}\), \(p_{y}\) and \(p_{z}\). At last, we estimate the expectation value of the three Pauli matrices by appending the appropriate change of basis gate, i.e {M}_{j}\in \{\mathbb{1},H,H{S}^{\u2020}\} for \(\{\sigma _{z}, \sigma _{x}, \sigma _{y}\}\) respectively. The noise parameters \((p_{x}, p_{y}, p_{z})\) are used within the deconvolution formulas (42) to recover the mitigated results (green curve), which are, as expected, in perfect agreement with the ideal noisefree ones, obtained from executing the quantum circuit without the noisy channel (red curve).
6 Conclusions
In conclusion we have shown how mathematically invertible noise maps can always be removed from the final measurement stage, so that one can obtain unbiased expectation values of general observables provided that the noise process in known. We illustrated the method on most known qubit noise maps, and systematically derived their inverse maps (see Table 1). We simulated the noise deconvolution procedure for the case of a general Pauli channel (Fig. 3) and illustrated our method on noise on actual quantum hardware (Fig. 2).
Availability of data and materials
The data that support the findings of this study are available from the corresponding author, S.M., upon reasonable request.
Abbreviations
 CPTP:

Completely Positive Trace Preserving
 PTM:

Pauli Transfer Matrix
 AD:

Amplitude Damping
 GAD:

Generalized Amplitude Damping
References
Steane AM. Phys Rev Lett. 1996;77:793–7. https://doi.org/10.1103/PhysRevLett.77.793.
Shor PW. Phys Rev A. 1995;52:R2493–R2496. https://doi.org/10.1103/PhysRevA.52.R2493.
Knill E. Nature. 2005;434:39–44. https://doi.org/10.1038/nature03350.
Preskill J. Quantum. 2018;2:79. https://doi.org/10.22331/q2018080679.
Suzuki Y, Endo S, Fujii K, Tokunaga Y. Quantum error mitigation for faulttolerant quantum computing. 2021. arXiv:2010.03887 [quantph].
Cao N, Lin J, Kribs D, Poon YT, Zeng B, Laflamme R. NISQ: error correction, mitigation, and noise simulation. 2021. arXiv:2111.02345 [quantph].
Viola L, Lloyd S. Phys Rev A. 1998;58:2733–44. https://doi.org/10.1103/PhysRevA.58.2733.
Bravyi S, Sheldon S, Kandala A, Mckay DC, Gambetta JM. Phys Rev A. 2021;103:042605. https://doi.org/10.1103/PhysRevA.103.042605.
Mari A, Shammah N, Zeng WJ. Phys Rev A. 2021;104:052607. https://doi.org/10.1103/PhysRevA.104.052607.
Temme K, Bravyi S, Gambetta JM. Phys Rev Lett. 2017;119:180509. https://doi.org/10.1103/PhysRevLett.119.180509.
Kandala A, Temme K, Córcoles AD, Mezzacapo A, Chow JM, Gambetta JM. Nature. 2019;567(7749):491–5. https://doi.org/10.1038/s4158601910407.
Endo S, Benjamin SC, Li Y. Phys Rev X. 2018;8:031027. https://doi.org/10.1103/PhysRevX.8.031027.
Lowe A, Gordon MH, Czarnik P, Arrasmith A, Coles PJ, Cincio L. Phys Rev Res. 2021;3:033098. https://doi.org/10.1103/PhysRevResearch.3.033098.
Siddhu V. Phys Rev A. 2019;99:012342. https://doi.org/10.1103/PhysRevA.99.012342.
Nielsen MA, Chuang IL. Quantum computation and quantum information. 10th ed. Cambridge: Cambridge University Press; 2010.
Lautenbacher L, de Melo F, Bernardes NK. Approximating invertible maps by recovery channels: optimality and an application to nonMarkovian dynamics. 2021. arXiv:2111.02975 [quantph].
Gilyén A, Lloyd S, Marvian I, Quek Y, Wilde MM. Quantum algorithm for Petz recovery channels and pretty good measurements. 2020. arXiv:2006.16924 [quantph].
Wilde MM. Quantum information theory. 2nd ed. Cambridge: Cambridge University Press; 2017. https://doi.org/10.1017/9781316809976.
Karimipour V, Benatti F, Floreanini R. Phys Rev A. 2020;101:032109. https://doi.org/10.1103/PhysRevA.101.032109.
Shahbeigi F, Sadri K, Moradi M, Życzkowski K, Karimipour V. J Phys A, Math Theor. 2021;54:345301. https://doi.org/10.1088/17518121/ac13db.
Aurell E, Zakrzewski J, Życzkowski K. J Phys A, Math Theor. 2015;48:38FT01. https://doi.org/10.1088/17518113/48/38/38ft01.
Bény C. Quantum Inf Process. 2017;17:26. https://doi.org/10.1007/s1112801717963.
Karalekas PJ, Tezak NA, Peterson EC, Ryan CA, da Silva MP, Smith RS. Quantum Sci Technol. 2020;5:024003. https://doi.org/10.1088/20589565/ab7559.
de Pillis J. Pac J Math. 1967;23:129–37.
Bourdon PS, Williams HT. Phys Rev A. 2004;69:022314. https://doi.org/10.1103/PhysRevA.69.022314.
Jiang J, Wang K, Wang X. Quantum. 2021;5:600. https://doi.org/10.22331/q20211207600.
Roncallo S, Maccone L, Macchiavello C. Multiqubit noise deconvolution and characterization. arXiv; 2022. https://doi.org/10.48550/ARXIV.2207.12386.
D’Ariano GM, Chiribella G, Perinotti P. Quantum theory from first principles: an informational approach. Cambridge: Cambridge University Press; 2017. https://doi.org/10.1017/9781107338340.
Beth Ruskai M, Szarek S, Werner E. Linear Algebra Appl. 2002;347:159–87. https://doi.org/10.1016/S00243795(01)00547X.
King C, Ruskai MB. IEEE Trans Inf Theory. 2001;47:192–209. https://doi.org/10.1109/18.904522.
Greenbaum D. Introduction to quantum gate set tomography. 2015. arXiv:1509.02921 [quantph].
Mauro D’Ariano G, Paris MGA, Sacchi MF. Quantum tomography. In: Advances in imaging and electron physics. vol. 128. Amsterdam: Elsevier; 2003. p. 205–308.
D’Ariano GM, Maccone L, Paris MGA. Phys Lett A. 2000;276:25–30. https://doi.org/10.1016/S03759601(00)006605.
D’Ariano GM, Lo Presti P. Phys Rev Lett. 2001;86:4195–8. https://doi.org/10.1103/PhysRevLett.86.4195.
D’Ariano GM, Maccone L, Paini M. J Opt B, Quantum Semiclass Opt. 2003;5:77–84. https://doi.org/10.1088/14644266/5/1/311.
D’Ariano GM. Phys Lett A. 2000;268:151–7. https://doi.org/10.1016/S03759601(00)00164X.
Paris M, Řeháček J, editors. Quantum state estimation. Lecture notes in physics. Berlin: Springer; 2004.
D’Ariano GM, Maccone L, Paris MGA. J Phys A, Math Gen. 2001;34:93–103. https://doi.org/10.1088/03054470/34/1/307.
Bisio A, Chiribella G, D’Ariano GM, Facchini S, Perinotti P. IEEE J Sel Top Quantum Electron. 2009;15:1646–60. https://doi.org/10.1109/JSTQE.2009.2029243.
D’Ariano GM, Lo Presti P. Phys Rev Lett. 2003;91:047902. https://doi.org/10.1103/PhysRevLett.91.047902.
D’Ariano GM, Maccone L, Presti PL. Phys Rev Lett. 2004;93:250407. https://doi.org/10.1103/PhysRevLett.93.250407.
Vovrosh J, Khosla KE, Greenaway S, Self C, Kim MS, Knolle J. Phys Rev E. 2021;104:035309. https://doi.org/10.1103/PhysRevE.104.035309.
Wallman JJ, Emerson J. Phys Rev A. 2016;94:052325. https://doi.org/10.1103/PhysRevA.94.052325.
Hashim A, Naik RK, Morvan A, Ville JL, Mitchell B, Kreikebaum JM, Davis M, Smith E, Iancu C, O’Brien KP, Hincks I, Wallman JJ, Emerson J, Siddiqi I. Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor. 2021. arXiv:2010.00215 [quantph].
Emerson J, Alicki R, Życzkowski K. J Opt B, Quantum Semiclass Opt. 2005;7:S347–S352. https://doi.org/10.1088/14644266/7/10/021.
Ware M, Ribeill G, Ristè D, Ryan CA, Johnson B, da Silva MP. Phys Rev A. 2021;103:042604. https://doi.org/10.1103/physreva.103.042604.
Ville JL, Morvan A, Hashim A, Naik RK, Lu M, Mitchell B, Kreikebaum JM, O’Brien KP, Wallman JJ, Hincks I, Emerson J, Smith E, Younis E, Iancu C, Santiago DI, Siddiqi I. Leveraging randomized compiling for the QITE algorithm. 2021. arXiv:2104.08785 [quantph].
D’Ariano GM, Sacchi MF. Phys Lett A. 2010;374:713–24. https://doi.org/10.1016/j.physleta.2009.11.081.
Huang HY, Kueng R, Preskill J. Nat Phys. 2020;16:1050–7. https://doi.org/10.1038/s4156702009327.
Cafaro C, Mancini S. Phys Rev A. 2010;82:012306. https://doi.org/10.1103/PhysRevA.82.012306.
Cafaro C, van Loock P. Phys Rev A. 2014;89:022316. https://doi.org/10.1103/PhysRevA.89.022316.
Smith RS, Curtis MJ, Zeng WJ. A practical quantum instruction set architecture. 2016. arXiv:1608.03355 [quantph].
Acknowledgements
This material is based upon work supported by the U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers, Superconducting Quantum Materials and Systems Center (SQMS) under contract number DEAC0207CH11359. We also thank Rigetti (Marco Paini and Matt Reagor in particular) for assistance. S.M. thanks Andrea Mari for a useful discussion.
Funding
This material is based upon work supported by the U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers, Superconducting Quantum Materials and Systems Center (SQMS) under contract number DEAC0207CH11359.
Author information
Authors and Affiliations
Contributions
S.M, L.M and C.M conceived the main idea. S.M performed the analysis and simulations. All three authors discussed the results and approved the manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Additional information
The experiments with Aspen9 were performed between the end of October and start of November 2021. The calibration data used in this analysis were downloaded from https://qcs.rigetti.com/lattices on the 30 October 2021.
Appendices
Appendix A: Kraus decomposition
A quantum physical evolution is represented by (i) linear, (ii) completelypositive and (iii) tracepreserving (CPTP) maps taking quantum density operators to quantum density operators. A map satisfying these three properties is called a quantum channel, and can be interpreted as a quantum evolution obtained through the interaction of the system with an external environment. A map is a quantum channel if and only if it admits a Kraus (or operatorsum) representation as
with the trace preserving condition requiring
The operators \(\{A_{k}\}_{k}\) are called the Kraus operators of the channel, which are however nonunique [15]. Such channels are often referred to as stochastic channels [29, 30], and if they also preserve the identity (\mathcal{E}(\mathbb{1})=\mathbb{1}), they are called unital (or bistochastic). Unitality corresponds to the requirement that also {\sum}_{k}{A}_{k}{A}_{k}^{\u2020}=\mathbb{1}, from which it is clear that a sufficient condition for a CPTP map to be unital is for its Kraus operators to be selfadjoint \(A_{k} = A_{k}^{\dagger }\) ∀k.
Appendix B: Tomographic reconstruction formula for qubits
In this appendix we show how the tomographic reconstruction formula for systems made of qubits \(\mathcal{H} = \mathbb{C}^{2}\) can be recovered starting from the standard basis expansion in terms of the Pauli matrices [35]. The set of matrices \{\mathbb{1},{\sigma}_{x},{\sigma}_{y},{\sigma}_{z}\} form an orthonormal set, and constitutes a basis for the space of \(2\times 2\) complex matrices \(\mathcal{L}(\mathcal{H})=\mathbb{C}^{2\times 2}\). So, given an operator \(O \in \mathcal{L}(\mathcal{H})\), the following holds:
where
is the desired quantum estimator, with \(\{\sigma _{x},\sigma _{y},\sigma _{z}\}\) constituting the quorum of observables of the tomographic reconstruction. Equation (B.1) has the same form of the tomographic reconstruction formula in Eq. (12), with substitutions
which account for the fact that we are dealing with a discrete, and not continuous, basis expansion.
Also, note that (B.1) is not the unique choice for the tomographic formula. In fact, one could use a continuous parametrization of the group \(SU(2)\) given by operator \(\mathcal{R}(\vec{n},\psi )=e^{i\vec{s}\cdot \vec{n}\psi}\), where s⃗ is the spin of the particle (\(\vec{s}=\vec{\sigma}/2\) for qubits), \(\vec{n}=(\cos \phi \sin \theta ,\sin \phi \sin \theta , \cos \phi )\), \(\theta \in [0,\pi ]\) and \(\phi , \psi \in [0,2\pi ]\) [35].
Appendix C: Noise deconvolution for qubits
In this appendix we derive the noise deconvolution formula for qubits. Let ρ be a quantum state, and \(\mathcal{N}\) a noise channel admitting an inverse map \(\mathcal{N}^{1}\), and \(\hat{\mathcal{N}}^{1}\) its adjoint map. Then, using Eq. (18) in (16), yields
Equation (C.1) lets us deconvolve the effect of noise by evaluating the expectation value of the noiseinverted Pauli matrices \(\sigma _{\alpha}\) on the noisy state \(\mathcal{N}(\rho )\). In particular, note that the formula remains valid whether the noise is unital—that is, \mathcal{N}(\mathbb{1})={\mathcal{N}}^{1}(\mathbb{1})=\mathbb{1}—or not. In fact, in the second line we can always move the adjoint inverse noise \(\hat{\mathcal{N}}^{1}\) from the identity to the noisy state \(\mathcal{N}(\rho )\), thus obtaining Tr[{\stackrel{\u02c6}{\mathcal{N}}}^{1}(\mathbb{1})\mathcal{N}(\rho )]=Tr[\mathbb{1}{\mathcal{N}}^{1}(\mathcal{N}(\rho ))]=Tr[\rho ]=1.
Appendix D: Inverse maps of noise channels
In this appendix we explicitly calculate the inverse map of the noise channels discussed in the main text.
4.1 D.1 Bitflip, phaseflip, and bitphaseflip channels
In the following we focus on the bitflip channel, but the calculations are identical for the phaseflip and bitphaseflip channels. The bitflip channel is described by Kraus operators {A}_{0}=\sqrt{1p}\mathbb{1} and \(A_{1} = \sqrt{p} \sigma _{x}\) so that its action is given by
The Pauli Transfer Matrix \(\Gamma _{x}\) is defined as
By straightforward calculation one obtains
thus yielding
whose inverse is trivially
The eigenvectors of such Pauli Transfer Matrix are clearly the Pauli matrices \{\mathbb{1}\u300b,{\sigma}_{x}\u300b,{\sigma}_{y}\u300b,{\sigma}_{z}\u300b\} with eigenvalues \(\boldsymbol{\lambda} = (1, 1, 1/(12p), 1/(12p))\).
The operator sum representation of \(\mathcal{N}_{x}^{1}\) can be reconstructed by noticing that the map
has also the Pauli matrices as eigenvectors, but with eigenvalues \(\boldsymbol{\beta} = (\beta _{0}, \beta _{1}, \beta _{2}, \beta _{3})\). Since two maps are equals if they have the same action on a basis, then we can find the operatorsum representation of \(\mathcal{N}_{x}^{1}\) by finding those \(\beta _{j}\) such that \(\boldsymbol{\lambda} = \boldsymbol{\beta}\). If we can find such mapping, then plugging those value in (D.5), we recover the operator sum of the inverse map.
The PTM matrix \(\Gamma _{\mathcal{E}}\) of \(\mathcal{E}\) amounts to
The equality \(\Gamma _{x}^{1} = \Gamma _{\mathcal{E}}\) correspond to the system of equations
where the first equation is the tracepreserving condition, dictated by the fact that the direct map is TP, and so the inverse map has to be. This condition is also evident from the expression of \(\Gamma _{x}^{1}\) and \(\Gamma _{\mathcal{E}}\), since the first row is of the form \((1,0,0,0)\). The system of equations (D.6) has solutions
and substituting these values in Eq. (D.5) leads to the desired operatorsum representation
Similarly, the same procedure can be carried out for the dephasing (generated by \(\sigma _{z}\)) and bitphaseflip channel (generated by \(\sigma _{y}\)), leading to
Note that for all these three cases the adjoint channels are equal to the direct ones, i.e. \(\hat{\mathcal{N}}^{1} = \mathcal{N}^{1}\), since the generating operators are all Hermitian (see Appendix E for a case where this is not true).
We now proceed evaluating the explicit form of the deconvolution formula. Let \(\beta \in \{x,y,z\}\) index one of the noise channels \(\mathcal{N}_{\beta }\in \{\mathcal{N}_{x}, \mathcal{N}_{y}, \mathcal{N}_{z}\}\), the action of the inverse map on a Pauli matrix \(\sigma _{\alpha}\) amounts to
where in the second line we made use of the fact that \(\sigma _{\beta}\sigma _{\alpha}\sigma _{\beta }= (2\delta _{\alpha \beta}1)\sigma _{\alpha}\). Substituting this in Eq. (C.1), one obtains
where the subscript β in \(\langle O \rangle _{\beta}\) is just used to denote that we are deconvolving with respect to noise \(\mathcal{N}_{\beta}\), but remember that it correspond to the mitigated noisefree result.
Clearly, when the observable to be measured is itself a Pauli matrix \(O=\sigma _{\gamma}\), this further simplifies to
4.2 D.2 Depolarizing channel
The Depolarizing channel is represented by the map
having Kraus operators \{{A}_{0}=\sqrt{13p/4}\mathbb{1},{A}_{1}=\sqrt{p}{\sigma}_{x}/2,{A}_{2}=\sqrt{p}{\sigma}_{y}/2,{A}_{3}=\sqrt{p}{\sigma}_{z}/2\}.
By straightforward calculation, the Pauli Transfer Matrix amounts to
with inverse
Following the same procedure used for the bitflip channel, one arrives at the system of equations
which has solutions \(\beta _{0} = (4p)/4(1p)\) and \(\beta _{1}=\beta _{2}=\beta _{3} = p/4(1p)\). Substituting these values in (D.5), and using the relation 2Tr[O]\mathbb{1}=O+{\sigma}_{x}O{\sigma}_{x}+{\sigma}_{y}O{\sigma}_{y}+{\sigma}_{z}O{\sigma}_{z}, one obtains
Plugging this in the tomographic deconvolution formula (C.1), leads to:
from which it is clear that whenever a Pauli matrix is to be measured, \(O=\sigma _{k}\), then the expectation values are contracted by a factor \(1p\), i.e. \(\langle \sigma _{k} \rangle = \langle \sigma _{k} \rangle _{\mathrm{dep}}/(1p)\).
4.3 D.3 General Pauli channel
The most general channel involving only Pauli operators is the arbitrary Pauli channel, given by
characterized by probabilities \(\boldsymbol{p}=(p_{0}, p_{x}, p_{y}, p_{z})\), with the tracepreserving condition implying \(p_{0} = 1p_{x}p_{y}p_{z}\). The PTM of this map is diagonal
and has trivial inverse
Again, using the same procedure as before, one arrives at the system of equations:
whose solution is reported in Eq. (41) in the main text. The action of the inverse map on the Pauli matrix \(\sigma _{x}\) is
and a similar expression also hold for \(\sigma _{y}\) and \(\sigma _{z}\), from which one obtains the deconvolution formulas in Eq. (42).
Appendix E: Amplitude damping
The amplitude damping channel is given by the map
Differently from all the other cases treated above, this channel is not generated by coupled sigma matrices, and in addition one of its generators is not Hermitian. This has two consequences: first, we cannot straightforwardly apply the same eigenvalue matching procedure used above, second one must consider the adjoint channel when deconvolving.
The PTM of the amplitude damping channel is
whose inverse is
In this case the eigenvalues of \(\Gamma _{\mathrm{AD}}\) and \(\Gamma _{\mathrm{AD}}^{1}\) are not the Pauli matrices, and so we cannot use the eigenvalue matching with the general map in (2). However, the two PTMs have the same structure, so one may easily guess that the operatorsum representation of the two maps share the same operators, something that also always happened in all previous cases. Let us then suppose that the inverse map \(\mathcal{N}_{\mathrm{AD}}^{1}\) has the form
with \(\tilde{K}_{0} = 0 \rangle \langle 0+\kappa 1 \rangle \langle 1\), and \(\tilde{K_{1}} = \tau {0}\rangle \langle {1}\), with κ, τ free parameters to be determined. This map has PTM
and by requiring that \(\Gamma (\kappa ,\tau )=\Gamma _{\mathrm{AD}}^{1}\), we obtain
thus recovering the inverse map
In order to evaluate the deconvolution formula, we first need to calculate the adjoint of the inverse channel. Be Φ a linear map, its adjoint Φ̂ is defined as the unique map satisfying the following relation
where \(\langle \cdot , \cdot \rangle \) denotes the HilbertSchmidt inner product \(\langle A, B\rangle \equiv \operatorname{Tr}[A^{\dagger }B]\). Let’s consider a generic linear map of the form
which is, in general, neither CP nor TP, since we make no further hypothesis on \(\alpha _{k}\) and \(V_{k}\). By direct application of the definition of adjoint map, we obtain
where we used the linearity and cyclic property of the trace, as well as the fact that the coefficients are real, \(\alpha _{k}^{*}=\alpha _{k} \in \mathbb{R}\). We see that for any map of the form (E.8), its adjoint is obtained by simply substituting the operators with their adjoint, i.e. \(V_{k} \rightarrow V_{k}^{\dagger}\). If the map Φ leverages only Hermitian operators \(V_{k}=V_{k}^{\dagger}\), as it happens with every Pauli noise channel, than the adjoint and the direct map of course coincides, \(\hat{\Phi}(\cdot ) = \Phi (\cdot )\). However, the Amplitude Channel uses non Hermitian generators \(V_{k}\), thus has a nontrivial, yet simple, adjoint map.
Straightforward application of the deconvolution formula then leads to the deconvolved expectation values
Appendix F: 2Kraus channel
The set of channels considered here is generated by two parametrized Kraus operators
with \(A_{1} = \cos \alpha 0 \rangle \langle 0+\cos \beta 1 \rangle \langle 1\), and \(A_{2} = \sin \beta {0}\rangle \langle {1}+\sin \alpha {1}\rangle \langle {0}\). The PTM of this channel and its inverse are respectively
Using the trigonometric relation
we can rewrite the elements of \(\Gamma _{\mathrm{two}}^{1}\) as
with \(h_{\alpha \beta} = \frac{2}{\cos (2\alpha )+\cos (2\beta )}\). Written in this way, these matrix elements are very similar to those in the PTM of the direct channel \(\Gamma _{\mathrm{two}}\). The differences are in the presence of the prefactor \(h_{\alpha \beta}\), as well as in the signs of the angles in elements \((\Gamma _{\mathrm{two}}^{1})_{11}\) and \((\Gamma _{\mathrm{two}}^{1})_{22}\), and in the sign in the difference in element \((\Gamma _{\mathrm{two}}^{1})_{30}\). This suggests that the operatorsum representation of the inverse map can be obtained starting from the direct one with some small changes, as it happened with the amplitude damping channel. First of all, we can multiply the Kraus operators by \(\sqrt{h_{\alpha \beta}}\) to introduce the prefactor, then, to account for the difference in elements \((\Gamma _{\mathrm{two}}^{1})_{11}\) and \((\Gamma _{\mathrm{two}}^{1})_{22}\), we can subtract the two operators instead of summing them. At last, element \((\Gamma _{\mathrm{two}}^{1})_{30}\) can be fixed by changing \(\alpha \leftrightarrow \beta \) in the first Kraus operator \(A_{1}\). Incidentally, these changes also fix the \((\Gamma _{\mathrm{two}}^{1})_{33}\) element to the correct value. Eventually, making these changes leads to defining new operators
to be used within the inverse map
One can check that this map has the desired Pauli Transfer Matrix \(\Gamma _{\mathrm{two}}^{1}\).
As with the amplitude damping case, one the generators (\(B_{2}\)) is not Hermitian, thus one must be careful in considering the adjoint inverse map when evaluating the deconvolved mean values. By explicit calculations the following holds:
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Mangini, S., Maccone, L. & Macchiavello, C. Qubit noise deconvolution. EPJ Quantum Technol. 9, 29 (2022). https://doi.org/10.1140/epjqt/s40507022001510
Received:
Accepted:
Published:
DOI: https://doi.org/10.1140/epjqt/s40507022001510