activity
20192026
most citedQCI Qbsolv Delivers Strong Classical Performance for Quantum-Ready Formulation

9 citations · 13 across the 7 of their papers we have counts for

collaborators

8 papers

quant-ph2026

Zeno Blockade Enabling Photonic Quantum Optimization

Mohammad-Ali Miri, Uchenna Chukwu, Nicholas Chancellor

In this work we explore the potential of implementing an optical quantum optimizer using non-linear optics, specifically using sum-frequency generation and/or two photon absorption…

quant-ph2025

Non-Negative Matrix Factorization Using Non-Von Neumann Computers

Ajinkya Borle, Charles Nicholas, Uchenna Chukwu +2

Non-negative matrix factorization (NMF) is a matrix decomposition problem with applications in unsupervised learning. The general form of this problem (along with many of its varia…

quant-ph2025

Explicitly Quantum-parallel Computation by Displacements

Uchenna Chukwu, Mohammad-Ali Miri, Nicholas Chancellor

We introduce an encoding of information in the relative displacement or photon number of different optical modes. Since the loss rate to interference is insensitive to squeezing an…

quant-ph2024★ 3 cited

Entropy Computing, A Paradigm for Optimization in Open Photonic Systems

Lac Nguyen, Mohammad-Ali Miri, R. Joseph Rupert +14

Finding better solutions to combinatorial optimization problems could have a large positive impact on many real-world application areas, such as logistics. For this reason, signifi…

quant-ph2022★ 1 cited

Quantum Natural Gradient with Efficient Backtracking Line Search

Touheed Anwar Atif, Uchenna Chukwu, Jesse Berwald +1

We consider the Quantum Natural Gradient Descent (QNGD) scheme which was recently proposed to train variational quantum algorithms. QNGD is Steepest Gradient Descent (SGD) operatin…

quant-ph2020

Constrained-optimization Approach Delivers Superior Classical Performance for Graph Partitioning via Quantum-ready Method

Uchenna Chukwu, Raouf Dridi, Jesse Berwald +5

Graph partitioning is one of an important set of well-known compute-intense (NP-hard) graph problems that devolve to discrete constrained optimization. We sampled solutions to the…