Related papers: Quantum Markov chains: recurrence, Schur functions…
Quantum algorithms have demonstrated provable speedups over classical counterparts, yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge. In this work, we decode the quantum…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
We introduce quantum versions of the $\chi^2$-divergence, provide a detailed analysis of their properties, and apply them in the investigation of mixing times of quantum Markov processes. An approach similar to the one presented in [1-3]…
The 2D space-fractional Schrodinger equation in the time-independent and time-dependent cases for the scattering problem in the fractional quantum mechanics is studied. We define and give the mathematical expression of the Green's functions…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
We introduce the notion of Quasi-Stationary State (QSS) in the context of quantum Markov semigroups that generalizes the one of quasi-stationary distribution in the case of classical Markov chains. We provide an operational interpretation…
The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…
Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with…
The problem of sampling from the stationary distribution of a Markov chain finds widespread applications in a variety of fields. The time required for a Markov chain to converge to its stationary distribution is known as the classical…
Initially developed in the framework of quantum stochastic calculus, the main equations of quantum stochastic filtering were later on derived as the limits of Markov models of discrete measurements under appropriate scaling. In many…
Grover's quantum algorithm for an unstructured search problem and the Count algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum…
For downward skip-free continuous-time Markov chains on non-negative integers stopped at zero, existence of a quasi-stationary distribution is studied. The scale function for these processes is introduced and the boundary is classified by a…
Iteration of randomly chosen quadratic maps defines a Markov process: X_{n+1}=\epsilon_{n+1}X_n(1-X_n), where \epsilon_n are i.i.d. with values in the parameter space [0,4] of quadratic maps F_{\theta}(x)=\theta x(1-x). Its study is of…
We provide compelling evidence for the presence of quantum chaos in the unitary part of Shor's factoring algorithm. In particular we analyze the spectrum of this part after proper desymmetrization and show that the fluctuations of the…
The quantum-classical correspondence for dynamics of the nonlinear classically chaotic systems is analysed. The problem of quantum chaos consists of two parts: the quasiclassical quantisation of the chaotic systems and attempts to…
In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step towards this objective, the following question is being…
Given a sequence of i.i.d. random functions $\Psi_{n}:\mathbb{R}\to\mathbb{R}$, $n\in\mathbb{N}$, we consider the iterated function system and Markov chain which is recursively defined by $X_{0}^{x}:=x$ and…
In this study, a new extension of the Markov Renewal theory is introduced by allowing time to evolve in multiple dimensions. The resulting chains are referred to as multi-time Markov Renewal chains and since this extension is new, the state…
We study positive recurrence and transience of a two-station network in which the behavior of the server in each station is governed by a Markov chain with a finite number of server states; this service process can represent various service…
Quantum Field Theory with fields as Operator Valued Distributions with adequate test functions, -the basis of Epstein-Glaser approach known now as Causal Perturbation Theory-, is recalled. Its recent revival is due to new developments in…