Similar to its classical version, quantum Markovian evolution can be either time-discrete or time-continuous. Discrete quantum Markovian evolution is usually modeled with completely positive trace-preserving maps, while time-continuous evolution is often specified with superoperators referred to as "Lindbladians." Here, we address the following question: Being given a quantum map, can we find a Lindbladian that generates an evolution identical-when monitored at discrete instances of time-to the one induced by the map? It was demonstrated that the problem of getting the answer to this question can be reduced to an NP-complete (in the dimension N of the Hilbert space, the evolution takes place in) problem. We approach this question from a different perspective by considering a variety of machine learning (ML) methods and trying to estimate their potential ability to give the correct answer. Complimentarily, we use the performance of different ML methods as a tool to validate a hypothesis that the answer to the question is encoded in spectral properties of the so-called Choi matrix, which can be constructed from the given quantum map. As a test bed, we use two single-qubit models for which the answer can be obtained using the reduction procedure. The outcome of our experiment is that, for a given map, the property of being generated by a time-independent Lindbladian is encoded both in the eigenvalues and the eigenstates of the corresponding Choi matrix.
Similar to its classical version, quantum Markovian evolution can be either time-discrete or time-continuous. Discrete quantum Markovian evolution is usually modeled with completely positive trace-preserving maps, while time-continuous evolution is often specified with superoperators referred to as "Lindbladians." Here, we address the following question: Being given a quantum map, can we find a Lindbladian that generates an evolution identical-when monitored at discrete instances of time-to the one induced by the map? It was demonstrated that the problem of getting the answer to this question can be reduced to an NP-complete (in the dimension N of the Hilbert space, the evolution takes place in) problem. We approach this question from a different perspective by considering a variety of machine learning (ML) methods and trying to estimate their potential ability to give the correct answer. Complimentarily, we use the performance of different ML methods as a tool to validate a hypothesis that the answer to the question is encoded in spectral properties of the so-called Choi matrix, which can be constructed from the given quantum map. As a test bed, we use two single-qubit models for which the answer can be obtained using the reduction procedure. The outcome of our experiment is that, for a given map, the property of being generated by a time-independent Lindbladian is encoded both in the eigenvalues and the eigenstates of the corresponding Choi matrix.
Most of the problems of theoretical quantum physics are characterized by a high complexity. Practically, this means that solution of such a problem demands computational effort and resources that often scale exponentially with the size of the quantum model and the solution can be obtained—even for relatively small models—only by resorting to high performance computing (HPC) technologies. Here we discuss a particular problem of the theory of open quantum systems, the so-called ‘‘Markovianity problem’’. To get the answer to the question whether a given quantum map can be obtained as the result of a time-continuous open quantum evolution, one needs to implement an algorithm whose complexity grows exponentially with the dimension of the model’s Hilbert space. We discuss how machine learning (ML) methods can be used to get the answer and provide some evidence for potential efficiency of the ML-based approach. We demonstrate that neural networks that are used to classify images can be used to determine the boundary between answers ‘‘yes’’ and ‘‘no’’ in the parameter space of a particular open quantum model. For an open model consisting of two qubits, our ML algorithm is able to give correct answer with 97% accuracy. The computational experiments were performed on the Lomonosov-2 supercomputer.
A mathematical description of the reduced dynamics of an open quantum system can often be given in terms of a completely positive and trace-preserving map, also known as a quantum channel. In a seminal work by Wolf [], it was shown that deciding whether a given quantum channel was generated from an underlying effective Markovian dynamics, with time-independent generator of Lindblad form, is generally an NP-hard problem. The difficulty is related to the fact that one has to search through all possible branches of the operator logarithm of the map in order to identify if any of the resulting effective generators is of Lindblad form. In this work we show that in cases where one has access to the full reduced dynamics at all previous times (the dynamical map) one can significantly facilitate the search for an effective generator by making use of Floquet theory. By performing a spectral unwinding such that the effective micromotion is minimized, the effective Floquet generator is often an excellent candidate for an effective generator of Lindblad form. This significantly reduces the complexity of the search for an effective Lindbladian in many (though not all) cases. Our results are relevant for engineering Floquet Lindbladians in complex many-body systems.
Learning dynamics from repeated observation of the time evolution of an open quantum system, namely, the problem of quantum process tomography is an important task. This task is difficult in general, but, with some additional constraints could be tractable. This motivates us to look at the problem of Lindblad operator discovery from observations. We point out that for moderate size Hilbert spaces, low Kraus rank of the channel, and short time steps, the eigenvalues of the Choi matrix corresponding to the channel have a special structure. We use the least-square method for the estimation of a channel where, for fixed inputs, we estimate the outputs by classical shadows. The resultant noisy estimate of the channel can then be denoised by diagonalizing the nominal Choi matrix, truncating some eigenvalues, and altering it to a genuine Choi matrix. This processed Choi matrix is then compared to the original one. We see that as the number of samples increases, our reconstruction becomes more accurate. We also use tools from random matrix theory to understand the effect of estimation noise in the eigenspectrum of the estimated Choi matrix.
We study the problem of learning arbitrary n-qubit Lindbladians, the generators of Markovian open-system dynamics, from their time evolution. We give the first known efficient algorithm that learns arbitrary Lindbladians without any structural assumptions. For an n-qubit Lindbladian of dynamical strength at most Λ, the algorithm estimates every coefficient to error ε using O(Λ2/ε2) experiments and O(Λ/ε2) total evolution time, with classical running time polynomial in n and Λ/ε. Both experimental costs match known lower bounds up to polylogarithmic factors. The algorithm identifies candidate labels through product Pauli experiments and estimates their coefficients using random stabilizer preparations and Clifford measurements. It requires no ancillas or control during the unknown evolution.
For constant k, our algorithm learns generic k-local Lindbladians of local dynamical strength at most Λloc using O(n2Λloc2/ε2) experiments and O(nΛloc/ε2) total evolution time, improving the upper bounds of prior works in terms of the dependence on n. We further improve the lower bounds of Arad, Chen, Guo, Rebentrost, and Yu (SODA 2027) using a family of 3-local Lindbladians. They already hold when the support is known, and only one Hamiltonian coefficient is requested, even for adaptive protocols with arbitrary ancillas and quantum memory. These lower bounds establish that our algorithm is optimal up to polylogarithmic factors in both experiment count and total evolution time for every fixed k≥3.
Characterizing the memory properties of the environment has become critical for the high-fidelity control of qubits and other advanced quantum systems. However, current non-Markovian tomography techniques are either limited to discrete superoperators, or they employ machine learning methods, neither of which provide physical insight into the dynamics of the quantum system. To circumvent this limitation, we design learning architectures that explicitly encode physical constraints like the properties of completely-positive trace-preserving maps in a differential form. This method preserves the versatility of the machine learning approach without sacrificing the efficiency and fidelity of traditional parameter estimation methods. Our approach provides the physical interpretability that machine learning and opaque superoperators lack. Moreover, it is aware of the underlying continuous dynamics typically disregarded by superoperator-based tomography. This paradigm paves the way to noise-aware optimal quantum control and opens a path to exploiting the bath as a control and error mitigation resource.
The stroboscopic evolution of a time-periodically driven isolated quantum system can always be described by an effective time-independent Hamiltonian. Whether this concept can be generalized to open Floquet systems, described by a Markovian Lindblad master equation with a time-periodic generator (Lindbladian), remains an open question. By using a two-level system as a model, we explicitly show the existence of two well-defined parameter regions. In one region the stroboscopic evolution can be described by a Markovian master equation with a time-independent Floquet Lindbladian. In the other it cannot; but here the one-cycle evolution operator can be reproduced with an effective non-Markovian master equation that is homogeneous but nonlocal in time. Interestingly, we find that the boundary between the phases depends on when during the period the evolution is stroboscopically monitored. This reveals the nontrivial role played by the micromotion in the dynamics of open Floquet systems.