most citedAssessing and Advancing the Potential of Quantum Computing: A NASA Case Study

17 citations · 29 across the 11 of their papers we have counts for

collaborators
Showing quant-phShow all

8 papers · 1 filter

quant-ph2024

Ground State Energy Estimation on Current Quantum Hardware Through The Variational Quantum Eigensolver: A Comprehensive Study

Nacer Eddine Belaloui, Abdellah Tounsi, Rabah Abdelmouheymen Khamadja +4

While numerical simulations are presented in most papers introducing new methods to enhance the VQE performance, comprehensive, comparative, and applied studies remain relatively r…

quant-ph2024

A Multilevel Approach For Solving Large-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Filip B. Maciejewski, Bao Gia Bach, Maxime Dupont +5

Quantum approximate optimization is one of the promising candidates for useful quantum computation, particularly in the context of finding approximate solutions to Quadratic Uncons…

quant-ph20241 cited

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…

quant-ph202417 cited

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…

quant-ph20242 cited

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…

quant-ph20241 cited

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…