Perfect state transfer in Grover walks between states associated to
vertices of a graph
- URL: http://arxiv.org/abs/2109.06418v1
- Date: Tue, 14 Sep 2021 03:59:47 GMT
- Title: Perfect state transfer in Grover walks between states associated to
vertices of a graph
- Authors: Sho Kubota, Etsuo Segawa
- Abstract summary: We study perfect state transfer in Grover walks, which are typical discrete-time quantum walk models.
We call such states type states.
We derive a necessary condition on eigenvalues of a graph for perfect state transfer between type states to occur.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We study perfect state transfer in Grover walks, which are typical
discrete-time quantum walk models. In particular, we focus on states associated
to vertices of a graph. We call such states vertex type states. Perfect state
transfer between vertex type states can be studied via Chebyshev polynomials.
We derive a necessary condition on eigenvalues of a graph for perfect state
transfer between vertex type states to occur. In addition, we perfectly
determine the complete multipartite graphs whose partite sets are the same size
on which perfect state transfer occurs between vertex type states, together
with the time.
Related papers
- Two-state transfer: a generalization of pair and plus state transfer [0.0]
A two-state in a graph $X$ is a quantum state of the form $mathbfe_u+smathbfe_v$.
We investigate quantum state transfer between two-states, where the Hamiltonian is taken to be the adjacency, Laplacian or signless Laplacian matrix of the graph.
arXiv Detail & Related papers (2024-04-25T14:45:49Z) - CKGConv: General Graph Convolution with Continuous Kernels [24.58050212186722]
We propose a novel and general graph convolution framework by parameterizing the kernels as continuous functions of pseudo-coordinates derived via graph positional encoding.
We name this Continuous Kernel Graph Convolution (CKGConv)
We show that CKGConv-based Networks outperform existing graph convolutional networks and perform comparably to the best graph transformers across a variety of graph datasets.
arXiv Detail & Related papers (2024-04-21T10:26:13Z) - Symmetry of graphs and perfect state transfer in Grover walks [0.0]
We study relationships between symmetry of graphs and perfect state transfer in Grover walks.
We characterize circulant graphs up to valency $4$ that admit perfect state transfer.
arXiv Detail & Related papers (2024-02-27T09:20:09Z) - Cohernece in permutation-invariant state enhances permutation-asymmetry [53.64687146666141]
A Dicke state and its decohered state are invariant for permutation.
When another qubits state to each of them is attached, the whole state is not invariant for permutation, and has a certain asymmetry for permutation.
This paper investigates how the coherence of a Dicke state affects the amount of asymmetry.
arXiv Detail & Related papers (2023-11-17T03:33:40Z) - Pretty good state transfer among large sets of vertices [0.0]
In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1.
We construct families of graphs to demonstrate that there is no bound on the size of a set of vertices that admit pretty good state transfer between any two vertices of the set.
arXiv Detail & Related papers (2023-05-23T17:24:14Z) - A high-fidelity quantum state transfer algorithm on the complete
bipartite graph [15.305667582809924]
Current quantum state transfer algorithms on the complete bipartite graph suffer from low fidelity in some cases.
We propose a two-stage quantum state transfer algorithm on the complete bipartite graph.
arXiv Detail & Related papers (2023-02-23T11:20:12Z) - QuTE: decentralized multiple testing on sensor networks with false
discovery rate control [130.7122910646076]
This paper designs methods for decentralized multiple hypothesis testing on graphs equipped with provable guarantees on the false discovery rate (FDR)
We consider the setting where distinct agents reside on the nodes of an undirected graph, and each agent possesses p-values corresponding to one or more hypotheses local to its node.
Each agent must individually decide whether to reject one or more of its local hypotheses by only communicating with its neighbors, with the joint aim that the global FDR over the entire graph must be controlled at a predefined level.
arXiv Detail & Related papers (2022-10-09T19:48:39Z) - Quantum-Memory-Enhanced Preparation of Nonlocal Graph States [10.086067943202416]
Graph states are an important class of multipartite entangled states.
We show an efficient scheme to prepare graph states with only two atomic excitations in quantum networks.
Our work demonstrates the prospect of efficient generation of multipartite entangled states in large-scale distributed systems.
arXiv Detail & Related papers (2022-02-27T15:42:09Z) - Quantum state transfer between twins in weighted graphs [0.0]
We explore the role of twin vertices in quantum state transfer.
We provide characterizations of periodicity, perfect state transfer, and pretty good state transfer.
As an application, we provide characterizations of all simple unweighted double cones on regular graphs that exhibit periodicity, perfect state transfer, and pretty good state transfer.
arXiv Detail & Related papers (2022-01-08T01:15:24Z) - Perfect edge state transfer on cubelike graphs [13.477892615179481]
We show that every bent function, and some semi-bent functions as well, can produce some graphs having PEST.
Notably, using our method, one can obtain some classes of infinite graphs possessing PEST.
arXiv Detail & Related papers (2020-03-24T02:33:32Z) - Perfect State Transfer on Oriented Graphs [0.0]
We study the phenomena, unique to oriented graphs, of multiple state transfer.
We give a characterization of multiple state transfer, and a new example of a graph where it occurs.
arXiv Detail & Related papers (2020-02-11T20:34:54Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.