Chinonso Calistus Onah

Mr. Chinonso Calistus Onah


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 March 2026 in Entropy
Verified
Journal Article
Open access
PDF file
NMNeel Misciasci
Neel Misciasci
RFRoman Firt
Roman Firt
JMJonathan E. Mueller
Jonathan E. Mueller
TFTriet Nguyen Friedhoff
Triet Nguyen Friedhoff
COChinonso Calistus Onah
Chinonso Calistus Onah
SMSarah Mostame
Sarah Mostame
We evaluate the Sample-based Krylov Quantum Diagonalization (SKQD) algorithm on one- and two-dimensional Heisenberg models, including strongly correlated regimes in which the ground state is dense. Using problem-informed initial states and magnetization sector sweeps, we investigate SKQD for problems with non-sparse ground states, where energy accuracy and sampling efficiency are theoretically anticipated to degrade. Our studies reveal that SKQD reproduces ground-state energies and field-dependent magnetization across a range of anisotropies. Benchmarks against DMRG and exact diagonalization show consistent qualitative agreement, with accuracy improving systematically in more anisotropic regimes. We further demonstrate SKQD on quantum hardware by implementing 18- and 30-qubit Heisenberg chains, obtaining magnetization curves that match theoretical expectations. Simulations on the IBM Nighthawk processor for 64-qubit two-dimensional square lattice systems further indicate that the method remains effective beyond one-dimensional geometries.

14 September 2025 in arXiv
Verified
Preprint
Open access
PDF file
COChinonso Calistus Onah
Chinonso Calistus Onah
KMKristel Michielsen
Kristel Michielsen
As quantum processors begin operating as tightly coupled accelerators inside high-performance computing (HPC) facilities, dependable and reproducible behavior becomes a gating requirement for scientific and industrial workloads. We present a hardware-maturity probe that quantifies a device's reliability by testing whether it can repeatedly reproduce the provably global optima of single-layer Quantum Approximate Optimization Algorithm (QAOA) circuits. Using harmonic analysis, we derive closed-form upper bounds on the number of stationary points in the p=1 QAOA cost landscape for broad classes of combinatorial-optimization problems. These bounds yield an exhaustive yet low-overhead grid-sampling scheme with analytically verifiable outcomes. The probe integrates reliability-engineering notions like run-to-failure statistics, confidence-interval estimation, and reproducibility testing into a single, application-centric benchmark. Our framework supplies a standardized dependability metric for hybrid quantum-HPC (QHPC) workflows.

15 September 2025 in arXiv
Verified
Preprint
Open access
PDF file
COChinonso Calistus Onah
Chinonso Calistus Onah
KMKristel Michielsen
Kristel Michielsen
We introduce a transparent, encoding-agnostic framework for determining when the Capacitated Vehicle Routing Problem (CVRP) can achieve early quantum advantage. Our analysis shows this is unlikely on noisy intermediate scale quantum (NISQ) hardware even in best case scenarios that use the most qubit-efficient direct encodings. Closed-form resource counts, combined with recent device benchmarks, yield three decisive go/no-go figures of merit: the quantum feasibility point and the qubit- and gate-feasibility lines, which place any CVRP instance on a single decision diagram. Contrasting a direct QUBO mapping with a space-efficient higher-order (HOBO) encoding reveals a large gap. Applied to early-advantage benchmarks such as Golden-5, our diagram shows that HOBO circuits require only 7,685 qubits, whereas comparable QUBO encodings still exceed 200,000 qubits. In addition to identifying candidate instances for early quantum advantage in CVRP, the framework provides a unifying go/no-go metric that ingests any CVRP encoding together with any hardware profile and highlights when quantum devices could challenge classical heuristics. Quantum advantage in CVRP would likely require innovative problem decomposition techniques.