activity
20162020
most citedPhysics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer

451 citations · 550 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph2020★ 12 cited

Chook -- A comprehensive suite for generating binary optimization problems with planted solutions

Dilina Perera, Inimfon Akpabio, Firas Hamze +4

We present Chook, an open-source Python-based tool to generate discrete optimization problems of tunable complexity with a priori known solutions. Chook provides a cross-platform u…

physics.comp-ph2019★ 22 cited

Effects of setting the temperatures in the parallel tempering Monte Carlo algorithm

Ignacio Rozada, Maliheh Aramon, Jonathan Machta +1

Parallel tempering Monte Carlo has proven to be an efficient method in optimization and sampling applications. Having an optimized temperature set enhances the efficiency of the al…

math.OC2019

A feasibility pump algorithm embedded in an annealing framework

Nicolas Pradignac, Maliheh Aramon, Helmut G. Katzgraber

The feasibility pump algorithm is an efficient primal heuristic for finding feasible solutions to mixed-integer programming problems. The algorithm suffers mainly from fast converg…

physics.comp-ph2018★ 451 cited

Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer

Maliheh Aramon, Gili Rosenberg, Elisabetta Valiante +3

The Fujitsu Digital Annealer (DA) is designed to solve fully connected quadratic unconstrained binary optimization (QUBO) problems. It is implemented on application-specific CMOS h…

quant-ph2017★ 44 cited

Enhancing Quantum Annealing Performance for the Molecular Similarity Problem

Maritza Hernandez, Maliheh Aramon

Quantum annealing is a promising technique which leverages quantum mechanics to solve hard optimization problems. Considerable progress has been made in the development of a physic…

cs.DS2016★ 21 cited

A Novel Graph-based Approach for Determining Molecular Similarity

Maritza Hernandez, Arman Zaribafiyan, Maliheh Aramon +1

In this paper, we tackle the problem of measuring similarity among graphs that represent real objects with noisy data. To account for noise, we relax the definition of similarity u…