Discrete-Time Quantum Walks: A Quantum Advantage for Graph Representation

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Ai, Boxuan
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866911957102100480
author Ai, Boxuan
author_facet Ai, Boxuan
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2407_11630
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Discrete-Time Quantum Walks: A Quantum Advantage for Graph Representation
Ai, Boxuan
Quantum Physics
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.
title Discrete-Time Quantum Walks: A Quantum Advantage for Graph Representation
topic Quantum Physics
url https://arxiv.org/abs/2407.11630