most citedGraver Bases via Quantum Annealing with Application to Non-Linear Integer Programs

9 citations · 17 across the 5 of their papers we have counts for

collaborators

7 papers

quant-ph2019

Integer programming techniques for minor-embedding in quantum annealers

David E. Bernal, Kyle E. C. Booth, Raouf Dridi +3

A major limitation of current generations of quantum annealers is the sparse connectivity of manufactured qubits in the hardware graph. This technological limitation generated cons…

q-bio.QM2019

The Topology of Mutated Driver Pathways

Raouf Dridi, Hedayat Alghassi, Maen Obeidat +1

Much progress has been made, and continues to be made, towards identifying candidate mutated driver pathways in cancer. However, no systematic approach to understanding how candida…

math.OC2019

GAMA: A Novel Algorithm for Non-Convex Integer Programs

Hedayat Alghassi, Raouf Dridi, Sridhar Tayur

Inspired by the decomposition in the hybrid quantum-classical optimization algorithm we introduced in arXiv:1902.04215, we propose here a new (fully classical) approach to solving…

quant-ph20191 cited

Knuth-Bendix Completion Algorithm and Shuffle Algebras For Compiling NISQ Circuits

Raouf Dridi, Hedayat Alghassi, Sridhar Tayur

Compiling quantum circuits lends itself to an elegant formulation in the language of rewriting systems on non commutative polynomial algebras . The alpha…

quant-ph20194 cited

Minimizing polynomial functions on quantum computers

Raouf Dridi, Hedayat Alghassi, Sridhar Tayur

This expository paper reviews some of the recent uses of computational algebraic geometry in classical and quantum optimization. The paper assumes an elementary background in algeb…

quant-ph20193 cited

Enhancing the efficiency of adiabatic quantum computations

Raouf Dridi, Hedayat Alghassi, Sridhar Tayur

We describe a general methodology for enhancing the efficiency of adiabatic quantum computations (AQC). It consists of homotopically deforming the original "Hamiltonian surface" in…