اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPerfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs
77
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Perfect state transfer between two marked vertices of a graph by means of discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit calculation that for the coined quantum walks on star graph and complete graph with self-loops perfect state transfer between the sender and receiver vertex is achieved for arbitrary number of vertices $N$ in $O(sqrt{N})$ steps of the walk. Finally, we show that Szegedys walk with queries on complete graph allows for state transfer with unit fidelity in the limit of large $N$.
قيم البحث
اقرأ أيضاً
In this paper, we show reduction methods for search algorithms on graphs using quantum walks. By using a graph partitioning method called equitable partition for the the given graph, we determine effective subspace for the search algorithm to reduce
the size of the problem. We introduce the equitable partition for quantum walk based search algorithms and show how to determine effective subspace and reduced operator.
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient routing of high
-dimensional quantum states. Perfect state transfer of an arbitrary unknown qudit state can be achieved between two arbitrary nodes via a one-dimensional lackadaisical discrete-time quantum walk. In addition, this method can be generalized to the high-dimensional lattices, where it allows distillable entanglement to be shared between arbitrary input and output ports. Implementation of our scheme is more feasible through exploiting the coin degrees of freedom and the settings of the coin flipping operators are simple. These results provide a direct application in a high-dimensional computational architecture to process much more information.
We study the quantum walk search algorithm of Shenvi, Kempe and Whaley [PRA 67 052307 (2003)] on data structures of one to two spatial dimensions, on which the algorithm is thought to be less efficient than in three or more spatial dimensions. Our ai
m is to understand why the quantum algorithm is dimension dependent whereas the best classical algorithm is not, and to show in more detail how the efficiency of the quantum algorithm varies with spatial dimension or accessibility of the data. Our numerical results agree with the expected scaling in 2D of $O(sqrt{N log N})$, and show how the prefactors display significant dependence on both the degree and symmetry of the graph. Specifically, we see, as expected, the prefactor of the time complexity dropping as the degree (connectivity) of the structure is increased.
Estimation of the coin parameter(s) is an important part of the problem of implementing more robust schemes for quantum simulation using quantum walks. We present the estimation of the quantum coin parameter used for one-dimensional discrete-time qua
ntum walk evolution using machine learning algorithms on their probability distributions. We show that the models we have implemented are able to estimate these evolution parameters to a good accuracy level. We also implement a deep learning model that is able to predict multiple parameters simultaneously. Since discrete-time quantum walks can be used as quantum simulators, these models become important when extrapolating the quantum walk parameters from the probability distributions of the quantum system that is being simulated.
We introduce the concept of group state transfer on graphs, summarize its relationship to other concepts in the theory of quantum walks, set up a basic theory, and discuss examples. Let $X$ be a graph with adjacency matrix $A$ and consider quantum
walks on the vertex set $V(X)$ governed by the continuous time-dependent unitary transition operator $U(t)= exp(itA)$. For $S,Tsubseteq V(X)$, we says $X$ admits group state transfer from $S$ to $T$ at time $tau$ if the submatrix of $U(tau)$ obtained by restricting to columns in $S$ and rows not in $T$ is the all-zero matrix. As a generalization of perfect state transfer, fractional revival and periodicity, group state transfer satisfies natural monotonicity and transitivity properties. Yet non-trivial group state transfer is still rare; using a compactness argument, we prove that bijective group state transfer (the optimal case where $|S|=|T|$) is absent for almost all $t$. Focusing on this bijective case, we obtain a structure theorem, prove that bijective group state transfer is monogamous, and study the relationship between the projections of $S$ and $T$ into each eigenspace of the graph. Group state transfer is obviously preserved by graph automorphisms and this gives us information about the relationship between the setwise stabilizer of $Ssubseteq V(X)$ and the stabilizers of naturally defined subsets obtained by spreading $S$ out over time and crudely reversing this process. These operations are sufficiently well-behaved to give us a topology on $V(X)$ which is likely to be simply the topology of subsets for which bijective group state transfer occurs at that time. We illustrate non-trivial group state transfer in bipartite graphs with integer eigenvalues, in joins of graphs, and in symmetric double stars. The Cartesian product allows us to build new examples from old ones.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
