Related papers: Operator dynamics in k-Markov random circuits
Quantum algorithm design usually assumes access to a perfect quantum computer with ideal properties like full connectivity, noise-freedom and arbitrarily long coherence time. In Noisy Intermediate-Scale Quantum (NISQ) devices, however, the…
We consider continuous-time Markov chains on integers which allow transitions to adjacent states only, with alternating rates. We give explicit formulas for probability generating functions, and also for means, variances and state…
Quantum low-density parity-check (qLDPC) codes have emerged as a promising approach for realizing low-overhead logical quantum memories. Recent theoretical developments have established shift automorphisms as a fundamental building block…
We describe a simple algorithm for sampling $n$-qubit Clifford operators uniformly at random. The algorithm outputs the Clifford operators in the form of quantum circuits with at most $5n + 2n^2$ elementary gates and a maximum depth of…
Interaction in quantum systems can spread initially localized quantum information into the many degrees of freedom of the entire system. Understanding this process, known as quantum scrambling, is the key to resolving various conundrums in…
Simulation of materials by using quantum processors is envisioned to be a major direction of development in quantum information science. Here we exploit the mathematical analogies between a triangular spin lattice with Dzyaloshinskii-Moriya…
We consider the problem of model reduction for Markovian quantum systems whose dynamics are described by a time-dependent Lindblad generator -- notably, as arising in the presence of external control. Our approach, which builds upon Krylov…
In this paper, we study pinning control problem of coupled dynamical systems with stochastically switching couplings and stochastically selected controller-node set. Here, the coupling matrices and the controller-node sets change with time,…
The large available Hilbert space and high coherence of cavity resonators makes these systems an interesting resource for storing encoded quantum bits. To perform a quantum gate on this encoded information, however, complex nonlinear…
Gate-teleportation circuits are arguably among the most basic examples of computations believed to provide a quantum computational advantage: In seminal work [Quantum Inf. Comput., 4(2):134--145], Terhal and DiVincenzo have shown that these…
In the present paper, we construct QMCs associated with Open Quantum Random Walks such that the transition operator of the chain is defined by OQRW and the restriction of QMC to the commutative subalgebra coincides with the distribution…
The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily…
While Clifford operations are relatively easy to implement in fault-tolerant quantum computers,continuous rotation gates remain a significant bottleneck in typical quantum algorithms. In this work, we ask the question: "What is the most…
In the present paper, we consider a class of Markov processes on the discrete circle which has been introduced by K\"onig, O'Connell and Roch. These processes describe movements of exchangeable interacting particles and are discrete…
The conventional circuit paradigm, utilizing a limited number of gates to construct arbitrary quantum circuits, is hindered by significant noise overhead. For instance, the standard gate paradigm employs two CNOT gates for the partial…
We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…
Non-Markovian dynamics are typically present in the dynamics of open quantum systems. Despite the rich structure of non-Markovian dynamics, their relevance to quantum information processing (QIP) has been rarely discussed. In this work, we…
We investigate how dynamical decoupling methods may be used to manipulate the time evolution of quantum many-body systems. These methods consist of sequences of external control operations designed to induce a desired dynamics. The systems…
We study K-processes, which are Markov processes in a denumerable state space, all of whose elements are stable, with the exception of a single state, starting from which the process enters finite sets of stable states with uniform…
Rate processes are simple and analytically tractable models for many dynamical systems which switch stochastically between a discrete set of quasi stationary states but they may also approximate continuous processes by coarse grained,…