Related papers: Approximate quantum fractional revival in paths an…
Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with…
Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on the corresponding Laplacian matrix, and those graphs for which…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
Within the framework of simple perturbation theory, recurrence time of quantum fidelity is related to the period of the classical motion. This indicates the possibility of recurrence in near integrable systems. We have studied such…
In this work, we propose novel families of positional encodings tailored to graph neural networks obtained with quantum computers. These encodings leverage the long-range correlations inherent in quantum systems that arise from mapping the…
We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings. We study the relations with…
Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the…
We develop a diffusion approximation for systems subject to fast random resetting by small amplitudes. Equivalently, this describes systems with frequent but small catastrophes. We demonstrate the validity of the approximation by computing…
We study the existence of state transfer with respect to the $q$-Laplacian matrix of a graph equipped with a non-trivial involution. We show that the occurrence of perfect state transfer between certain pair (or plus) states in such a graph…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of…
We introduce and analyse approximate quantum secret sharing in a formal cryptographic setting, wherein a dealer encodes and distributes a quantum secret to players such that authorized structures (sets of subsets of players) can…
Quantum recurrence and dynamic localization are investigated in a class of ac-driven tight-binding Hamiltonians, the Krawtchouk quantum chain, which in the undriven case provides a paradigmatic Hamiltonian model that realizes perfect…
We introduce Quantum Graph Neural Networks (QGNN), a new class of quantum neural network ansatze which are tailored to represent quantum processes which have a graph structure, and are particularly suitable to be executed on distributed…
Recurrence of a random walk is described by the Polya number. For quantum walks, recurrence is understood as the return of the walker to the origin, rather than the full-revival of its quantum state. Localization for two dimensional quantum…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
Quantum walks on undirected graphs have been studied using symmetric matrices, such as the adjacency or Laplacian matrix, and many results about perfect state transfer are known. We extend some of those results to oriented graphs. We also…
Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study random walks with resetting on hypergraph by utilizing spectral…
We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…
We provide an explanation of recent experimental results of Xue et al., where full revivals in a time-dependent quantum walk model with a periodically changing coin are found. Using methods originally developed for "electric" walks with a…