Ilya Safro

Dr. Ilya Safro

School of Computing, Clemson University, Clemson, SC 29631, USA

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 November 2016
Verified
Book Chapter
Closed access
PDF file
ABAydın Buluç
Aydın Buluç
HMHenning Meyerhenke
Henning Meyerhenke
ISIlya Safro
Ilya Safro
PSPeter Sanders
Peter Sanders
CSChristian Schulz
Christian Schulz

1 January 2011 in Multiscale Modeling & Simulation
Verified
Journal Article
Closed access
DRDorit Ron
Dorit Ron
ISIlya Safro
Ilya Safro
ABAchi Brandt
Achi Brandt
In this paper we generalize and improve the multiscale organization of graphs by introducing a new measure that quantifies the “closeness” between two nodes. The calculation of the measure is linear in the number of edges in the graph and involves just a small number of relaxation sweeps. A similar notion of distance is then calculated and used at each coarser level. We demonstrate the use of this measure in multiscale methods for several important combinatorial optimization problems and discuss the multiscale graph organization.

1 September 2019
Verified
Conference Paper
Closed access
RSRuslan Shaydulin
Ruslan Shaydulin
ISIlya Safro
Ilya Safro
JLJeffrey Larson
Jeffrey Larson

4 January 2022 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
XLXiaoyuan Liu
Xiaoyuan Liu
AAAnthony Angone
Anthony Angone
RSRuslan Shaydulin
Ruslan Shaydulin
ISIlya Safro
Ilya Safro
YAYuri Alexeev
Yuri Alexeev
LCLukasz Cincio
Lukasz Cincio
Combinatorial optimization on near-term quantum devices is a promising path to demonstrating quantum advantage. However, the capabilities of these devices are constrained by high noise or error rates. In this article, inspired by the variational quantum eigensolver (VQE), we propose an iterative layer VQE (L-VQE) approach. We present a large-scale numerical study, simulating circuits with up to 40 qubits and 352 parameters, that demonstrates the potential of the proposed approach. We evaluate quantum optimization heuristics on the problem of detecting multiple communities in networks, for which we introduce a novel qubit-frugal formulation. We numerically compare L-VQE with the quantum approximate optimization algorithm (QAOA) and demonstrate that QAOA achieves lower approximation ratios while requiring significantly deeper circuits. We show that L-VQE is more robust to finite sampling errors and has a higher chance of finding the solution as compared with standard VQE approaches. Our simulation results show that L-VQE performs well under realistic hardware noise.

1 March 2020 in Journal of Sound and Vibration
Verified
Journal Article
Closed access
WLWilliam Locke
William Locke
JSJustin Sybrandt
Justin Sybrandt
LRLaura Redmond
Laura Redmond
ISIlya Safro
Ilya Safro
SASez Atamturktur
Sez Atamturktur

1 January 2011 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
JCJie Chen
Jie Chen
ISIlya Safro
Ilya Safro
Measuring the connection strength between a pair of vertices in a graph is one of the most important concerns in many graph applications. Simple measures such as edge weights may not be sufficient for capturing the effects associated with short paths of lengths greater than one. In this paper, we consider an iterative process that smooths an associated value for nearby vertices, and we present a measure of the local connection strength (called the algebraic distance; see [D. Ron, I. Safro, and A. Brandt, Multiscale Model. Simul., 9 (2011), pp. 407–423]) based on this process. The proposed measure is attractive in that the process is simple, linear, and easily parallelized. An analysis of the convergence property of the process reveals that the local neighborhoods play an important role in determining the connectivity between vertices. We demonstrate the practical effectiveness of the proposed measure through several combinatorial optimization problems on graphs and hypergraphs.