9 papers
Graph-Aware Exact Branch-and-Bound with Device Profiles for Static Qubit Allocation
Kamer Kaya
Static qubit allocation maps a circuit's logical qubits to a sparse physical device while minimising an interaction-weighted physical-distance cost function, yielding a rectangular…
Diagonal Packing for Efficient Homomorphic Sparse Matrix-Vector Multiplication
Kemal Mutluergil, Deniz Elbek, Kamer Kaya +1
Homomorphic encryption (HE) enables computation over encrypted data but incurs a substantial overhead. For sparse matrix-vector multiplication, the widely used Halevi-Shoup scheme…
Graph Traversal on Tensor Cores: A BFS Framework for Modern GPUs
Deniz Elbek, Kamer Kaya
Modern GPUs have Tensor Cores (TCs) capable of extremely high-throughput matrix operations, yet graph algorithms remain difficult to accelerate because of their irregular and data-…
BLEST: Blazingly Efficient BFS using Tensor Cores
Deniz Elbek, Kamer Kaya
Breadth-First Search (BFS) is a fundamental graph kernel that underpins a wide range of applications. While modern GPUs provide specialised Matrix-Multiply-Accumulate (MMA) units,…
SUperman: Efficient Permanent Computation on GPUs
Deniz Elbek, Fatih TaÅyaran, Bora Uçar +1
The permanent is a function, defined for a square matrix, with applications in various domains including quantum computing, statistical physics, complexity theory, combinatorics, a…
Approximating Spanning Centrality with Random Bouquets
Gökhan Göktürk, Kamer Kaya
Spanning Centrality is a measure used in network analysis to determine the importance of an edge in a graph based on its contribution to the connectivity of the entire network. Spe…