Discrete-Time Quantum Walks: A Quantum Advantage for Graph Representation
- URL: http://arxiv.org/abs/2407.11630v1
- Date: Tue, 16 Jul 2024 11:49:49 GMT
- Title: Discrete-Time Quantum Walks: A Quantum Advantage for Graph Representation
- Authors: Boxuan Ai,
- Abstract summary: The paper adeptly maps intricate graph topologies into the Hilbert space, which significantly enhances the efficacy of graph analysis.
This development promises to revolutionize the intersection of quantum computing and graph theory.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this paper adeptly maps intricate graph topologies into the Hilbert space, which significantly enhances the efficacy of graph analysis and paves the way for sophisticated quantum machine learning tasks. This development promises to revolutionize the intersection of quantum computing and graph theory , charting new frontiers in the application of quantum algorithms to graph computing and network science.
Related papers
- A quantum walk-based scheme for distributed searching on arbitrary
graphs [0.0]
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton.
This work introduces a new quantum walk-based searching scheme, designed to search nodes or edges on arbitrary graphs.
arXiv Detail & Related papers (2023-10-16T14:35:05Z) - Graph-theoretic insights on the constructability of complex entangled states [0.24578723416255752]
We introduce the technique of local sparsification on experiment graphs, using which we answer a crucial open question in experimental quantum optics.
This provides us with more insights into quantum resource theory, the limitation of specific quantum photonic systems and initiates the use of graph-theoretic techniques for designing quantum physics experiments.
arXiv Detail & Related papers (2023-04-13T11:13:17Z) - Quantum Graph Learning: Frontiers and Outlook [14.1772249363715]
facilitating quantum theory to enhance graph learning is in its infancy.
We first look at QGL and discuss the mutualism of quantum theory and graph learning.
A new taxonomy of QGL is presented, i.e., quantum computing on graphs, quantum graph representation, and quantum circuits for graph neural networks.
arXiv Detail & Related papers (2023-02-02T05:53:31Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - Quantitative approach to Grover's quantum walk on graphs [62.997667081978825]
We study Grover's search algorithm focusing on continuous-time quantum walk on graphs.
Instead of finding specific graph topologies convenient for the related quantum walk, we fix the graph topology and vary the underlying graph endowed Laplacians.
arXiv Detail & Related papers (2022-07-04T19:33:06Z) - From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions.
For its practicability and wide-applicability, we give a brief review of typical graph learning techniques.
We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z) - Towards Quantum Graph Neural Networks: An Ego-Graph Learning Approach [47.19265172105025]
We propose a novel hybrid quantum-classical algorithm for graph-structured data, which we refer to as the Ego-graph based Quantum Graph Neural Network (egoQGNN)
egoQGNN implements the GNN theoretical framework using the tensor product and unity matrix representation, which greatly reduces the number of model parameters required.
The architecture is based on a novel mapping from real-world data to Hilbert space.
arXiv Detail & Related papers (2022-01-13T16:35:45Z) - Holographic tensor network models and quantum error correction: A
topical review [78.28647825246472]
Recent progress in studies of holographic dualities has led to a confluence with concepts and techniques from quantum information theory.
A particularly successful approach has involved capturing holographic properties by means of tensor networks.
arXiv Detail & Related papers (2021-02-04T14:09:21Z) - Bosonic Random Walk Networks for Graph Learning [32.24009574184356]
We explore applications of multi-particle quantum walks on diffusing information across graphs.
Our model is based on learning the operators that govern the dynamics of quantum random walkers on graphs.
We demonstrate the effectiveness of our method on classification and regression tasks.
arXiv Detail & Related papers (2020-12-31T21:40:40Z) - Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs [62.997667081978825]
We study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer.
The essential goal is to develop the theoretical framework for understanding the interplay between perfect quantum state transfer, spectral properties, and the geometry of the underlying graph.
arXiv Detail & Related papers (2020-03-25T02:46:14Z)
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.