We run continuous-time quantum walks with perfect and peak state transfer on a present-day superconducting quantum processor, IBM Quantum's
156-qubit Heron device ibm_kingston, deliberately without error correction or error mitigation. Perfect state transfer and its relaxations have been studied extensively in algebraic graph theory, where one can prove exactly which graphs move a quantum state from one vertex to another with probability one (or with the largest probability the graph allows, in the case of peak state transfer), and at what time. Our experiments cover perfect state transfer on the hypercubes
Q2=C4 and
Q3, and on the Hamming-weighted paths
HPn, the equitable-partition quotients of the hypercubes
Qn, for
n up to
20; peak state transfer on the
Xn family for
n up to
11; and, for comparison, moving the state along a path of qubits by a sequence of SWAP gates.
Abstract In this paper, within the framework of continuous-time quantum walks (CTQWs), we decompose graphs into disjoint strata by adopting the idea of equitable partitions. Based on the thought, we investigate the success probability of finding marked vertices on the N -fold star power graph G ⋆ N (where G is a cycle graph with three vertices), as well as the time required for perfect state transfer. Additionally, we explore the time for perfect state transfer on G ⋆ N under partition conditions from the perspective of quantum probability. Specifically, we surprisingly discover an interesting result: the times for perfect state transfer under quantum probability-based partitions and equitable partitions are completely consistent when the coupling strength J = 1 and the parameter λ = 1.
Abstract. In this work, using eigenvalues and eigenvectors of unitary Cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allow a PST occurring in its unitary Cayley graph. Moreover, we have some developments when R is a product of local rings. 1. Perfect State Transfer and Unitary Cayley Graphs Let G be an undirected graph whose vertex set V (G) = {v1,..., vn}. The adjacency matrix of G, written AG, is the n×n matrix in which entry ajk is the number of edges in G with endpoint {vj, vk}. Define the matrix-valued function H(t) = exp(itAG) for all t ≥ 0. We say there is a perfect state transfer (PST) from vertex vj to vertex vk if there is a time t such that |H(t)jk | = 1. We note that our matrix H(t) determines what is known in graph theory as a continuous quantum walk. For background on quantum walks, we refer the reader to [9] and [10]. A perfect state transfer in continuous-time quantum walk on graphs has received considerable attention in quantum information and computations in Physics (e.g., [2, 4]). An excellent survey of perfect state transfer graphs and related questions are given by Godsil [8]. Observe that H(t) has the following properties: (i) H(t) is symmetric, (ii) H(t) = H(t)−1, where ¯ is the complex conjugate, (iii) H(t) is unitary, i.e., (H(t))T = H(t)−1. Thus, we have the next proposition.