activity
20172023
most citedEvidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem

119 citations · 1.3k across the 37 of their papers we have counts for

collaborators
Showing 2019Show all

8 papers · 1 filter

cs.LG2019★ 90 cited

Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems

Sami Khairy, Ruslan Shaydulin, Lukasz Cincio +2

Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization…

cs.LG2019★ 12 cited

Reinforcement-Learning-Based Variational Quantum Circuits Optimization for Combinatorial Problems

Sami Khairy, Ruslan Shaydulin, Lukasz Cincio +2

Quantum computing exploits basic quantum phenomena such as state superposition and entanglement to perform computations. The Quantum Approximate Optimization Algorithm (QAOA) is ar…

cs.SI2019★ 5 cited

ELRUNA: Elimination Rule-based Network Alignment

Zirou Qiu, Ruslan Shaydulin, Xiaoyuan Liu +3

Networks model a variety of complex phenomena across different domains. In many applications, one of the most essential tasks is to align two or more networks to infer the similari…

quant-ph2019★ 45 cited

Evaluating Quantum Approximate Optimization Algorithm: A Case Study

Ruslan Shaydulin, Yuri Alexeev

Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising quantum algorithms for the Noisy Intermediate-Scale Quantum (NISQ) era. Quantifying the performance o…

quant-ph2019★ 57 cited

Multilevel Combinatorial Optimization Across Quantum Architectures

Hayato Ushijima-Mwesigwa, Ruslan Shaydulin, Christian F. A. Negre +3

Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore's law supercomputing era. However, the limited numbe…

cs.DS2019★ 16 cited

Hypergraph Partitioning With Embeddings

Justin Sybrandt, Ruslan Shaydulin, Ilya Safro

Problems in scientific computing, such as distributing large sparse matrix operations, have analogous formulations as hypergraph partitioning problems. A hypergraph is a generaliza…

quant-ph2019★ 92 cited

Multistart Methods for Quantum Approximate Optimization

Ruslan Shaydulin, Ilya Safro, Jeffrey Larson

Hybrid quantum-classical algorithms such as the quantum approximate optimization algorithm (QAOA) are considered one of the most promising approaches for leveraging near-term quant…

cs.SE2019★ 17 cited

Making Quantum Computing Open: Lessons from Open-Source Projects

Ruslan Shaydulin, Caleb Thomas, Paige Rodeghero

Quantum computing (QC) is an emerging computing paradigm with potential to revolutionize the field of computing. QC is a field that is quickly developing globally and has high barr…