activity
20052023
most citedPrime factorization using quantum annealing and computational algebraic geometry

80 citations · 183 across the 25 of their papers we have counts for

collaborators
Showing 2019 · quant-phShow all

5 papers · 2 filters

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…

quant-ph2019★ 1 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-ph2019★ 4 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-ph2019★ 3 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…

quant-ph2019★ 9 cited

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

Hedayat Alghassi, Raouf Dridi, Sridhar Tayur

We propose a novel hybrid quantum-classical approach to calculate Graver bases, which have the potential to solve a variety of hard linear and non-linear integer programs, as they…