May 18 – 22, 2026
Virginia Tech
America/New_York timezone

Quantum-Classical Algorithms for Counting Triangles in a Signed Edge Stream

May 22, 2026, 8:45 AM
25m
Goodwin Hall 115 (Virginia Tech)

Goodwin Hall 115

Virginia Tech

Minisymposium Talk Spectral Interlacing, Graph Learning, and Quantum Perspectives on Signed Graphs Spectral Interlacing, Graph Learning, and Quantum Perspectives on Signed Graphs

Speaker

Bibhas Adhikari (Fujitsu Research of America, Inc.)

Description

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 accounts for triangles not captured by the quantum procedure. This hybrid design yields a polynomial space advantage over purely classical approaches, extending known results from unsigned edge-stream data to the signed setting.

Authors

Mr Steven Kordonowy (University of California at Santa Cruz, CA, USA) Bibhas Adhikari (Fujitsu Research of America, Inc.) Dr Hannes Leipold (Fujitsu Research of America, Inc.)

Presentation materials

There are no materials yet.