Jaroslav Novotný

Asymptotic dynamics of coined quantum walks on percolation graphs.

Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation. Openness of the systems dynamics creates decoherence, leading to strong mixing. We present a method to analytically solve the asymptotic dynamics of coined, percolated quantum walks for a general graph structure. For the case of a circle and a linear graph we derive the explicit form of the asymptotic states. We find that a rich variety of asymptotic evolutions occur: not only the fully mixed state, but other stationary states; stable periodic and quasiperiodic oscillations can emerge, depending on the coin operator, the initial state, and the topology of the underlying graph.

Application of the parallel BDDC preconditioner to the Stokes flow

Abstract A parallel implementation of the Balancing Domain Decomposition by Constraints (BDDC) method is described. It is based on formulation of BDDC with global matrices without explicit coarse problem. The implementation is based on the MUMPS parallel solver for computing the approximate inverse used for preconditioning. It is successfully applied to several problems of Stokes flow discretized by Taylor–Hood finite elements and BDDC is shown to be a promising method also for this class of problems.

Asymptotic evolution of random unitary operations

We analyze the asymptotic dynamics of quantum systems resulting from large numbers of iterations of random unitary operations. Although, in general, these quantum operations cannot be diagonalized it is shown that their resulting asymptotic dynamics is described by a diagonalizable superoperator. We prove that this asymptotic dynamics takes place in a typically low dimensional attractor space which is independent of the probability distribution of the unitary operations applied. This vector space is spanned by all eigenvectors of the unitary operations involved which are associated with eigenvalues of unit modulus. Implications for possible asymptotic dynamics of iterated random unitary operations are presented and exemplified in an example involving random controlled-not operations acting on two qubits.

A posteriori error estimates applied to flow in a channel with corners

The paper consists of three parts. In the first part, we investigate a posteriori error estimates for the Stokes and Navier-Stokes equations on two-dimensional polygonal domains. Special attention is paid to the sources of the constants in the estimates, as these play a crucial role in practical applications to adaptive refinements, as we also show. In the second part, we deal with the problem of determining accurately the constants that appear in the estimates. We present a technique for calculating the constant with high accuracy. In the third part, we apply the a posteriori error estimates with the constants found numerically to the technique of adaptive mesh refinement-we solve an incompressible flow problem in a domain with corners that cause singularities in the solution.

Asymptotic properties of quantum Markov chains

The asymptotic dynamics of discrete quantum Markov chains generated by the most general physically relevant quantum operations is investigated. It is shown that it is confined to an attractor space in which the resulting quantum Markov chain is diagonalizable. A construction procedure of a basis of this attractor space and its associated dual basis of 1-forms is presented. It is applicable whenever a strictly positive quantum state exists which is contracted or left invariant by the generating quantum operation. Moreover, algebraic relations between the attractor space and Kraus operators involved in the definition of a quantum Markov chain are derived. This construction is not only expected to offer significant computational advantages in cases in which the dimension of the Hilbert space is large and the dimension of the attractor space is small, but it also sheds new light onto the relation between the asymptotic dynamics of discrete quantum Markov chains and fixed points of their generating quantum operations. Finally, we show that without any restriction our construction applies to all initial states whose support belongs to the so-called recurrent subspace.

Entanglement and Decoherence: Fragile and Robust Entanglement

The destruction of entanglement of open quantum systems by decoherence is investigated in the asymptotic long-time limit. For this purpose a general and analytically solvable decoherence model is presented which does not involve any weak-coupling or Markovian assumption. It is shown that two fundamentally different classes of entangled states can be distinguished and that they can be influenced significantly by two important environmental properties, namely, its initially prepared state and its size. Quantum states of the first class are fragile against decoherence so that they can be disentangled asymptotically even if coherences between pointer states are still present. Quantum states of the second type are robust against decoherence. Asymptotically they can be disentangled only if also decoherence is perfect. A simple criterion for identifying these two classes on the basis of two-qubit entanglement is presented.

Quantum walks with dynamical control: Graph engineering, initial state preparation and state transfer

Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walkers evolution gives a high degree of flexibility for studying various applications. Here, we present time-multiplexed finite quantum walks of variable size, the preparation of non-localized input states and their dynamical evolution. As a further application, we implement a state transfer scheme for an arbitrary input state to two different output modes. The presented experiments rely on the full dynamical control of a time-multiplexed quantum walk, which includes adjustable coin operation as well as the possibility to flexibly configure the underlying graph structures.

Random unitary dynamics of quantum networks

We investigate the asymptotic dynamics of quantum networks under repeated applications of random unitary operations. It is shown that in the asymptotic limit of large numbers of iterations this dynamics is generally governed by a typically low dimensional attractor space. This space is determined completely by the unitary operations involved and it is independent of the probabilities with which these unitary operations are applied. Based on this general feature analytical results are presented for the asymptotic dynamics of arbitrarily large cyclic qubit networks whose nodes are coupled by randomly applied controlled-NOT operations.

Quantum walk coherences on a dynamical percolation graph

We implement a quantum walk on a percolation graph leveraging a time-multiplexed quantum walk architecture to create broken links between the graph nodes. We test our system by verifying non-Markovian signatures resulting from induced open system dynamics.

Discrete time quantum walks on percolation graphs

Abstract.Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear and disappear randomly in each step during the time evolution. The resulting open system dynamics is hard to treat numerically in general. We shortly review the literature on this problem. We then present our method to solve the evolution on finite percolation graphs in the long time limit, applying the asymptotic methods concerning random unitary maps. We work out the case of one-dimensional chains in detail and provide a concrete, step-by-step numerical example in order to give more insight into the possible asymptotic behavior. The results about the case of the two-dimensional integer lattice are summarized, focusing on the Grover-type coin operator.