19 citations · 64 across the 17 of their papers we have counts for
18 papers
Reading Between the Reads: A Decade On, Revisiting Sequencing Protocol Annotation in the Sequence Read Archive
Jamie J. Alnasir
Background: Experimental metadata are essential for interpreting archived sequencing data. In 2015, Alnasir and Shanahan examined the annotation of fragmentation, adapter ligation…
Quantum Preconditioning For Constrained Optimization Problems
Anurag Ramesh, Bhuvanesh Sundar, Maxime Dupont +1
We study the effect of quantum preconditioning on constrained combinatorial optimization problems, focusing on balanced graph bi-partitioning. The proposed approach uses two-point…
Addressing Discrete Dynamic Optimization via a Logic-Based Discrete-Steepest Descent Algorithm
Zedong Peng, Albert Lee, David E. Bernal Neira
Dynamic optimization problems involving discrete decisions have several applications, yet lead to challenging optimization problems that must be addressed efficiently. Combining di…
A Convexification-based Outer-Approximation Method for Convex and Nonconvex MINLP
Zedong Peng, Kaiyu Cao, Kevin C. Furman +3
The advancement of domain reduction techniques has significantly enhanced the performance of solvers in mathematical programming. This paper delves into the impact of integrating c…
Towards Efficient Quantum Computation of Molecular Ground State Energies using Bayesian Optimization with Priors over Surface Topology
Farshud Sorourifar, Mohamed Taha Rouabah, Nacer Eddine Belaloui +6
Variational Quantum Eigensolvers (VQEs) represent a promising approach to computing molecular ground states and energies on modern quantum computers. These approaches use a classic…
Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
Eleanor G. Rieffel, Ata Akbari Asanjan, M. Sohaib Alam +20
Quantum computing is one of the most enticing computational paradigms with the potential to revolutionize diverse areas of future-generation computational systems. While quantum co…
Bayesian Optimization Priors for Efficient Variational Quantum Algorithms
Farshud Sorourifar, Diana Chamaki, Norm M. Tubman +2
Quantum computers currently rely on a hybrid quantum-classical approach known as Variational Quantum Algorithms (VQAs) to solve problems. Still, there are several challenges with V…
Measure This, Not That: Optimizing the Cost and Model-Based Information Content of Measurements
Jialu Wang, Zedong Peng, Ryan Hughes +3
Model-based design of experiments (MBDoE) is a powerful framework for selecting and calibrating science-based mathematical models from data. This work extends popular MBDoE workflo…
Federated Hierarchical Tensor Networks: a Collaborative Learning Quantum AI-Driven Framework for Healthcare
Amandeep Singh Bhatia, David E. Bernal Neira
Healthcare industries frequently handle sensitive and proprietary data, and due to strict privacy regulations, they are often reluctant to share data directly. In today's context,…
Logic-Based Discrete-Steepest Descent: A Solution Method for Process Synthesis Generalized Disjunctive Programs
Daniel Ovalle, David A. Liñán, Albert Lee +4
The optimization of chemical processes is challenging due to the nonlinearities arising from process physics and discrete design decisions. In particular, optimal synthesis and des…
A Greedy Quantum Route-Generation Algorithm
Jordan Makansi, David E. Bernal Neira
Routing and scheduling problems with time windows have long been important optimization problems for logistics and planning. Many classical heuristics and exact methods exist for s…
Classical and Quantum Distributed Algorithms for the Survivable Network Design Problem
Phillip Kerger, David E. Bernal Neira, Zoe Gonzalez Izquierdo +1
We investigate distributed classical and quantum approaches for the survivable network design problem (SNDP), sometimes called the generalized Steiner problem. These problems gener…
Surrogate optimization of variational quantum circuits
Erik J. Gustafson, Juha Tiihonen, Diana Chamaki +8
Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of qu…
Benchmarking Quantum Optimization for the Maximum-Cut Problem on a Superconducting Quantum Computer
Maxime Dupont, Bhuvanesh Sundar, Bram Evert +4
Achieving high-quality solutions faster than classical solvers on computationally hard problems is a challenge for quantum optimization to deliver utility. Using a superconducting…
Benchmarking the Operation of Quantum Heuristics and Ising Machines: Scoring Parameter Setting Strategies on Optimization Applications
David E. Bernal Neira, Robin Brown, Pratik Sathe +4
We discuss guidelines for evaluating the performance of parameterized stochastic solvers for optimization problems, with particular attention to systems that employ novel hardware,…
HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
Nicolas PD Sawaya, Daniel Marti-Dafcik, Yang Ho +13
In order to characterize and benchmark computational hardware, software, and algorithms, it is essential to have many problem instances on-hand. This is no less true for quantum co…
Mind the : Asymptotically Better, but Still Impractical, Quantum Distributed Algorithms
Phillip A. Kerger, David E. Bernal Neira, Zoe Gonzalez Izquierdo +1
The CONGEST and CONGEST-CLIQUE models have been carefully studied to represent situations where the communication bandwidth between processors in a network is severely limited. Mes…
Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
David E. Bernal Neira, Ignacio E. Grossmann
We propose the formulation of convex Generalized Disjunctive Programming (GDP) problems using conic inequalities leading to conic GDP problems. We then show the reformulation of co…