اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSymmetry in quantum walks
306
0
0.0
(
0
)
تأليف
Hari Krovi
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. We derive an expression for hitting time using superoperators, and numerically evaluate it for the walk on the hypercube for various coins and decoherence models. We show that, by contrast to classical walks, quantum walks can have infinite hitting times for some initial states. We seek criteria to determine if a given walk on a graph will have infinite hitting times, and find a sufficient condition for their existence. The phenomenon of infinite hitting times is in general a consequence of the symmetry of the graph and its automorphism group. Symmetries of a graph, given by its automorphism group, can be inherited by the evolution operator. Using the irreducible representations of the automorphism group, we derive conditions such that quantum walks defined on this graph must have infinite hitting times for some initial states. Symmetry can also cause the walk to be confined to a subspace of the original Hilbert space for certain initial states. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph and we give an explicit construction of the quotient graph. We conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speed-up. Finally, we use symmetry and the theory of decoherence-free subspaces to determine when the subspace of the quotient graph is a decoherence-free subspace of the dynamics.
قيم البحث
اقرأ أيضاً
Classical random walks on finite graphs have an underrated property: a walk from any vertex can reach every other vertex in finite time, provided they are connected. Discrete-time quantum walks on finite connected graphs however, can have infinite hi
tting times. This phenomenon is related to graph symmetry, as previously characterized by the group of direction-preserving graph automorphisms that trivially affect the coin Hilbert space. If a graph is symmetric enough (in a particular sense) then the associated quantum walk unitary will contain eigenvectors that do not overlap a set of target vertices, for any coin flip operator. These eigenvectors span the Infinite Hitting Time (IHT) subspace. Quantum states in the IHT subspace never reach the target vertices, leading to infinite hitting times. However, this is not the whole story: the graph of the 3D cube does not satisfy this symmetry constraint, yet quantum walks on this graph with certain symmetric coins can exhibit infinite hitting times. We study the effect of coin symmetry by analyzing the group of coin-permutation symmetries (CPS): graph automorphisms that act nontrivially on the coin Hilbert space but leave the coin operator invariant. Unitaries using highly symmetric coins with large CPS groups, such as the permutation-invariant Grover coin, are associated with higher probabilities of never arriving, as a result of their larger IHT subspaces.
Quantum walks (QW) are of crucial importance in the development of quantum information processing algorithms. Recently, several quantum algorithms have been proposed to implement network analysis, in particular to rank the centrality of nodes in netw
orks represented by graphs. Employing QW in centrality ranking is advantageous comparing to certain widely used classical algorithms (e.g. PageRank) because QW approach can lift the vertex rank degeneracy in certain graphs. However, it is challenging to implement a directed graph via QW, since it corresponds to a non-Hermitian Hamiltonian and thus cannot be accomplished by conventional QW. Here we report the realizations of centrality rankings of both a three-vertex and four-vertex directed graphs with parity-time (PT) symmetric quantum walks. To achieve this, we use high-dimensional photonic quantum states, optical circuitries consisting of multiple concatenated interferometers and dimension dependent loss. Importantly, we demonstrate the advantage of QW approach experimentally by breaking the vertex rank degeneracy in a four-vertex graph. Our work shows that PT-symmetric quantum walks may be useful for realizing advanced algorithm in a quantum network.
Quantum walks have attracted attention as a promising platform realizing topological phenomena and many physicists have introduced various types of indices to characterize topologically protected bound states that are robust against perturbations. In
this paper, we introduce an index from a supersymmetric point of view. This allows us to define indices for all chiral symmetric quantum walks such as multi-dimensional split-step quantum walks and quantum walks on graphs, for which there has been no index theory. Moreover, the index gives a lower bound on the number of bound states robust against compact perturbations. We also calculate the index for several concrete examples including the unitary transformation that appears in Grovers search algorithm.
In this Chapter, we present some interesting properties of quantum walks on the line. We concentrate our attention in the emergence of invariance and provide some insights into the ultimate origin of the observed behavior. In the first part of the Ch
apter, we review the building blocks of the quantum-mechanical version of the standard random walk in one dimension. The most distinctive difference between random and quantum walks is the replacement of the random coin in the former by the action of a unitary operator upon some internal property of the later. We provide explicit expressions for the solution to the problem when the most general form for the homogeneous unitary operator is considered, and we analyze several key features of the system as the presence of symmetries or stationary limits. After that, we analyze the consequences of letting the properties of the coin operator change from site to site, and from time step to time step. In spite of this lack of homogeneity, the probabilistic properties of the motion of the walker can remain unaltered if the coin variability is chosen adequately. Finally, we show how this invariance can be connected to the gauge freedom of electromagnetism.
Given its importance to many other areas of physics, from condensed matter physics to thermodynamics, time-reversal symmetry has had relatively little influence on quantum information science. Here we develop a network-based picture of time-reversal
theory, classifying Hamiltonians and quantum circuits as time-symmetric or not in terms of the elements and geometries of their underlying networks. Many of the typical circuits of quantum information science are found to exhibit time-asymmetry. Moreover, we show that time-asymmetry in circuits can be controlled using local gates only, and can simulate time-asymmetry in Hamiltonian evolution. We experimentally implement a fundamental example in which controlled time-reversal asymmetry in a palindromic quantum circuit leads to near-perfect transport. Our results pave the way for using time-symmetry breaking to control coherent transport, and imply that time-asymmetry represents an omnipresent yet poorly understood effect in quantum information science.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
