1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.ET2023
Approximate Reversible Circuits for NISQ-Era Quantum Computers
Niels Gleinig, Tobias Rohner, Torsten Hoefler
The synthesis approaches for quantum circuits typically aim at minimizing the number of lines or gates. Given the tight restrictions on those logical resources in physical implemen…
cs.DC2022★ 1 cited
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations
Maciej Besta, Cesare Miglioli, Paolo Sylos Labini +11
Important graph mining problems such as Clustering are computationally demanding. To significantly accelerate these problems, we propose ProbGraph: a graph representation that enab…