-
Bibhas Adhikari (Fujitsu Research of America, Inc.)5/22/26, 8:45 AMSpectral Interlacing, Graph Learning, and Quantum Perspectives on Signed GraphsMinisymposium Talk
We discuss a quantum-classical streaming algorithm that processes signed edges to efficiently estimate the counts of triangles of diverse signed configurations in the edge stream. The approach introduces a quantum sketch register for processing the signed-edge-stream, together with measurement operators for query-pair calls in the quantum estimator, while a complementary classical estimator...
Go to contribution page -
Hanmeng Zhan (Worcester Polytechnic Institute)5/22/26, 9:10 AMSpectral Interlacing, Graph Learning, and Quantum Perspectives on Signed GraphsMinisymposium Talk
A discrete quantum walk takes place on the arcs of a graph, and evolves according to a coin operator and a shift operator. One important task, given the underlying graph, is to construct quantum walks that start with a state localized at a vertex and get arbitrarily close to a state localized at another vertex. In this talk, I will show how different coin operators translate into different...
Go to contribution page
Choose timezone
Your profile timezone: