activity
20202026
most citedQuantum computing for finance

286 citations · 534 across the 36 of their papers we have counts for

collaborators

41 papers

quant-ph2026

Efficient Estimation of Reduced QAOA Expressibility on Acyclic Graphs

Bao Bach, Boris Tsvelikhovskiy, Jose Falla +1

Classically equivalent formulations of an optimization problem need not lead to equivalent quantum algorithms. For MaxCut, fixing the value of a single vertex removes a simple glob…

quant-ph2026

Constrained Counterdiabatic Quantum Approximate Optimization Algorithm for Portfolio Optimization

Jose Falla, Ilya Safro

We introduce a counterdiabatic (CD) extension of the Quantum Approximate Optimization Algorithm (QAOA) for constrained portfolio optimization. By incorporating approximate adiabati…

quant-ph2026

Reductions of QAOA Induced by Classical Symmetries: Theoretical Insights and Practical Implications

Boris Tsvelikhovskiy, Bao Bach, Jose Falla +1

The performance of the Quantum Approximate Optimization Algorithm (QAOA) is closely tied to the structure of the dynamical Lie algebra (DLA) generated by its Hamiltonians, which de…

cs.IR2025

Biomedical Hypothesis Explainability with Graph-Based Context Retrieval

Ilya Tyagin, Saeideh Valipour, Aliaksandra Sikirzhytskaya +2

We introduce an explainability method for biomedical hypothesis generation systems, built on top of the novel Hypothesis Generation Context Retriever framework. Our approach combin…

quant-ph2025

Neural Architecture Search Algorithms for Quantum Autoencoders

Ankit Kulshrestha, Xiaoyuan Liu, Hayato Ushijima-Mwesigwa +1

The design of quantum circuits is currently driven by the specific objectives of the quantum algorithm in question. This approach thus relies on a significant manual effort by the…

quant-ph2025

QMoE: A Quantum Mixture of Experts Framework for Scalable Quantum Neural Networks

Hoang-Quan Nguyen, Xuan-Bac Nguyen, Sankalp Pandey +3

Quantum machine learning (QML) has emerged as a promising direction in the noisy intermediate-scale quantum (NISQ) era, offering computational and memory advantages by harnessing s…

cs.SI2025

ELRUHNA: Elimination Rule-basedHypergraph Alignment

Cameron Ibrahim, S M Ferdous, Ilya Safro +2

Hypergraph alignment is a well-known NP-hard problem with numerous practical applications across domains such as bioinformatics, social network analysis, and computer vision. Despi…

quant-ph2025

Solving Large-Scale QUBO with Transferred Parameters from Multilevel QAOA of low depth

Bao G Bach, Filip B. Maciejewski, Ilya Safro

The Quantum Approximate Optimization Algorithm (QAOA) is a promising quantum approach for tackling combinatorial optimization problems. However, hardware constraints such as limite…

quant-ph2025

QAOA Parameter Transferability for Maximum Independent Set using Graph Attention Networks

Hanjing Xu, Xiaoyuan Liu, Alex Pothen +1

The quantum approximate optimization algorithm (QAOA) is one of the promising variational approaches of quantum computing to solve combinatorial optimization problems. In QAOA, var…

quant-ph2025★ 3 cited

QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits

Ilya Tyagin, Marwa H. Farag, Kyle Sherbert +3

Quantum computing has the potential to improve our ability to solve certain optimization problems that are computationally difficult for classical computers, by offering new algori…

quant-ph2025★ 1 cited

Optimal fermion-qubit mappings via quadratic assignment

Mitchell Chiew, Cameron Ibrahim, Ilya Safro +1

Simulation of fermionic systems is one of the most promising applications of quantum computers. It spans problems in quantum chemistry, high-energy physics and condensed matter. Un…

quant-ph2025

Cross-Problem Parameter Transfer in Quantum Approximate Optimization Algorithm: A Machine Learning Approach

Kien X. Nguyen, Bao Bach, Ilya Safro

Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising candidates to achieve the quantum advantage in solving combinatorial optimization problems. The proce…

quant-ph2025

Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction

Bao Bach, Ilya Safro, Ed Younis

With the growth of quantum platforms for gate-based quantum computation, compilation holds a crucial role in deciding the success of the implementation. While there has been rich r…

quant-ph2024

QAdaPrune: Adaptive Parameter Pruning For Training Variational Quantum Circuits

Ankit Kulshrestha, Xiaoyuan Liu, Hayato Ushijima-Mwesigwa +2

In the present noisy intermediate scale quantum computing era, there is a critical need to devise methods for the efficient implementation of gate-based variational quantum circuit…

quant-ph2024

A Multilevel Approach For Solving Large-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Filip B. Maciejewski, Bao Gia Bach, Maxime Dupont +5

Quantum approximate optimization is one of the promising candidates for useful quantum computation, particularly in the context of finding approximate solutions to Quadratic Uncons…

quant-ph2024

Equivariant QAOA and the Duel of the Mixers

Boris Tsvelikhovskiy, Ilya Safro, Yuri Alexeev

Constructing an optimal mixer for Quantum Approximate Optimization Algorithm (QAOA) Hamiltonian is crucial for enhancing the performance of QAOA in solving combinatorial optimizati…

quant-ph2024

Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization

Ibrahim Cameron, Teague Tomesh, Zain Saleem +1

Quantum optimization as a field has largely been restricted by the constraints of current quantum computing hardware, as limitations on size, performance, and fidelity mean most no…

quant-ph2024★ 6 cited

MLQAOA: Graph Learning Accelerated Hybrid Quantum-Classical Multilevel QAOA

Bao Bach, Jose Falla, Ilya Safro

Learning the problem structure at multiple levels of coarseness to inform the decomposition-based hybrid quantum-classical combinatorial optimization solvers is a promising approac…

quant-ph2024★ 1 cited

Graph Representation Learning for Parameter Transferability in Quantum Approximate Optimization Algorithm

Jose Falla, Quinn Langfitt, Yuri Alexeev +1

The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. O…

cs.AI2023

Dyport: Dynamic Importance-based Hypothesis Generation Benchmarking Technique

Ilya Tyagin, Ilya Safro

This paper presents a novel benchmarking framework Dyport for evaluating biomedical hypothesis generation systems. Utilizing curated datasets, our approach tests these systems unde…

quant-ph2023

QArchSearch: A Scalable Quantum Architecture Search Package

Ankit Kulshrestha, Danylo Lykov, Ilya Safro +1

The current era of quantum computing has yielded several algorithms that promise high computational efficiency. While the algorithms are sound in theory and can provide potentially…

quant-ph2023★ 286 cited

Quantum computing for finance

Dylan Herman, Cody Googin, Xiaoyuan Liu +5

Quantum computers are expected to surpass the computational capabilities of classical computers and have a transformative impact on numerous industry sectors. We present a comprehe…

quant-ph2023★ 3 cited

Similarity-Based Parameter Transferability in the Quantum Approximate Optimization Algorithm

Alexey Galda, Eesh Gupta, Jose Falla +4

The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. A…

cs.DS2023

Decomposition Based Refinement for the Network Interdiction Problem

Krish Matta, Xiaoyuan Liu, Ilya Safro

The shortest path network interdiction (SPNI) problem poses significant computational challenges due to its NP-hardness. Current solutions, primarily based on integer programming m…