相关论文: Laplacian pair state transfer in Q-graph
The XX model with uniform couplings represents the most natural choice for quantum state transfer through spin chains. Given that it has long been established that single-qubit states cannot be transferred with perfect fidelity in this…
We study the notion of $k$-stabilizer universal quantum state, that is, an $n$-qubit quantum state, such that it is possible to induce any stabilizer state on any $k$ qubits, by using only local operations and classical communications.…
We study continuous-time quantum walks on normal Cayley graphs of certain non-abelian groups, called extraspecial groups. By applying general results for graphs in association schemes we determine the precise conditions for perfect state…
Using the signed laplacian matrix, and weighted and hybrid graphs, we present additional ways to interpret graphs as grid states. Hybrid graphs offer the most general interpretation. Existing graphical methods that characterize entanglement…
We present a Hamiltonian that can be used for amplifying the signal from a quantum state, enabling the measurement of a macroscopic observable to determine the state of a single spin. We prove a general mapping between this Hamiltonian and…
For a finite graph, we establish natural isomorphisms between eigenspaces of a Laplace operator acting on functions on the edges and eigenspaces of a transfer operator acting on functions on one-sided infinite non-backtracking paths.…
In this paper, we analyze state transfer in quantum walks by using combinatorial methods. We generalize perfect state transfer in two-reflection discrete-time quantum walks to a notion that we call 'peak state transfer'; we define peak…
We find analytic models that can perfectly transfer, without state initializati$ or remote collaboration, arbitrary functions in two- and three-dimensional interacting bosonic and fermionic networks. We elaborate on a possible…
We investigate the properties of different levels of entanglement in graph states which correspond to connected graphs. Combining the operational definition of graph states and the postulates of entanglement measures, we prove that in…
Weighted graph states extend standard graph states by associating phases with entangling edges, and may serve as resources for measurement-based quantum computation (MBQC). We analyze how the two main fusion operations, Type-I and Type-II,…
The graph Laplacian regularization term is usually used in semi-supervised representation learning to provide graph structure information for a model $f(X)$. However, with the recent popularity of graph neural networks (GNNs), directly…
We systematically investigated perfect state transfer between antipodal nodes of discrete time quantum walks on variants of the cycles C_4, C_6 and C_8 for three choices of coin operator. Perfect state transfer was found, in general, to be…
Quantum walks have frequently envisioned the behavior of a quantum state traversing a classically defined, generally finite, graph structure. While this approach has already generated significant results, it imposes a strong assumption: all…
Thomassen [Problem 1 in Factorizing regular graphs, J. Combin. Theory Ser. B, 141 (2020), 343-351] asked whether every $r$-edge-connected $r$-regular graph of even order has $r-2$ pairwise disjoint perfect matchings. We show that this is…
Quantum information transfer is an important part of quantum information processing. Several proposals for quantum information transfer along linear arrays of nearest-neighbor coupled qubits or spins were made recently. Perfect transfer was…
We present a thorough study of the theoretical properties and devise efficient algorithms for the \emph{persistent Laplacian}, an extension of the standard combinatorial Laplacian to the setting of pairs (or, in more generality, sequences)…
In this work, we consider the spatial search for a general marked state on graphs by continuous time quantum walks. As a simplest case, we compute the amplitude expression of the search for the multi-vertex uniform superposition state on…
The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the…
We present a conceptually new approach to describe state-of-the-art photonic quantum experiments using Graph Theory. There, the quantum states are given by the coherent superpositions of perfect matchings. The crucial observation is that…
Building upon our previous work, on graphical representation of a quantum state by signless Laplacian matrix, we pose the following question. If a local unitary operation is applied to a quantum state, represented by a signless Laplacian…