Mohammad Khairul Bashar

Mohammad Khairul Bashar

Auto-generated profile, based on publicly available information

Mohammad Khairul Bashar

University of Virginia, Charlottesville, VA, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
23 September 2020 in IEEE Journal on Exploratory Solid-State Computational Devices and Circuits
Verified
Journal Article
Open access
MBMohammad Khairul Bashar
Mohammad Khairul Bashar
AMAntik Mallick
Antik Mallick
DTDaniel S. Truesdell
Daniel S. Truesdell
BCBenton H. Calhoun
Benton H. Calhoun
SJSiddharth Joshi
Siddharth Joshi
NSNikhil Shukla
Nikhil Shukla
In this work, we experimentally demonstrate an integrated circuit (IC) of 30 relaxation oscillators with reconfigurable capacitive coupling to solve the NP-Hard Maximum Cut (Max-Cut) problem. We show that under the influence of an external second-harmonic injection signal, the oscillator phases exhibit a bi-partition which can be used to calculate a high quality approximate Max-Cut solution. Leveraging the all-to-all reconfigurable coupling architecture, we experimentally evaluate the computational properties of the oscillators using randomly generated graph instances of varying size and edge density (ƞ). Further, comparing the Max-Cut solutions with the optimal values, we show that the oscillators (after simple post-processing) produce a Max-Cut that is within 99% of the optimal value in 28 of the 36 measured graphs; importantly, the oscillators are particularly effective in dense graphs with the Max-Cut being optimal in 7 out of 9 measured graphs with ƞ=0.8. Our work marks a step towards creating an efficient, room-temperature-compatible non-Boolean hardware-based solver for hard combinatorial optimization problems.

9 October 2023 in Journal of Applied Physics
Verified
Journal Article
Open access
PDF file
MBMohammad Khairul Bashar
Mohammad Khairul Bashar
Zongli LinZongli Lin
Zongli Lin
NSNikhil Shukla
Nikhil Shukla
Nonlinear dynamical systems such as coupled oscillators are being actively investigated as Ising machines for solving computationally hard problems in combinatorial optimization. Prior works have established the equivalence between the global minima of the cost function describing the coupled oscillator system and the ground state of the Ising Hamiltonian. However, the properties of the oscillator Ising machine (OIM) from a nonlinear control viewpoint, such as the stability of the OIM solutions, remain unexplored. Therefore, in this work, using nonlinear control-theoretic analysis, we (i) identify the conditions required to ensure the functionality of the coupled oscillators as an Ising machine, (ii) show that all globally optimal phase configurations may not always be stable, resulting in some configurations being more favored over others and, thus, creating a biased OIM, and (iii) elucidate the impact of the stability of locally optimal phase configurations on the quality of the solution computed by the system. Our work, fostered through the unique convergence between nonlinear control theory and analog systems for computing, provides a new toolbox for the design and implementation of dynamical system-based computing platforms.

2 November 2021 in IEEE Access
Verified
Journal Article
Open access
MBMohammad Khairul Bashar
Mohammad Khairul Bashar
AMAntik Mallick
Antik Mallick
NSNikhil Shukla
Nikhil Shukla
Coupled electronic oscillator networks, under second harmonic injection, have recently been shown to behave as Ising machines capable of solving computationally hard combinatorial optimization problems. In this work, we experimentally investigate the dynamical properties of a reconfigurable network of up to 30 oscillators ( $\equiv $ spins) configured as an Ising machine. Specifically, we analyze the characteristics of the solutions to the Ising model produced by the oscillators and show that as the system evolves towards the ground state through the high-dimensional phase space, it gets trapped in local minima resulting in sub-optimal solutions. Moreover, the exact local minima where the system gets trapped also changes implying that the trajectory of evolution of the system also changes with each trial. Finally, we illustrate experimentally how an appropriately designed annealing scheme can help the coupled oscillators escape a local minimum and attain a lower energy state.

1 July 2024 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Closed access
PDF file
YCYi Cheng
Yi Cheng
MBMohammad Khairul Bashar
Mohammad Khairul Bashar
NSNikhil Shukla
Nikhil Shukla
Zongli LinZongli Lin
Zongli Lin
This work advances the understanding of oscillator Ising machines (OIMs) as a nonlinear dynamic system for solving computationally hard problems. Specifically, we classify the infinite number of all possible equilibrium points of an OIM, including non-0/π ones, into three types based on their structural stability properties. We then employ the stability analysis techniques from control theory to analyze the stability property of all possible equilibrium points and obtain the necessary and sufficient condition for their stability. As a result of these analytical results, we establish, for the first time, the threshold of the binarization in terms of the coupling strength and strength of the second harmonic signal. Furthermore, we provide an estimate of the domain of attraction of each asymptotically stable equilibrium point by employing the Lyapunov stability theory. Finally, we illustrate our theoretical conclusions by numerical simulation.

31 January 2023 in IEEE Journal on Exploratory Solid-State Computational Devices and Circuits
Verified
Journal Article
Open access
MBMohammad Khairul Bashar
Mohammad Khairul Bashar
Zongli LinZongli Lin
Zongli Lin
NSNikhil Shukla
Nikhil Shukla
Dynamical systems can offer a novel non-Boolean approach to computing. Specifically, the natural minimization of energy in the system is a valuable property for minimizing the objective functions of combinatorial optimization problems, many of which are still challenging to solve using conventional digital solvers. In this work, we design two oscillator-inspired dynamical systems to solve quintessential computationally intractable problems in Boolean satisfiability (SAT). The system dynamics are engineered such that they facilitate solutions to two different flavors of the SAT problem. We formulate the first dynamical system to compute the solution to the 3-SAT problem, while for the second system, we show that its dynamics map to the solution of the Max-NAE-3-SAT problem. Our work advances understanding of how this physics-inspired approach can be used to address challenging problems in computing.

9 January 2023 in IEEE Journal on Exploratory Solid-State Computational Devices and Circuits
Verified
Journal Article
Open access
MBMohammad Khairul Bashar
Mohammad Khairul Bashar
AMAntik Mallick
Antik Mallick
AGAvik W Ghosh
Avik W Ghosh
NSNikhil Shukla
Nikhil Shukla
The intrinsic energy minimization in dynamical systems offers a valuable tool for minimizing the objective functions of computationally challenging problems in combinatorial optimization. However, most prior works have focused on mapping such dynamics to combinatorial optimization problems whose objective functions have quadratic degree (e.g., MaxCut); such problems can be represented and analyzed using graphs. However, the work on developing such models for problems that need objective functions with degree greater than two, and subsequently, entail the use of hypergraph data structures, is relatively sparse. In this work, we develop dynamical system-inspired computational models for several such problems. Specifically, we define the ‘energy function’ for hypergraph-based combinatorial problems ranging from Boolean SAT and its variants to integer factorization, and subsequently, define the resulting system dynamics. We also show that the design approach is applicable to optimization problems with quadratic degree, and use it develop a new dynamical system formulation for minimizing the Ising Hamiltonian. Our work not only expands on the scope of problems that can be directly mapped to, and solved using physics-inspired models, but also creates new opportunities to design high-performance accelerators for solving combinatorial optimization.