activity
20182021
most citedA Quantum Annealing Approach for Dynamic Multi-Depot Capacitated Vehicle Routing Problem

19 citations · 19 across the 2 of their papers we have counts for

collaborators

6 papers

math.OC2021

Free-Will Arbitrary Time Consensus Protocols with Diffusive Coupling

Quoc Van Tran, Minh Hoang Trinh, Nam Hoai Nguyen +1

In this technical note, we first clarify a technical issue in the convergence proof of a free-will arbitrary time (FwAT) consensus law proposed recently in Pal et al. IEEE Trans. C…

math.OC202019 cited

A Quantum Annealing Approach for Dynamic Multi-Depot Capacitated Vehicle Routing Problem

Ramkumar Harikrishnakumar, Saideep Nannapaneni, Nam H. Nguyen +2

Quantum annealing (QA) is a quantum computing algorithm that works on the principle of Adiabatic Quantum Computation (AQC), and it has shown significant computational advantages in…

quant-ph2020

Experimental evaluation of quantum Bayesian networks on IBM QX hardware

Sima E. Borujeni, Nam H. Nguyen, Saideep Nannapaneni +2

Bayesian Networks (BN) are probabilistic graphical models that are widely used for uncertainty modeling, stochastic prediction and probabilistic inference. A Quantum Bayesian Netwo…

quant-ph2020

Quantum circuit representation of Bayesian networks

Sima E. Borujeni, Saideep Nannapaneni, Nam H. Nguyen +2

Probabilistic graphical models such as Bayesian networks are widely used to model stochastic systems to perform various types of analysis such as probabilistic prediction, risk ana…

quant-ph2019

Experimental pairwise entanglement estimation for an N-qubit system :A machine learning approach for programming quantum hardware

N. L. Thompson, N. H. Nguyen, E. C. Behrman +1

Designing and implementing algorithms for medium and large scale quantum computers is not easy. In previous work we have suggested, and developed, the idea of using machine learnin…

quant-ph2018

Benchmarking neural networks for quantum computation

N. H. Nguyen, E. C. Behrman, M. A. Moustafa +1

The power of quantum computers is still somewhat speculative. While they are certainly faster than classical ones at some tasks, the class of problems they can efficiently solve ha…