Related papers: Operator dynamics in k-Markov random circuits
In this paper, we present a numerical framework for constructing bounds on stationary performance measures of random walks in the positive orthant using the Markov reward approach. These bounds are established in terms of stationary…
We develop a framework based on the Kirkwood-Dirac quasiprobability distribution to quantify the contribution of coherence to work extraction during generic, cyclic quantum evolutions. In particular, we focus on ``anomalous processes'',…
We propose a novel method to sequentially optimize arbitrary single-qubit gates in parameterized quantum circuits for simulating real and imaginary time evolution. The method utilizes full degrees of freedom of single-qubit gates and…
We propose a deterministic SWAP gate for spatially encoded qubits. The gate is constructed from waveguide crossings, Mach Zender Interferometers and phase shifters providing the gate reconfigurability. Through manipulating the phase of the…
Open quantum walks (OQW) are formulated as quantum Markov chains on graphs. It is shown that OQWs are a very useful tool for the formulation of dissipative quantum computing algorithms and for dissipative quantum state preparation. In…
Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…
We present an implementation of a new method for explicit simulations of time-dependent electric currents through nanojunctions. The method is based on unitary propagation of stroboscopic wave packet states and is designed to treat open…
We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then…
We consider the case of a $\sqrt{\mathrm{SWAP}}$ quantum gate and its optimized entangling action, via continuous dynamical decoupling, in the presence of dephasing noise. We illustrate the procedure in the specific case where only the…
Resource tradeoffs can often be established by solving an appropriate robust optimization problem for a variety of scenarios involving constraints on optimization variables and uncertainties. Using an approach based on sequential convex…
This paper presents a novel quadratic programming (QP) approach for constrained control allocation that directly incorporates continuous-time actuator rate constraints without requiring slack variables. Over-actuated aircraft…
Characterizing nonequilibrium dynamics in quantum many-body systems is a challenging frontier of physics. In this Letter, we systematically construct solvable nonintegrable quantum circuits that exhibit exact hidden Markovian subsystem…
Many efforts are currently underway to build a device capable of large scale quantum information processing (QIP). Whereas QIP has been demonstrated for a few qubits in several systems, many technical difficulties must be overcome in order…
It is well established that the presence of single impurity can have a substantial impact on the transport properties of quantum many-body systems at low temperature. In this work, we investigate a close analog of this problem from the…
Oscillating magnetic fields and field gradients can be used to implement single-qubit rotations and entangling multi-qubit quantum gates for trapped-ion quantum information processing (QIP). With fields generated by currents in…
We present a quantum algorithm that has rigorous runtime guarantees for several families of binary optimization problems, including Quadratic Unconstrained Binary Optimization (QUBO), Ising spin glasses ($p$-spin model), and $k$-local…
We study distributed versions of Markov Chain Monte Carlo (MCMC) algorithms for generating random $k$-colorings of an input graph with maximum degree $\Delta$. In the sequential setting, the Glauber dynamics is the simple MCMC algorithm…
We investigate whether shallow quantum circuits can accurately reproduce the short-horizon dynamics of discrete-time Markov chains derived from fashion electronic-commerce recommendation links. Transition operators are compiled into…
Here, a new two-dimensional process, discrete in time and space, that yields the results of both a random walk and a quantum random walk, is introduced. This model describes the population distribution of four coin states |1>,-|1>, |0> -|0>…
Given a universal gate set on two qubits, it is well known that applying random gates from the set to random pairs of qubits will eventually yield an approximately Haar-distributed unitary. However, this requires exponential time. We show…