اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA spectral analysis of discrete-time quantum walks related to the birth and death chains
117
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we consider a spectral analysis of discrete time quantum walks on the path. For isospectral coin cases, we show that the time averaged distribution and stationary distributions of the quantum walks are described by the pair of eigenvalues of the coins as well as the eigenvalues and eigenvectors of the corresponding random walks which are usually referred as the birth and death chains. As an example of the results, we derive the time averaged distribution of so-called Szegedys walk which is related to the Ehrenfest model. It is represented by Krawtchouk polynomials which is the eigenvectors of the model and includes the arcsine law.
قيم البحث
اقرأ أيضاً
In this paper, a baseline model termed as random birth-and-death network model (RBDN) is considered, in which at each time step, a new node is added into the network with probability p (0<p <1) connect it with m old nodes uniformly, or an existing no
de is deleted from the network with probability q=1-p. This model allows for fluctuations in size, which may reach many different disciplines in physics, ecology and economics. The purpose of this study is to develop the RBDN model and explore its basic statistical properties. For different p, we first discuss the network size of RBDN. And then combining the stochastic process rules (SPR) based Markov chain method and the probability generating function method, we provide the exact solutions of the degree distributions. Finally, the characteristics of the tail of the degree distributions are explored after simulation verification. Our results show that the tail of the degree distribution for RBDN exhibits a Poisson tail in the case of 0<p<=1/2 and an exponential tail as p approaches to 1.
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which is also a q
uantum walk. Since the effective walking graph of the projected walk is not necessarily simpler than the original, this may bring new insights into the dynamics of some kinds of quantum walks using known results from thoroughly studied cases like Euclidean lattices. We use abstract treatment of the walking space and walker displacements in aim for a generality of the presented statements. Using this approach we also identify some pathological cases in which the projection mapping breaks down. For walks on lattices, the operation typically results in quantum walks with hyper-dimensional coin spaces. Such walks can, conversely, be viewed as projections of walks on inaccessible, larger spaces, and their properties can be inferred from the parental walk. We show that this is is the case for a lazy quantum walk, a walk with large coherent jumps and a walk on a circle with a twisted boundary condition. We also discuss the relation of this theory to the time-multiplexing optical implementations of quantum walks. Moreover, this manifestly irreversible operation can, in some cases and with a minor adjustment, be undone, and a quantum walk can be reconstructed from a set of its projections.
Discrete stochastic processes (DSP) are instrumental for modelling the dynamics of probabilistic systems and have a wide spectrum of applications in science and engineering. DSPs are usually analyzed via Monte Carlo methods since the number of realiz
ations increases exponentially with the number of time steps, and importance sampling is often required to reduce the variance. We propose a quantum algorithm for calculating the characteristic function of a DSP, which completely defines its probability distribution, using the number of quantum circuit elements that grows only linearly with the number of time steps. The quantum algorithm takes all stochastic trajectories into account and hence eliminates the need of importance sampling. The algorithm can be further furnished with the quantum amplitude estimation algorithm to provide quadratic speed-up in sampling. Both of these strategies improve variance beyond classical capabilities. The quantum method can be combined with Fourier approximation to estimate an expectation value of any integrable function of the random variable. Applications in finance and correlated random walks are presented to exemplify the usefulness of our results. Proof-of-principle experiments are performed using the IBM quantum cloud platform.
Deterministically aperiodic sequences are an intermediary between periodic sequences and completely random sequences. Materials which are translationally periodic have Bloch-like extended states, while random media exhibit Anderson localisation. Mate
rials constructed on the basis of deterministic aperiodic sequences such as Fibonacci, Thue-Morse, and Rudin-Shapiro exhibit different properties, which can be related to their spectrum. Here, by investigating the dynamics of discrete-time quantum walks using different aperiodic sequences of coin operations in position space and time we establish the role of the diffraction spectra in characterizing the spreading of the wavepacket.
Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform chosen fo
r implementation, and a general framework is still missing. Here we show that coined quantum walks on a line, which represent a framework general enough to encompass a variety of different platforms, can be used for quantum state engineering of arbitrary superpositions of the walkers sites. We achieve this goal by identifying a set of conditions that fully characterize the reachable states in the space comprising walker and coin, and providing a method to efficiently compute the corresponding set of coin parameters. We assess the feasibility of our proposal by identifying a linear optics experiment based on photonic orbital angular momentum technology.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
