Related papers: Density profiles of the exclusive queueing process
We investigate a model for driven exclusion processes where internal states are assigned to the particles. The latter account for diverse situations, ranging from spin states in spintronics to parallel lanes in intracellular or vehicular…
We investigate a novel variant of the exclusion process in which particles perform asymmetric nearest-neighbor jumps across a bond \((k, k+1)\) only if the preceding site \((k-1)\) is unoccupied. This next-nearest-neighbor constraint…
The dynamics of many open quantum systems are described by stochastic master equations. In the discrete-time case, we recall the structure of the derived quantum filter governing the evolution of the density operator conditioned to the…
The Quantum Symmetric Simple Exclusion Process (QSSEP) is a model of quantum particles hopping on a finite interval and satisfying the exclusion principle. Recently Bernard and Jin have studied the fluctuations of the invariant measure for…
In recent years, there is considerable experimental effort using cold atoms to study strongly correlated many-body systems. One class of phenomena of particularly interests is quantum critical (QC) phenomena. While prevalent in many…
The quantum phase estimation (QPE) is one of the fundamental algorithms based on the quantum Fourier transform. It has applications in order-finding, factoring, and finding the eigenvalues of unitary operators. The major challenge in…
This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel. In our model, the queue length and channel state together form a Markov chain that depends on the system parameters.…
We investigate the dynamics of the asymmetric exclusion process at a junction. When two input roads are initially fully occupied and a single output road is initially empty, the ensuing rarefaction wave has a rich spatial structure. The…
We consider an extension of Discrete Time Markov Chain queueing model to the quantum domain by use of Discrete Time Quantum Markov Chain. We introduce methods for numerical analysis of such models. Using this tools we show that quantum…
We introduce two methods for estimating the density matrix for a quantum system: Quantum Maximum Likelihood and Quantum Variational Inference. In these methods, we construct a variational family to model the density matrix of a mixed…
The estimation of the density matrix of a $k$-level quantum system is studied when the parametrization is given by the real and imaginary part of the entries and they are estimated by independent measurements. It is established that the…
Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling…
We give numerical evidence that the location of the first order phase transition between the low and the high density phases of the one dimensional asymmetric simple exclusion process with open boundaries becomes sample dependent when…
Quantum phase estimation (QPE) is a cornerstone algorithm for extracting Hamiltonian eigenvalues, but its standard, eigenstate-centric form relies on carefully prepared coherent inputs that are costly or impractical for many strongly…
Quantum information processing exploits all the features quantum mechanics offers. Among them there is the possibility to induce nonlinear maps on a quantum system by involving two or more identical copies of the given system in the same…
Within context of quantum logic, it is possible to assign dispersion-free probabilities to experimental propositions pertaining to qubits. This makes qubits distinct from the rest of quantum systems since the latter do not admit…
We study a multispecies generalization of a left-permeable asymmetric exclusion process (LPASEP) in one dimension with open boundaries. We determine all phases in the phase diagram using an exact projection to the LPASEP solved by us in a…
The theory community has proposed several new heap variants in the recent past which have remained largely untested experimentally. We take the field back to the drawing board, with straightforward implementations of both classic and novel…
Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or greedy algorithms. However, a classical priority queue constitutes a severe bottleneck…
Simple exclusion processes for particles moving along two parallel lattices and jumping between them are theoretically investigated for asymmetric rates of transition between the channels. An approximate theoretical approach, that describes…