286 citations · 534 across the 36 of their papers we have counts for
10 papers · 1 filter
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…