Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

# Demonstration of non-Markovian process characterisation and control on a quantum processor

## Abstract

In the scale-up of quantum computers, the framework underpinning fault-tolerance generally relies on the strong assumption that environmental noise affecting qubit logic is uncorrelated (Markovian). However, as physical devices progress well into the complex multi-qubit regime, attention is turning to understanding the appearance and mitigation of correlated — or non-Markovian — noise, which poses a serious challenge to the progression of quantum technology. This error type has previously remained elusive to characterisation techniques. Here, we develop a framework for characterising non-Markovian dynamics in quantum systems and experimentally test it on multi-qubit superconducting quantum devices. Where noisy processes cannot be accounted for using standard Markovian techniques, our reconstruction predicts the behaviour of the devices with an infidelity of 10−3. Our results show this characterisation technique leads to superior quantum control and extension of coherence time by effective decoupling from the non-Markovian environment. This framework, validated by our results, is applicable to any controlled quantum device and offers a significant step towards optimal device operation and noise reduction.

## Introduction

The theoretical machinery for open quantum system dynamics is well-oiled in low-coupling cases, but strong environmental interactions can lead to non-trivial dynamical memory effects that are difficult to understand, much less control. The recent advent of high-performance quantum information processors (QIPs) has precipitated greater sensitivity to complex dynamical effects. In particular, it is clear that device behaviour must be understood under a relaxed Markov assumption1,2,3. The resulting non-Markovian dynamics includes more general errors that may be temporally correlated or dependent on broader environmental context4,5,6. Characterisation techniques of quantum devices such as randomised benchmarking (RB) and gate set tomography (GST) have so far represented the front line in understanding and addressing noise7,8,9,10,11. However, constructing a digestible picture of non-Markovian behaviour has proven difficult, and violates the error model assumed in these methods. Chiefly, this is because quantum correlations can forbid the division of dynamical processes into arbitrary steps of completely positive (CP), linear maps12. If information back-flow from the environment can occur, then noisy effects can be influenced by past factors; this detail can no longer be ‘forgotten’.

For device control, this is problematic. The circuit model of quantum computation is predicated on identical gates implemented at different times having identical actions. Markovian errors multiply out and propagate in predictable ways. However, non-Markovian noise gives rise to adverse effects that are much more challenging to tame. For example, correlated errors can spread across the device, and have been shown to lower thresholds of quantum error correcting codes13,14. Similarly, context-dependent gates allow for poorly understood forms of dynamical errors not describable by a Markov model. This is one of the largest obstacles to near-term QIPs; non-Markovian noise must be either eliminated or, as some have suggested, harnessed into a resource15,16,17,18,19. Until recently, there has not been a clear operational definition for quantum non-Markovianity, nor consensus that one unifying measure could even be found.

Using the recent process tensor framework20, we develop a robust device characterisation technique which is inclusive of non-Markovian dynamics. We keep discussion fully general, but demonstrate the capabilities of this method on four different IBM Quantum superconducting quantum devices. We then examine the robustness of the framework’s assumptions; address shortcomings; and demonstrate its functionality in process characterisation, memory detection, and application to adaptive quantum control. We find that we can characterise arbitrary processes down to an average infidelity of 10−3—quantifying its predictive power for the future states of the system given some past operations. We show that this outperforms the characterisation given by the standard technique of GST in the presence of non-Markovian effects, which employs a comprehensive Markov model. With non-Markovian dynamics fully accounted for, we discuss applications of the process tensor generically to adaptive quantum control. As an example, we demonstrate how two qubits can be decoupled without any a priori knowledge or assumption about their interactions, and how typically inaccessible user-designated non-unitary control operations can be realised. The efficacy of this framework over a range of devices showcases its consistency and broad range of applicability. Our results represent significant progress towards the characterisation and optimal control of non-Markovian QIPs and other quantum devices.

## Results

### Process characterisation

To characterise non-Markovian device features, we employ the process tensor framework, which was recently developed to describe arbitrary quantum processes. Non-Markovian dynamics constitute any interaction between a system and its environment which then affects the system at a later time; the environment need not even be coherent. For superconducting processors, this behaviour for example could stem from coupling with neighbouring qubits, leakage into higher energy levels, or two-level-system defects21. Here, we briefly outline some relevant background before detailing our approach to the problem. Traditional approaches to quantum stochastic dynamics are concerned with tracking the state of the system (S) as a function of time: $${\rho }_{t}={{\rm{tr}}}_{E}[{U}_{t:0}\ ({\rho }_{0}^{SE})]$$, where U( ) = u( )u is a unitary map on system-environment (SE), initially in state $${\rho }_{0}^{SE}$$ (often required to be uncorrelated). However, real experiments are driven by sequences of control operations, mathematically represented by trace non-increasing CP maps $$\{{{\mathcal{A}}}_{0},\ldots ,{{\mathcal{A}}}_{k-1}\}=:{{\bf{A}}}_{k-1:0}$$. The process tensor is designed to account for the intermediate control operations and quantifies quantum correlations between past events and the final state of the system. In doing so, the process tensor formally generalises the notion of a stochastic process to the quantum domain22 and reduces to a classical stochastic process in the correct limit23,24. The formalism gives rise to a clear necessary and sufficient definition of quantum non-Markovianity25, as well as other features of non-Markovian memory26,27,28. Figure 1a, top and bottom, illustrates respectively the traditional approach and the process tensor approach to describing a quantum process. In the top panel, a quantum state left to evolve in isolation can be reconstructed at t via quantum state tomography (QST). In the bottom panel, events come in the form of control operations applied to S at times t1 and t2; the future states of the S branch at time t are conditioned on the outcomes of the control operations.

Mathematically, the controlled dynamics has the form

$${\rho }_{k}\left({{\bf{A}}}_{k-1:0}\right)={{\rm{tr}}}_{E}[{U}_{k:k-1}\ {{\mathcal{A}}}_{k-1}\cdots \ {U}_{1:0}\ {{\mathcal{A}}}_{0}({\rho }_{0}^{SE})],$$
(1)

which can be rearranged, as depicted in Fig. 1b, to define a mapping from past control to future states: $${\rho }_{k}\left({{\bf{A}}}_{k-1:0}\right)={{\mathcal{T}}}^{k:0}[{{\bf{A}}}_{k-1:0}]$$. The process tensor, $${{\mathcal{T}}}^{k:0}$$ is a multi-linear map on the control operations, and includes all of the information hidden to the experimenter, including correlations in the initial state, and any intermediate interaction with the environment.

The set of possible sequences of CP maps Ak−1:0 forms a product vector space, built up from the spaces of temporally local operations; in particular, $${{\bf{A}}}_{k-1:0}={\bigotimes }_{j = 0}^{k-1}{{\mathcal{A}}}_{j}$$ when the operations at each time are chosen independently. As such, the process tensor is completely characterised by its input–output relations on a complete basis of control operations, just as a quantum channel is unambiguously defined by its input–output relations on a complete basis of states. Let us denote the basis for CP maps at the jth time step as $${\{{{\mathcal{B}}}_{j}^{{\mu }_{j}}\}}_{{\mu }_{j} = 1}^{{d}_{S}^{4}}$$ and the basis sequences as $${\{{{\bf{B}}}_{k-1:0}^{{\boldsymbol{\mu }}}\}}_{{\boldsymbol{\mu }} = (1,1,\cdots \ ,1)}^{({d}_{S}^{4},{d}_{S}^{4},\cdots \ ,{d}_{S}^{4})}$$ such that an arbitrary sequence of operations can be written as $${{\bf{A}}}_{k-1:0}={\sum }_{{\boldsymbol{\mu }}}{\alpha }^{{\boldsymbol{\mu }}}\,{{\bf{B}}}_{k-1:0}^{{\boldsymbol{\mu }}}$$, see Fig. 1c. Then the process tensor’s action is defined by

$${\rho }_{k}({{\bf{A}}}_{k-1:0})\,=\,\sum _{{\boldsymbol{\mu }}}{\alpha }^{{\boldsymbol{\mu }}}\,{\rho }_{k}^{{\boldsymbol{\mu }}}\quad {\rm{with}}\quad {\rho }_{k}^{{\boldsymbol{\mu }}}\,:= \,{{\mathcal{T}}}^{k:0}[{{\bf{B}}}_{k-1:0}^{{\boldsymbol{\mu }}}].$$
(2)

In other words, to reconstruct the process tensor, we need to experimentally estimate $${\rho }_{k}^{{\boldsymbol{\mu }}}$$ for all μ, this is depicted in Fig. 1d. A key assumption to this model is that the relationship between the gates acting on the system is ideal, and that the duration of the gates is small when compared to the overall dynamics of the system. For superconducting devices, single qubit gates are short, with fidelities of $${\mathcal{O}}(1{0}^{-4})$$, and so we do not expect this to be a problem. This assumption will need to be revisited for the case of two-qubit gates, however. In the ‘Methods’ section, we detail explicitly the steps to go from $${\rho }_{k}^{{\boldsymbol{\mu }}}$$ to constructing the process tensor. Once the process tensor is reconstructed, using Eq. (2), one can predict the final density matrix corresponding to any choice of control sequence Ak−1:0, as shown in Fig. 1e. We use prediction fidelity of the final states, conditioned on controls, as a performance metric for our process characterisation.

### Experimental implementation

We look now to the practical determination of the process tensor in experiment. The experiments carried out in this work used cloud-based IBM Quantum superconducting quantum devices. We first evaluated predictive capabilities of process tensor over a host of different experiments on the IBM Quantum devices ibmq_johannesburg (shortened: ‘Jo’burg’), ibmq_boeblingen (‘Boeb.’), ibmq_poughkeepsie (‘PK’), and ibmq_valencia. Our main contribution is in demonstrating how this framework leads to high fidelity process characterisation and precise control over non-Markovian dynamics. Ideally, complete process tensor construction would be achieved with the full span of CP maps. Unfortunately, efficient measurement within the coherence time is beyond the scope of most current hardware. For now, this rules out non-unital and trace-decreasing maps on superconducting devices, affording only unitary control, i.e., we do not have a complete basis of operations. With these limitations, processes can still be characterised in terms of ‘restricted’ process tensors $${{\mathcal{T}}}_{{\rm{r}}}^{k:0}$$29, defined in a similar way to the full process tensor, but constrained to act only on the subspace of operations comprising the linear span of unitary maps. This reduces the control space to $${d}_{S}^{4}-2{d}_{S}^{2}+2$$ dimensions; this work deals only with single qubit process tensors, for which the dimension is 10.

We reconstruct and test the four-time restricted process tensor $${{\mathcal{T}}}_{{\mathrm{r}}}^{3:0}$$ for a single qubit process on IBM Quantum devices. To do so, we first reconstruct the final quantum states $${\rho }_{3}^{ijk}$$. This state depends on the past controls, i.e., the initial preparation $${{\mathcal{P}}}_{0}^{i}\in {\mathcal{P}}$$ and the subsequent unitaries $${{\mathcal{U}}}_{1}^{j}\in {\mathcal{U}}$$ and $${{\mathcal{U}}}_{2}^{k}\in {\mathcal{U}}$$. The restricted process tensor is then obtained using Eq. (2). The set $${\mathcal{U}}$$ contains 28 random unitaries, where the first n elements $${{\mathcal{U}}}^{(n)}$$ are used to reconstruct $${{\mathcal{T}}}_{{\mathrm{r}}}^{3:0}$$. Each smaller basis $${{\mathcal{U}}}^{(n)}$$ is a subset of the larger bases. Randomly chosen unitaries are almost surely linearly independent, and are selected so as not to systematically preference any part of superoperator space. The remaining 28− n elements are contracted with the reconstructed $${{\mathcal{T}}}_{{\mathrm{r}}}^{3:0}$$ to obtain predictions $${\sigma }_{3}^{ijk}$$. We then compute the reconstruction fidelity

$${{\mathcal{F}}}_{ijk}:= {\left[{\rm{tr}}\sqrt{\sqrt{{\rho }_{3}^{ijk}}{\sigma }_{3}^{ijk}\sqrt{{\rho }_{3}^{ijk}}}\right]}^{2}$$
(3)

to gauge the accuracy of the prediction.

In theory, a minimal complete basis (n = 10) is all that is required for a restricted process tensor. In practice, however, we find that sampling error and, to a lesser extent, gate error, introduces inconsistencies in the linear equations described in Eq. (2), amplifying reconstruction errors. The Moore–Penrose pseudoinverse (discussed in the ‘Methods’ section) finds the coefficients minimising the least-squares error between overdetermined and inconsistent linear equations. Consequently, adding in new basis elements will suppress the noise in the fidelities of prediction. We find a surprisingly large improvement. To further minimise bias in the noise, we also order our basis from least to most overlap with the rest of the set, as determined by the Hilbert-Schmidt inner product. This basis re-ordering improved predictive fidelity by 20%.

We summarise the average reconstruction fidelity between prediction and experiment of each basis in Fig. 2a. The ‘Johannesburg (extended)’ experiment refers to process tensor experiments with idle time increased by a factor of 32. Meanwhile, ‘Johannesburg (Bell)’ is the result of creating a Bell pair, and then acting the unitaries on one half. The intention of these is to probe different dynamics of the system: the former to add a longer time-scale, and the latter to test an initially correlated state. Standard CP maps cannot describe the reduced dynamics of initially entangled states with the environment30,31, and so this evaluates a regime in which the process tensor is in principle more applicable. The results both demonstrate the effects of basis size on process tensor performance, and showcase its ability to characterise processes. Adding in new basis elements offers substantial improvement in comparison to a minimal complete basis. Most of the error in reconstruction is statistical. The effects of this can be observed in the three highest fidelity experiments, ‘Johannesburg (extended)’, ‘Johannesburg (Bell)’, and ‘Boeblingen’. The first two produce more mixed final states, whose density matrices are naturally closer together, and the third is performed with 4096 shots per circuit, compared with 1600 for the remainder. For a more fine-grained view, Fig. 2b shows box plots of the predictive fidelity distribution of a size-24 basis on each experiment. At this size, the median fidelity of characterisation is well within shot noise. Here, we have shown how to extract useful and accurate predictions, and how unbiased and overcomplete basis sets are necessary for complete practical determination of the process tensor.

### Bounding memory and comparison with GST

The impetus of the previous section was to demonstrate an experimentally verifiable method of characterising arbitrary dynamics. We now show that the above processes are indeed non-Markovian by lower bounding the memory in QIPs. We will then show that process tensors make more accurate predictions than comparable Markov models constructed using GST. To fully account for the non-Markovianity in a system requires in situ measurements, which break all correlations between the system and its environment, and represent a clean barrier to any past–future dependence25. Barring access to these, a restricted process tensor can only infer aspects of the non-Markovianity. Here, we introduce one such method to extract a lower bound on non-Markovianity.

Because the maximally depolarising channel

$${\mathcal{R}}[\rho ]=\frac{{\mathbb{I}}}{d},\quad\forall \;\rho$$
(4)

lies within the span of unitary operations, we can use it as an information barrier between time steps. A non-zero mutual information between the input operation and final measurement suggests information has travelled into the environment and returned after $${\mathcal{R}}$$ has been applied28. Figure 3a illustrates this idea for the processes we consider here, where $${\mathcal{R}}$$ takes either the first operation position, the second, or both. This tests the timing and duration of different memory effects.

The utility of the process tensor here is that it enables us to numerically search for the encoding and decoding operations which give the largest lower bound to non-Markovianity along different paths. Respectively, these are sets $${\mathcal{E}}$$ and $${\mathcal{D}}$$, the first of which contains two unitary operations applied with equal likelihood, and the second contains two orthogonal measurement effects.

The quantities we compute are the conditional mutual information (CMI) for each case:

$$\mathop{\mathrm{argmax}}_{{\mathcal{E}},{V}_{1},{\mathcal{D}}}I(E:D| {\mathcal{E}},{V}_{1},{\mathcal{R}},{\mathcal{D}}),$$
(5)
$$\mathop{\mathrm{argmax}}_{{\mathcal{E}},{V}_{2},{\mathcal{D}}}I(E:D| {\mathcal{E}},{\mathcal{R}},{V}_{2},{\mathcal{D}}),$$
(6)
$$\mathop{\mathrm{argmax}}_{{\mathcal{E}},{\mathcal{D}}}I(E:D| {\mathcal{E}},{\mathcal{R}},{\mathcal{R}},{\mathcal{D}}),$$
(7)

where:

$$I(E:D)=\sum _{e\in {\mathcal{E}}}\sum _{d\in {\mathcal{D}}}{p}_{(E,D)}(e,d){\mathrm{log}}\,\left(\frac{{p}_{(E,D)}(e,d)}{{p}_{E}(e){p}_{D}(d)}\right).$$
(8)

For each experiment, we summarise the memory lower bound in Fig. 3b. Note that we include an extra experiment ‘Valencia (H env)’, in which the neighbouring qubits are initialised into the $$\left|+\right\rangle$$ state. In almost every case, we find non-zero CMI, flagging non-Markovianity within the device. The extended Johannesburg experiment is the only case for which CMI overlaps zero in all three tests. Given that the effects are no longer observable on this longer timescale, this suggests that the memory has a finite lifetime which can be loosely upper-bounded by this experiment. This is further shown with the lower values where $${\mathcal{R}}$$ is contracted in both positions. The memory size is especially high for the experiments with coherent neighbours (‘Joburg (Bell)’ and ‘Valencia (H env)’), suggesting a passive crosstalk interaction might account for some of the environmental memory effects observed. The results of Fig. 3b suggest a coupling between neighbouring qubits on Johannesburg and Valencia (we did not assess whether the same effect was present on Boeblingen or Poughkeepsie). These dynamics provide a useful test-bed for the performance of the process tensor in a non-Markovian system when compared to a Markovian model for the process. GST, introduced in ref. 8, is a comprehensive tomographic procedure for estimating process matrices representing gate operations, preparations, and measurements. The maximum likelihood estimate of a gate set employs a Markov model, where repetitions of the gate are taken to be matrix powers.

We performed two experiments under two different scenarios on the ibmq_valencia five-qubit quantum device. The first is identical to the process tensor experiments the ‘Experimental implementation’ subsection using the set $${\mathcal{U}}$$. In addition, using GST we characterised all 28 unitary operations in $${\mathcal{U}}$$, the 4 preparations in $${\mathcal{P}}$$, as well as the the initial state and the final measurement. The estimates for each map were multiplied out to produce a Markovian prediction for the final density matrix. Both the process tensor and GST experiments were conducted first with neighbouring qubits initialised in the $$\left|0\right\rangle$$ state, and then again initialised in the $$\left|+\right\rangle$$ state. Figure 4 shows the distribution of the reconstruction fidelities for both the process tensor and GST. With a coherent environment, GST performs about 1.2% worse. The process tensor tends to perform better in cases where the final state density matrices are more mixed, because this necessarily suppresses any directional bias in the noise.

We emphasise that our comparison of the outcomes of the two techniques is not framed competitively. Indeed, they are qualitatively different: while GST estimates the stationary maps of a given (presumed composable) gateset, the process tensor characterises all possible outcomes in a set process. Figure 4 observes the breakdown of a Markov model, and benchmarks the process tensor against the state-of-the-art as a complementary tool to describing processes.

### Control in the presence of memory

In addition to non-Markovian characterisation and diagnostics, we now show that the process tensor can be a useful tool for quantum control. With a direct map from control operations to experimental outcomes, the data can be used to find which gates optimally output a desired state in a parametrised circuit. This outcome could harness external couplings to that end, using only local operations to manipulate them. Having already captured the process, the need for hybrid quantum-classical optimisation is eliminated. The desired result could be the most entangled state, highest fidelity equal superposition, or some member of a decoherence-free subspace. The procedure naturally accounts for any mitigating background, such as environmental noise or crosstalk. It is a matter of simple numerical optimisation to find the sequence of operations achieving the closest possible state to the one we desire: (i) Select an objective function $${\mathcal{L}}$$ which computes some quantity on the output density matrix, subject to the sequence Ak−1:0 of operations performed. (ii) Find:

$$\mathop{\mathrm{argmin}}_{{{\bf{A}}}_{k-1:0}}{\mathcal{L}}\left({{\mathcal{T}}}^{k:0}[{{\bf{A}}}_{k-1:0}]\right).$$
(9)

For unitaries, this is a straightforward minimisation over three parameters per time-step.

As an example, we first consider two neighbouring qubits initialised in the $$\left|+\right\rangle$$ state. Figure 5a shows the consequences of their natural coupling, extracted from the reconstructed two-qubit density matrix after some idle time. The results, which summarise negativity, mutual information, and state purities, show genuine entanglement between the two qubits. This form of dynamical behaviour will give rise to correlated errors in devices. After detection of a non-trivial interaction, we can use Eq. (9) to decouple the qubits.

So-called ‘bang-bang’ decoupling approaches have been thoroughly studied in the literature, but usually require a priori knowledge of the system–environment interaction Hamiltonian32. Using a one-step process tensor to form outcomes, our objective function is 2 − γ1 − γ2, where γi is the purity of the reduced state: $${\gamma }_{i}={\rm{tr}}({\rho }_{i}^{2})$$. Performing the minimisation in Eq. (9), we find the best decoupling operation. This turns out to be the gate

$$\left(\begin{array}{cc}0.0051&{\rm{e}}^{-i\cdot (1.073)}\\ {\rm{e}}^{i\cdot (0.188)}&0.0051\cdot {\rm{e}}^{i\cdot (2.257)}\end{array}\right),$$
(10)

which amounts to a rotation of approximately π around the axis (nxnynz) = (0.8076, 0.5894, 4.609 × 10−3). We then repeat the experiment of Fig. 5a, but periodically apply the decoupling operation approximately every 0.5 μs. This yields the results in Fig. 5b, wherein the purities of each qubit have been significantly increased, and the entanglement over time suppressed. Note that this is a demonstration of how the process tensor can be applied as an outcome-based control tool, rather than a rigorous benchmark of decoupling. We have not compared this to standard decoupling techniques, and the operation spacing times were arbitrarily chosen. For further information, see the ‘Methods’ section.

We apply this same technique to exploit non-Markovianity for enhanced quantum control, inspired by the ideas in ref. 15. Arguments for the use of non-Markovianity as a resource are founded upon accessing Hilbert space trajectories otherwise unavailable with system control. We broaden our control set by using the process tensor to include non-unitarity, limited only by the strength and duration of the underlying interaction. We achieve this by constructing a single-step process tensor on one half of a pair of coupled qubits for a set of four preparation operations. Then, we use Eq. (9) to find the parameters that produce final states closest to the ideal outputs of a randomly selected non-unitary operation, before applying the corresponding gate and performing quantum process tomography on it. The process fidelity of these non-unitary maps compared to their targets is plotted as a function of unitarity in Fig. 5c. It reaches up to 97%, showing that we can extend the control capabilities of the device by using the process tensor and a nearby coupled qubit. This target gate is achieved for a given interaction of the system with its neighbour. Since interaction time is not varied, the maximum achievable non-unitarity is fixed, which is why the process fidelity decreases when gates with a lower unitarity are targeted. This shows a way forward in which extended control regimes could be used for the implementation of non-unital and trace-decreasing maps which are necessary for the reconstruction of the full process tensor. Critically, for this to work, we do not need to perform control operations on the neighbouring qubit beyond its initialisation. For further details about this implementation, see the ‘Methods’ section.

This simple framework is widely applicable to many forms of quantum control. In particular, it allows for either mitigating or controlling non-Markovian noise without first understanding it at a microscopic level. Broadly, the user need only specify a desired outcome, without studying the means to achieve it.

## Discussion

In this paper, we have bridged the gap from a theoretical framework of non-Markovian dynamics to an experimental method which verifiably offers non-Markovian diagnostics and control. First, we demonstrated a high fidelity non-Markovian characterisation technique over a range of devices. We used this to bound the non-Markovian memory present. Then, using the reconstructed process tensor, we demonstrated operationally tractable control techniques to decouple the system qubit from its neighbour, as well as applying well-characterised intermediary non-unitary operations on the system. These methods pave the way to mitigate non-Markovian noise and streamline the performance of quantum devices. Although tested on superconducting qubits, the principles behind this technique are agnostic to the hardware. Implementation of the control operations across different platforms would be a useful avenue to explore in future work.

Like many tomographic techniques, the construction of the process tensor scales unfavourably in both the number of time-steps and number of qubits. However, for processes with finite Markov order, it is possible to reconstruct a primitive building block, from which the whole process can be inferred28. One immediate future avenue is complete process characterisation, as suggested in the previous section, which will offer better benchmark for the length of the memory. Although we found success with the use of an overcomplete basis, it would likely be fruitful to explore coupling smaller bases with conventional denoising techniques, the use of a mutually unbiased unitary basis33, or machine learning reconstruction methods34. Much like with the study of many-body entanglement, there is ample room to reduce experimental overhead with some well-placed physical assumptions.

## Methods

### Process tensor experiments

Here, we discuss the construction of a multi-time process tensor both in particular to the experiments conducted in this work, and more generally with respect to a greater set of controls. The process tensor constructed was over three time-steps of varying sizes. The experimental steps for this are as follows:

1. 1.

Initialise the qubit in state $$\left|0\right\rangle$$.

2. 2.

Apply $${{\mathcal{P}}}^{i}\in {\mathcal{P}}=\{H,S\cdot H,{\mathbb{I}},X\}$$.

3. 3.

Apply $${{\mathcal{U}}}^{j}\in {\mathcal{U}}$$.

4. 4.

Leave some amount of time.

5. 5.

Apply $${{\mathcal{U}}}^{k}\in {\mathcal{U}}$$.

6. 6.

Leave idle.

7. 7.

Repeat this sequence three times for the three QST basis measurements required.

8. 8.

Store this density matrix as $${\rho }_{3}^{ijk}$$.

9. 9.

Repeat this for all combinations of the elements of $${\mathcal{P}}$$ and $${\mathcal{U}}$$ in each slot.

For our experiments, this is a total of (4 × 28 × 28) × 3 = 9408 experiments. Interleaved between each operation is idle time equivalent to a single gate. The circuit diagram for these experiments is given in Fig. 6. We ran these at 1600 shots each with the exception of ‘Boeblingen’, which had 4096 shots. These data were then partitioned into process tensor construction, and experimental verification. The former consists of the construction of a basis-n process tensor, which used the first 4 × n × n control sequences to form a basis. We then used the remaining 4 × (28−n) × (28−n) sequences which lie outside the basis set as verification density matrices for the process tensor predictions. It is worth noting that action of the process tensor is insensitive to state preparation and measurement (SPAM) errors. Any initial state or final measurement error channels are absorbed into the definition of the process tensor, and the expansion remains the same.

The unitary basis was constructed with a randomly generated set of 28 ordered unitary matrices using the scipy.stats.unitary_group.rvs() function.

We parametrise these gates using the standard qiskit unitary parametrisation:

$$U(\theta ,\phi ,\lambda )=\left(\begin{array}{cc}{\mathrm{cos}} (\theta /2)&-{e}^{i\lambda }{\mathrm{sin}} (\theta /2)\\ {e}^{i\phi }{\mathrm{sin}} (\theta /2)&{e}^{i\lambda +i\phi }{\mathrm{cos}} (\theta /2)\end{array}\right).$$
(11)

On the IBM superconducting devices, these so-called u3 gates are implemented in two physical pulses corresponding to rotations around the x-axis, and three frame shifts corresponding to rotations around the z-axis35,36. Explicitly,

$$U(\theta ,\phi ,\lambda )={R}_{z}(\phi +3\pi ){R}_{x}(\pi /2){R}_{z}(\theta +\pi ){R}_{x}(\pi /2){R}_{z}(\lambda ).$$
(12)

Consequently, the physical duration of each u3 gate is independent of the θϕλ parameters—approximately 72 ns. We then leave the system idle for a duration of one u3 gate. Following this is one more u3 gate, an identical wait time, and then each of three basis measurements in X, Y, and Z Pauli bases required to reconstruct the output density matrix. The maximum likelihood method introduced in ref. 37 is then used to find the closest physical density matrix consistent with the data. The ordered list of density matrices collected make up the experimental data required for the process tensor.

The IBM Quantum devices are fixed-frequency superconducting transmon devices, each with similar error rates and coherence times; ibmq_boeblingen, ibmq_poughkeepsie, and ibmq_johannesburg are each 20 qubits, while ibmq_valencia is a five-qubit processor.

### Control basis and process reconstruction

An arbitrary $${{\mathcal{A}}}_{j}$$, at time step j, on a system of dimension dS may be decomposed into a linear expansion of some ordered basis $$\{{{\mathcal{B}}}_{j}^{{\mu }_{j}}\}$$ such that

$${{\mathcal{A}}}_{j}=\mathop{\sum }\limits_{{\mu }_{j} = 1}^{{d}_{S}^{4}}{\alpha }_{j}^{{\mu }_{j}}{{\mathcal{B}}}_{j}^{{\mu }_{j}}.$$
(13)

A sequence of (independently chosen) control operations may be written with a tensor product structure $${{\bf{A}}}_{k-1:0}={\bigotimes }_{j = 0}^{k-1}{{\mathcal{A}}}_{j}$$, for which each constituent map can be further decomposed into the chosen basis. The complete spatio-temporal basis of operations is then given by

$${\left\{{{\bf{B}}}_{k-1:0}^{{\boldsymbol{\mu }}} = \mathop{\bigotimes }_{j = 0}^{k-1}{{\mathcal{B}}}_{j}^{{\mu }_{j}}\right\}}_{{\boldsymbol{\mu }} = (1,1,\cdots \ ,1)}^{({d}_{S}^{4},{d}_{S}^{4},\cdots \ ,{d}_{S}^{4})},$$
(14)

where μ = (μ0μ1, , μk−1) is a k-dimensional vector of index elements, each taking values between 1 and $${d}_{S}^{4}$$. That is, it is the set with cardinality $${d}_{S}^{4k}$$ of all combinations of the k tensor products of each member of $$\{{{\mathcal{B}}}_{j}^{{\mu }_{j}}\}$$ at each time step. Measuring the output state $${\rho }_{k}^{{\boldsymbol{\mu }}}$$ for each of these basis operations is sufficient to construct the process tensor. We signify the matrix form of the process tensor $${\mathcal{T}}$$ with a caret: $$\hat{{\mathcal{T}}}$$

$${\hat{{\mathcal{T}}}}^{k:0}=\sum _{{\boldsymbol{\mu }}}{\left({{\boldsymbol{\Delta }}}_{k-1:0}^{{\boldsymbol{\mu }}}\right)}^{{\rm{T}}}\otimes {\rho }_{k}^{{\boldsymbol{\mu }}},$$
(15)

where the set $$\{{{\boldsymbol{\Delta }}}_{k-1:0}^{{\boldsymbol{\mu }}}\}$$ is known as the dual set to $$\{{\hat{{\bf{B}}}}_{k-1:0}^{{\boldsymbol{\mu }}}\}$$, satisfying $${\rm{tr}}\left[{\hat{{\bf{B}}}}_{k-1:0}^{{\boldsymbol{\mu }}}{{\boldsymbol{\Delta }}}_{k-1:0}^{{\boldsymbol{\nu }}}\right]={\delta }_{{\boldsymbol{\mu }}{\boldsymbol{\nu }}}$$. This dual set can be easily computed for any linearly independent set of vectors. To be explicit, the matrix form for the two-step process tensor using a basis of n operations is given as

$${\hat{{\mathcal{T}}}}^{3:0}=\mathop{\sum }\limits_{i = 1}^{4}\mathop{\sum }\limits_{j = 1}^{n}\mathop{\sum }\limits_{k = 1}^{n}{\left({D}_{0}^{i}\otimes {\Delta }_{1}^{j}\otimes {\Delta }_{2}^{k}\right)}^{{\rm{T}}}\otimes {\rho }_{3}^{ijk},$$
(16)

where the $$\{{D}_{0}^{i}\}$$ are dual to the preparation operations $${\mathcal{P}}$$, and the $$\{{\Delta }_{1}^{j}\}=\{{\Delta }_{2}^{k}\}$$ are dual to the circuit operations $${{\mathcal{U}}}^{(n)}$$. Sampling error in the final state density matrix, as well as error in the gates themselves, will collectively introduce inconsistencies in the set of linear equations described by Eq. (2). The error becomes significant if the basis is biased in a particular direction of superoperator space. Originally, our minimal complete basis—which had been randomly selected—produced a reconstruction fidelity of around 70%. To mitigate this error, we re-ordered our basis according to the least to most overlap with the remainder of the set according to the Hilbert-Schmidt inner product. For the first ten elements, this overlap was [0.0336, 0.0409, 0.0438, 0.0489, 0.0505, 0.0518, 0.0594, 0.0600, 0.0619, 0.0621]. After re-ordering, the reconstruction fidelity of the minimal complete basis improved to around 95%. This effect was only discovered after the completion of the experiments, at which point it was too late to change the operational basis itself. In future, a better course of action would be to examine the selection of a set of mutually unbiased unitary operators.

In general, the only positive dual operators are entanglement-breaking channels. With a restricted basis, the process tensor constructed here is not unit trace, nor is it a positive operator. Physically meaningful quantities can only be extracted from its action on the restricted basis, rather than from the explicit form given in Eq. (16). For this reason, we keep the emphasis of the process tensor in this work on its ‘actions’ rather than on information that can be gleaned from the object itself. Note that the expansion coefficients are calculated in the contraction of the operation with the process tensor. We discuss this explicitly below.

### Construction of a dual set

The procedure to construct the dual operators is as follows: for a complete set of linearly independent operations $$\{{{\mathcal{B}}}^{i}\}$$ whose matrix forms are $$\{{\hat{{\mathcal{B}}}}^{i}\}$$, we can compile the basis into a single matrix $${\mathscr{B}}$$. Write each $${\hat{{\mathcal{B}}}}^{i}={\sum }_{j}{b}_{ij}{\Gamma }_{j}$$, where {Γj} form a Hermitian, self-dual, linearly independent basis satisfying $${\rm{tr}}[{\Gamma }_{j}{\Gamma }_{k}]={\delta }_{jk}$$. In our case, we select {Γj} to be the standard basis, meaning that the kth column of the matrix $${\mathscr{B}}={\sum }_{ij}{b}_{ij}\left|i\right\rangle \left\langle j\right|$$ is $${\hat{{\mathcal{B}}}}^{k}$$ flattened into a 1D vector. Because the $$\{{\hat{{\mathcal{B}}}}^{i}\}$$ are linearly independent, $${\mathscr{B}}$$ is invertible. Let the matrix $${{\mathscr{F}}}^{\dagger }={{\mathscr{B}}}^{-1}$$ such that $${\mathscr{B}}\cdot {{\mathscr{F}}}^{\dagger }={\mathbb{I}}$$. This means that the rows of $${{\mathscr{F}}}^{\dagger }$$ are orthogonal to the rows of $${\mathscr{B}}$$. The dual matrices can then be defined as Δi = ∑jfijΓj, ensuring that $${\rm{tr}}[{\hat{{\mathcal{B}}}}^{i}{\Delta }^{j}]={\delta }_{ij}$$. Note that in this work, our basis is restricted to the sub-manifold of unitary matrices. This means that the dimension d of the space is less than the order n of the matrices. Therefore, we construct $${{\mathscr{F}}}^{\dagger }$$ as the Moore–Penrose or the right inverse of $${\mathscr{B}}$$. We also primarily operate in an over-complete setting, where the number of basis operations is greater than the dimension of the space, meaning that they cannot all be linearly independent. Here, we relax the duality condition $${\rm{tr}}[{\hat{{\mathcal{B}}}}^{i}{\Delta }^{j}]={\delta }_{ij}$$, but retain $${\sum }_{i}{\Delta }^{i}={\mathbb{I}}$$ to ensure that the expansion of any operation within the basis is complete. The over-completeness technique is necessary for a high fidelity reconstruction, owing to the sensitivity of the matrix pseudoinverse to shot-noise.

### Contracting an operation

The expansion coefficients discussed are useful in conceptual discussions of the process tensor, but in practice these are not directly computed. Instead, the action of the process tensor on a sequence of operations is found by projecting the process tensor onto the Choi state of this sequence (up to a transpose). Below, we explicitly step through this computation.

$${{\mathcal{T}}}^{k:0}\left[{{\bf{A}}}_{k-1:0}\right] ={{\rm{tr}}}_{{\rm{in}}}\left[{\left({\hat{{\bf{A}}}}_{k-1:0}\otimes {{\mathbb{I}}}_{{\rm{out}}}\right)}^{{\rm{T}}}{\hat{{\mathcal{T}}}}^{k:0}\right]\\ ={{\rm{tr}}}_{{\rm{in}}}\left[\left(\mathop{\bigotimes }\limits_{i = 0}^{k-1}{\hat{{\mathcal{A}}}}_{i}^{{\rm{T}}}\otimes {\mathbb{I}}\right)\sum \limits_{{\boldsymbol{\nu }}}{\left({{\boldsymbol{\Delta }}}_{k-1:0}^{{\boldsymbol{\nu }}}\right)}^{{\rm{T}}}\otimes {\rho }_{k}^{{\boldsymbol{\nu }}}\right]\\ ={{\rm{tr}}}_{{\rm{in}}}\left[\sum \limits_{{\boldsymbol{\mu }}}{\alpha }^{{\boldsymbol{\mu }}}\mathop{\bigotimes }\limits_{i = 0}^{k-1}{\hat{{\mathcal{B}}}}_{i}^{{\mu }_{i}{\rm{T}}}\sum \limits_{{\boldsymbol{\nu }}}\mathop{\bigotimes }\limits_{j = 0}^{k-1}{\Delta }_{j}^{{\nu }_{j}{\rm{T}}}\otimes {\rho }_{k}^{{\boldsymbol{\nu }}}\right]\\ ={{\rm{tr}}}_{{\rm{in}}}\left[\sum \limits_{{\boldsymbol{\mu }},{\boldsymbol{\nu }}}{\alpha }^{{\boldsymbol{\mu }}}\mathop{\bigotimes} \limits_{i,j = 0}^{k-1}\{{\hat{{\mathcal{B}}}}_{i}^{{\mu }_{i}{\rm{T}}}{\Delta }_{j}^{{\nu }_{j}{\rm{T}}}\}\otimes {\rho }_{k}^{{\boldsymbol{\nu }}}\right]\\ =\sum \limits_{{\boldsymbol{\mu }},{\boldsymbol{\nu }}}{\alpha }^{{\boldsymbol{\mu }}}\mathop{\prod }\limits_{i,j = 0}^{k-1}\ {\rm{tr}}\left[{\hat{{\mathcal{B}}}}_{i}^{{\mu }_{i}}{\Delta }_{j}^{{\nu }_{j}}\right]{\rho }_{k}^{{\boldsymbol{\nu }}}\\ =\sum\limits _{{\boldsymbol{\mu }},{\boldsymbol{\nu }}}{\alpha }^{{\boldsymbol{\mu }}}\mathop{\prod }\limits_{i = 0}^{k-1}\ {\delta }_{{\boldsymbol{\mu }}{\boldsymbol{\nu }}}\ {\rho }_{k}^{{\boldsymbol{\nu }}}\\ =\sum \limits_{{\boldsymbol{\mu }}}{\alpha }^{{\boldsymbol{\mu }}}{\rho }_{k}^{{\boldsymbol{\mu }}}\\ ={\rho }_{k}({{\bf{A}}}_{k-1:0}).$$
(17)

The direct calculation of each expansion coefficient is therefore given by

$${\alpha }^{{\boldsymbol{\mu }}}={\rm{tr}}\left[{\hat{{\bf{A}}}}_{k-1:0}{{\boldsymbol{\Delta }}}_{k-1:0}^{{\boldsymbol{\mu }}}\right]$$
(18)
$$\,\,\,\,\,\,\,\,\,={\rm{tr}}\left[\mathop{\bigotimes} _{i = 0}^{k-1} {\hat{\mathcal{A}}}_{i}{\Delta }^{(\mu ,i)}\right]$$
(19)
$$=\mathop{\prod }\limits_{i = 0}^{k-1} {\rm{tr}}\left[{\hat{{\mathcal{A}}}}_{i}{\Delta }_{i}^{{\mu }_{i}}\right]=\mathop{\prod }\limits_{i = 0}^{k-1}{\alpha }_{i}^{{\mu }_{i}}.$$
(20)

### Bounding memory

In this subsection, we estimate a lower bound for the memory present in the devices. This is accomplished with the contraction of different encoding operations with the process tensor and forming predictions for the output in this way. For the case where $${\mathcal{R}}$$ is contracted in position one, the explicit steps are as follows:

1. 1.

Pick $${{\mathcal{E}}}^{0},{{\mathcal{E}}}^{1}\in U(2)$$.

2. 2.

Pick $${p}_{{e}_{0}}$$ and $${p}_{{e}_{1}}$$ s.t. $${p}_{{a}_{i}}\in [0,1]$$ and $${p}_{{e}_{0}}+{p}_{{e}_{1}}=1$$ (in this experiment, we set $${p}_{{e}_{0}}={p}_{{e}_{1}}=0.5$$).

3. 3.

Pick $${\mathcal{D}}\in U(2)$$.

4. 4.

Pick $${\mathcal{V}}\in U(2)$$.

5. 5.

Compute the four values of p(ED)(eidj) by collecting the density matrix $${\rho }^{i}={{\mathcal{T}}}^{3:0}[{{\mathcal{E}}}^{i},{\mathcal{V}},{\mathcal{R}}]$$ and then setting $${p}_{(E,D)}({e}_{i},{d}_{j})={p}_{{e}_{i}}\cdot {\rm{Tr}}(| j\rangle \langle j| \cdot {\mathcal{D}}{\rho }_{i}{{\mathcal{D}}}^{\dagger })$$.

6. 6.

Compute the marginal distributions: pE(ei) = ∑jp(ED)(eidj) and pD(dj) = ∑ip(ED)(eidj).

7. 7.

Finally, compute I(ED).

These steps are framed as an optimisation problem where $${\mathcal{E}},{\mathcal{D}},$$ and $${\mathcal{V}}$$ are chosen such that I(ED) is maximised.

Implicit in this exercise is the assumption that operations outside the preparation set achieve the same reconstruction fidelity as the latter steps shown in Fig. 2. Although we did not examine this assumption for every machine, in Fig. 7 we construct a four time process tensor on Valencia using the basis $${{\mathcal{U}}}^{(4)}\otimes {{\mathcal{U}}}^{(n)}\otimes {{\mathcal{U}}}^{(n)}$$. We then compare the reconstruction infidelity from predictions made by the process tensor: firstly, compared to gate sequences where the preparation operation lay inside the basis set (with $${{\mathcal{U}}}_{1}^{i}$$ and $${{\mathcal{U}}}_{2}^{j}$$ outside), and secondly compared to gate sequences where the preparation operations were the next four elements of $${\mathcal{U}}$$. We find these two collections to be identical within error bars for all basis sizes 10 and above. Given that Valencia had the worst reconstruction fidelity of the machines, we view this as sufficient evidence that the assumption is valid across all machines.

### GST comparison

The GST experiments conducted in the ‘Comparison with GST’ subsection were completed using the pyGSTi quantum processor performance package38,39. Following the procedures outlined in the documentation, with background given in refs. 9,40, we characterised the 28 random unitaries as well as the 4 preparation gates in 8 groups of 4 gates. The software package designates the circuits required, and carries out the maximum likelihood reconstruction of the gates with the constraint of complete positivity and trace preservation. The gate sequences were repeated in powers of 2: 1, 2, 4, 8, 16,  and 32 times. Included in this estimate are the SPAM vectors, $$|\rho \rangle \rangle$$ and $$\langle \langle E|$$. The process tensor and GST experiments were conducted in the one calibration period for the device in a window of ~5 h. The gates were characterised in different groups for computational convenience; however, this means that the final estimate for each group cannot necessarily be mixed. There exists a gauge freedom in GST, in which measurement outcomes $$\langle \langle E|G|\rho \rangle \rangle$$ is invariant under the transformation $$\langle \langle E|\,\mapsto\, \langle\langle E|B$$, $$|\rho \rangle\rangle\, \mapsto\, {B}^{-1}|\rho \rangle \rangle$$ and G B−1GB. In the GST estimate, this gauge is optimised to bring the gate set as close as possible to the target set. However, in principle, each of the sets characterised will be in slightly different gauges. In order to estimate the effects of this, we computed the reconstruction fidelities with respect to the SPAM vector estimates of each gate set estimate. Of the different gauges, the one with the maximum average difference between the data points in any of these distributions and the for the $$\left|+\right\rangle$$ neighbour given in Fig. 4 is 5.9 × 10−3, which is similar in magnitude to sampling error and does not significantly affect the comparison. This suggests that the absolute performance of the GST estimates could be marginally better than what is shown.

Here, we more explicitly discuss our adaptive control methods using the process tensor. In each case, the system qubit and its neighbour were both initialised in the $$\left|+\right\rangle$$ state. We sought to use the process tensor to control the always-on interaction between the two qubits without actually learning it. The circuit diagrams describing both experiments are in Fig. 8.

In the first scenario, using operations only on qubit 1, we construct a single-step process tensor with a size-24 basis, 256 ns of idle time on either side, and two-qubit state tomography at the end. Altogether, this is 24 × 9 = 216 experiments. Strictly speaking, only single qubit state tomography is required for the purpose of decoupling one qubit; however, we created a mapping to the two-qubit output in order to specifically best show these two qubits decoupled. With the intermediate operation parametrised as in Eq. (11), the minimisation performed was:

$$\mathop{\mathrm{argmin}}\limits_{\theta ,\phi ,\lambda }2-{\gamma }_{1}-{\gamma }_{2}$$
(21)

where γi is the purity of the ith reduced density matrix produced by the process tensor. The total density matrix is $${{\mathcal{T}}}^{1:0}\left[U(\theta ,\phi ,\lambda )\right]$$. The decoupling operation found was

$$\left(\begin{array}{cc}0.0051&{{\rm{e}}}^{-i\cdot (1.073)}\\ {{\rm{e}}}^{i\cdot (0.188)}&0.0051\cdot {{\rm{e}}}^{i\cdot (2.257)}\end{array}\right).$$

This amounts to a rotation of approximately π around the axis (nxnynz) = (0.8076, 0.5894, 4.609 × 10−3). In Fig. 5b, we periodically apply this operation to the system after the equivalent amount of time in order to decouple the two qubits.

For the purpose of implementing our own chosen non-unitary operations, we created a one-step basis-24 process tensor on a single qubit whose neighbour was in the $$\left|+\right\rangle$$ state: ~800 ns of idle time after $${\mathcal{P}}$$ preparations, followed by $${{\mathcal{U}}}^{(24)}$$, followed by another 800 ns and then QST. We then generated a set of random non-unitary operations with unitarity ranging from 1/3 to 1.0. These are denoted by $${\mathcal{N}}(\alpha ,\eta )$$, where

$$\begin{array}{l}\qquad \,\,\,\,\,\,\,{\mathcal{N}}(\alpha ,\eta )=\sqrt{\eta }{\mathcal{E}}(\alpha )+\sqrt{1-\eta }Y{\mathcal{E}}(\alpha ),\\ {\rm{and}}\quad {\mathcal{E}}(\alpha )=({R}_{X}(\alpha ){R}_{Y}(\alpha ){R}_{Z}(\alpha )).\end{array}$$
(22)

The two operations shown in Fig. 5c are two different randomly generated values for α. The unitarity of the operations is then varied by varying η from 0 to 0.5 in the above equation. Using these operations as a target map, we numerically found the gate parameters minimising the trace distance between the target outputs of the non-unitary map and the process tensor predictions for a set of four inputs. That is, we applied the minimisation:

$$\mathop{\mathrm{argmin}}\limits_{\theta ,\phi ,\lambda }\frac{1}{2}\left(| | {\tau }_{X}-{\rho }_{X}| {| }_{1}+| | {\tau }_{Y}-{\rho }_{Y}| {| }_{1}\right. \qquad \\ \!\!+\left.| | {\tau }_{Z}-{\rho }_{Z}| {| }_{1}+| | {\tau }_{I-Z}-{\rho }_{I-Z}| {| }_{1}\right),$$
(23)

where each ρj is the ideal output of $${\mathcal{N}}(\alpha ,\eta )$$ acting on the XYZ,  and $${\mathbb{I}}-Z$$ eigenvectors, and each τj is the $${{\mathcal{T}}}^{2:0}\left[{{\mathcal{P}}}_{j},U(\theta ,\phi ,\lambda )\right]$$ predicted density matrices. Then, using the optimal values of θϕ,  and λ, we performed quantum process tomography and compared the process tensor of our implementation $${\mathcal{N}}^{\prime} (\alpha ,\eta )$$ with the ideal $${\mathcal{N}}(\alpha ,\eta )$$.

## Data availability

The datasets generated and/or analysed during the current study are available from the corresponding author on reasonable request.

## Code availability

The code developed during the current study is available from the corresponding author on reasonable request.

## References

1. 1.

Haase, J. F. et al. Controllable non-Markovianity for a spin qubit in diamond. Phys. Rev. Lett. 121, 060401 (2018).

2. 2.

Pokharel, B., Anand, N., Fortman, B. & Lidar, D. A. Demonstration of fidelity improvement using dynamical decoupling with superconducting qubits. Phys. Rev. Lett. 121, 220502 (2018).

3. 3.

Sarovar, M. et al. Detecting crosstalk errors in quantum information processors. Quantum 4, 321 https://doi.org/10.22331/q-2020-09-11-321 (2020).

4. 4.

Rivas, Á., Huelga, S. F. & Plenio, M. B. Quantum non-Markovianity: characterization, quantification and detection. Rep. Prog. Phys. 77, 094001 (2014).

5. 5.

Li, L., Hall, M. J. & Wiseman, H. M. Concepts of quantum non-Markovianity: a hierarchy. Phys. Rep. 759, 1–51 (2018).

6. 6.

Sakuldee, F., Milz, S., Pollock, F. A. & Modi, K. Non-Markovian quantum control as coherent stochastic trajectories. J. Phys. A 51, 414014 (2018).

7. 7.

Poyatos, J. F., Cirac, J. I. & Zoller, P. Complete characterization of a quantum process: the two-bit quantum gate. Phys. Rev. Lett. 78, 390–393 (1997).

8. 8.

Blume-Kohout, R. et al. Robust, self-consistent, closed-form tomography of quantum logic gates on a trapped ion qubit. Preprint at https://arxiv.org/abs/1310.4492 (2013).

9. 9.

Blume-Kohout, R. et al. Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography. Nat. Commun. 8, 1–13 (2017).

10. 10.

Merkel, S. T. et al. Self-consistent quantum process tomography. Phys. Rev. A 87, 062119 (2013).

11. 11.

White, G. A. L., Hill, C. D. & Hollenberg, L. C. L. Performance optimisation for drift-robust fidelity improvement of two-qubit gates. Preprint at http://arxiv.org/abs/1911.12096 (2019).

12. 12.

Pechukas, P. Reduced dynamics need not be completely positive. Phys. Rev. Lett. 73, 1060–1062 (1994).

13. 13.

Nickerson, N. H. & Brown, B. J. Analysing correlated noise on the surface code using adaptive decoding algorithms. Quantum 3, 131 (2019).

14. 14.

Maskara, N., Kubica, A. & Jochym-O’Connor, T. Advantages of versatile neural-network decoding for topological codes. Phys. Rev. A 99, 52351 (2019).

15. 15.

Reich, D. M., Katz, N. & Koch, C. P. Exploiting non-Markovianity for quantum control. Sci. Rep. 5, 1–7 (2015).

16. 16.

Pineda, C., Gorin, T., Davalos, D., Wisniacki, D. A. & García-Mata, I. Measuring and using non-Markovianity. Phys. Rev. A 93, 1–8 (2016).

17. 17.

Kumar, N. P., Banerjee, S. & Chandrashekar, C. M. Enhanced non-Markovian behavior in quantum walks with Markovian disorder. Sci. Rep. 8, 1–7 (2018).

18. 18.

Bylicka, B., Chruściński, D. & Maniscalco, S. Non-Markovianity as a resource for quantum technologies. Preprint at https://arxiv.org/abs/1301.2585 (2013).

19. 19.

Berk, G. D., Garner, A. J. P., Yadin, B., Modi, K. & Pollock, F. A. Resource theories of multi-time processes: a window into quantum non-Markovianity. Preprint at https://arxiv.org/abs/1907.07003 (2019).

20. 20.

Pollock, F. A., Rodríguez-Rosario, C., Frauenheim, T., Paternostro, M. & Modi, K. Non-Markovian quantum processes: complete framework and efficient characterization. Phys. Rev. A 97, 1–14 (2018).

21. 21.

Müller, C., Cole, J. H. & Lisenfeld, J. Towards understanding two-level-systems in amorphous solids: Insights from quantum circuits. Rep. Prog. Phys. 82, 1–34 (2019).

22. 22.

Milz, S., Sakuldee, F., Pollock, F. A. & Modi, K. Kolmogorov extension theorem for (quantum) causal modelling and general probabilistic theories. Quantum 4, 255 (2020).

23. 23.

Strasberg, P. & Díaz, M. G. Classical quantum stochastic processes. Phys. Rev. A 100, 022120 (2019).

24. 24.

Milz, S. et al. When is a non-Markovian quantum process classical? Preprint at http://arxiv.org/abs/1907.05807 (2019).

25. 25.

Pollock, F. A., Rodríguez-Rosario, C., Frauenheim, T., Paternostro, M. & Modi, K. Operational Markov condition for quantum processes. Phys. Rev. Lett. 120, 012127 (2018).

26. 26.

Taranto, P., Pollock, F. A., Milz, S., Tomamichel, M. & Modi, K. Quantum Markov order. Phys. Rev. Lett. 122, 140401 (2019).

27. 27.

Taranto, P., Milz, S., Pollock, F. A. & Modi, K. Structure of quantum stochastic processes with finite Markov order. Phys. Rev. A 99, 42108 (2019).

28. 28.

Taranto, P., Pollock, F. A. & Modi, K. Memory strength and recoverability of non-Markovian quantum stochastic processes. Preprint at http://arxiv.org/abs/1907.12583 (2019).

29. 29.

Milz, S., Pollock, F. A. & Modi, K. Reconstructing non-Markovian quantum dynamics with limited control. Phys. Rev. A 98, 1–14 (2018).

30. 30.

Modi, K. Operational approach to open dynamics and quantifying initial correlations. Sci. Rep. 2, 581 (2012).

31. 31.

Ringbauer, M. et al. Characterizing quantum dynamics with initial system-environment correlations. Phys. Rev. Lett. 114, 090402 (2015).

32. 32.

Lidar, D. A. & Brun, T. A. Quantum Error Correction, Vol. 9780521897 (Cambridge University Press, Cambridge, 2012).

33. 33.

Nasir, R. N., Shaari, J. S. & Mancini, S. Mutually unbiased unitary bases of operators on d -dimensional hilbert space. Int. J. Quantum Inf. 18, 1941026 (2020).

34. 34.

Guo, C., Modi, K. & Poletti, D. Tensor network based machine learning of non-Markovian quantum processes. Preprint at https://arxiv.org/abs/2004.11038 (2015).

35. 35.

Cross, A. W., Bishop, L. S., Smolin, J. A. & Gambetta, J. M. Open quantum assembly language. Preprint at https://arxiv.org/pdf/1707.03429.pdf (2017).

36. 36.

McKay, D. C., Wood, C. J., Sheldon, S., Chow, J. M. & Gambetta, J. M. Efficient $Z$ gates for quantum computing. Phys. Rev. A 96, 22330 (2017).

37. 37.

Smolin, J. A., Gambetta, J. M. & Smith, G. Efficient method for computing the maximum-likelihood quantum state from measurements with additive Gaussian noise. Phys. Rev. Lett. 108, 70502 (2012).

38. 38.

Nielsen, E. et al. Python GST Implementation (PyGSTi) v. 0.9. https://www.osti.gov//servlets/purl/1543289 (2019).

39. 39.

Nielsen, E. et al. Probing quantum processor performance with pyGSTi. Preprint at http://arxiv.org/abs/2002.12476 (2020).

40. 40.

Greenbaum, D. Introduction to quantum gate set tomography. Preprint at https://arxiv.org/abs/1509.02921 (2015).

41. 41.

Efron, B. & Tibshirani, R. Bootstrap methods for standard errors, confidence intervals, and other measures of statistical accuracy. Stat. Sci. 1, 54–75 (1986).

42. 42.

Wallman, J., Granade, C., Harper, R. & Flammia, S. T. Estimating the coherence of noise. New J. Phys. 17, 1–10 (2015).

## Acknowledgements

This work was supported by the University of Melbourne through the establishment of an IBM Quantum Network Hub at the University. G.A.L.W. is supported by an Australian Government Research Training Program Scholarship. C.D.H. is supported through a Laby Foundation grant at The University of Melbourne. K.M. is supported through Australian Research Council Future Fellowship FT160100073.

## Author information

Authors

### Contributions

G.A.L.W., C.D.H., F.A.P., L.C.L.H., and K.M. contributed to the practical development of the process tensor as a characterisation technique; G.A.L.W. designed and conducted all experiments, code, and data analysis with input from the other authors; G.A.L.W. and K.M. wrote the manuscript with input from all authors; K.M., C.D.H., and L.C.L.H. supervised the project.

### Corresponding authors

Correspondence to L. C. L. Hollenberg or K. Modi.

## Ethics declarations

### Competing interests

The authors declare no financial competing interests. The authors declare the existence of a non-financial competing interest: The project was carried out through participation in the IBM Quantum Network Hub at the University of Melbourne with work conducted on IBM quantum computers.

Peer review information Nature Communications thanks Diego Riste, Matteo Rossi and the other, anonymous, reviewer(s) for their contribution to the peer review of this work.

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Rights and permissions

Reprints and Permissions

White, G.A.L., Hill, C.D., Pollock, F.A. et al. Demonstration of non-Markovian process characterisation and control on a quantum processor. Nat Commun 11, 6301 (2020). https://doi.org/10.1038/s41467-020-20113-3

• Accepted:

• Published: