9 citations · 17 across the 5 of their papers we have counts for
7 papers · 1 filter
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…
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…
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…
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…
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…
Homological Description of the Quantum Adiabatic Evolution With a View Toward Quantum Computations
Raouf Dridi, Hedayat Alghassi, Sridhar Tayur
We import the tools of Morse theory to study quantum adiabatic evolution, the core mechanism in adiabatic quantum computations (AQC). AQC is computationally equivalent to the (pre-…