اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStudy of Parrondos paradox regions in one-dimensional quantum walks
159
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The well-known counterintuitive phenomenon, where the combination of unfavorable situations can establish favorable ones, is called Parrondos paradox. Here, we study one-dimensional discrete-time quantum walks, manipulating two different coins (two-state) operators representing two losing games A and B, respectively, to create the Parrondo effect in the quantum domain. We exhibit that games A and B are losing games when played individually but could produce a winning expectation when played alternatively for a particular sequence of the different periods. Moreover, we also analyze the relationships between Parrondos games and quantum entanglement in our scheme. Along with the applications of different kinds of quantum walks, our outcomes potentially encourage the development of new quantum algorithms.
قيم البحث
اقرأ أيضاً
We study a series of one-dimensional discrete-time quantum-walk models labeled by half integers $j=1/2, 1, 3/2, ...$, introduced by Miyazaki {it et al.}, each of which the walkers wave function has $2j+1$ components and hopping range at each time ste
p is $2j$. In long-time limit the density functions of pseudovelocity-distributions are generally given by superposition of appropriately scaled Konnos density function. Since Konnos density function has a finite open support and it diverges at the boundaries of support, limit distribution of pseudovelocities in the $(2j+1)$-component model can have $2j+1$ pikes, when $2j+1$ is even. When $j$ becomes very large, however, we found that these pikes vanish and a universal and monotone convex structure appears around the origin in limit distributions. We discuss a possible route from quantum walks to classical diffusion associated with the $j to infty$ limit.
We outline a theory of symmetry protected topological phases of one-dimensional quantum walks. We assume spectral gaps around the symmetry-distinguished points +1 and -1, in which only discrete eigenvalues are allowed. The phase classification by int
eger or binary indices extends the classification known for translation invariant systems in terms of their band structure. However, our theory requires no translation invariance whatsoever, and the indices we define in this general setting are invariant under arbitrary symmetric local perturbations, even those that cannot be continuously contracted to the identity. More precisely we define two indices for every walk, characterizing the behavior far to the right and far to the left, respectively. Their sum is a lower bound on the number of eigenstates at +1 and -1. For a translation invariant system the indices add up to zero, so one of them already characterizes the phase. By joining two bulk phases with different indices we get a walk in which the right and left indices no longer cancel, so the theory predicts bound states at +1 or -1. This is a rigorous statement of bulk-edge correspondence. The results also apply to the Hamiltonian case with a single gap at zero.
We give a topological classification of quantum walks on an infinite 1D lattice, which obey one of the discrete symmetry groups of the tenfold way, have a gap around some eigenvalues at symmetry protected points, and satisfy a mild locality condition
. No translation invariance is assumed. The classification is parameterized by three indices, taking values in a group, which is either trivial, the group of integers, or the group of integers modulo 2, depending on the type of symmetry. The classification is complete in the sense that two walks have the same indices if and only if they can be connected by a norm continuous path along which all the mentioned properties remain valid. Of the three indices, two are related to the asymptotic behaviour far to the right and far to the left, respectively. These are also stable under compact perturbations. The third index is sensitive to those compact perturbations which cannot be contracted to a trivial one. The results apply to the Hamiltonian case as well. In this case all compact perturbations can be contracted, so the third index is not defined. Our classification extends the one known in the translation invariant case, where the asymptotic right and left indices add up to zero, and the third one vanishes, leaving effectively only one independent index. When two translationally invariant bulks with distinct indices are joined, the left and right asymptotic indices of the joined walk are thereby fixed, and there must be eigenvalues at $1$ or $-1$ (bulk-boundary correspondence). Their location is governed by the third index. We also discuss how the theory applies to finite lattices, with suitable homogeneity assumptions.
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.
Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the one-dimensional disc
rete-time QW and discuss basic steps in detail by incorporating the most general coin operator. We investigate the impact of each parameter of the general coin operator on the probability distribution of the quantum walker. We show that by tuning the parameters of the general coin, one can regulate the probability distribution of the walker. We provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study conducted on general coin operator also includes the popular coins -- Hadamard, Grover, and Fourier coins.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
