SearcharxivSearch

arXiv subjects

Ali Rajabi

Publications and source records attributed to Ali Rajabi.

6 recordsLinked to original sources

A Context-aware Gated Convex Mixtures of LSTM Experts for Nonlinear System Identification

This work addresses nonlinear and nonstationary system identification using one-step-ahead prediction on the nonlinear autoregressive moving average benchmark with ten-step memory (NARMA-10). Baseline models, including autoregressive models with exogenous input (ARX), nonlinear ARX using a multilayer perceptron (NARX--MLP), and a single long short-term memory network (LSTM), are used to contextualize prediction performance. To improve robustness, multiple LSTM experts are combined through a convex mixture. A standard adaptive convex mixture updates the mixing weights using an error-driven rule with simplex projection, but this mechanism is reactive, hand-tuned, and not end-to-end learnable. The proposed method introduces a context-aware end-to-end mixture-of-experts (MoE) framework in which a differentiable softmax gating network learns context-aware mixing weights jointly with the expert parameters. On stationary NARMA-10, the proposed MoE gating approach achieves performance comparable to the adaptive convex mixture. Under regime-switching dynamics, a controlled frozen-experts ablation isolates the mixing-weight update mechanism and shows that the MoE gate significantly improves robustness, achieving approximately fivefold lower overall test error and about two-and-a-half-fold lower after-switch error.

eess.SY

A Distributed Quantum Approximate Optimization Algorithm For Unit Commitment

This paper presents a distributed quantum approximate optimization algorithm (DQAOA)-enabled three-block alternating direction method of multipliers (ADMM) framework for unit commitment (UC). The relaxed commitment and dispatch variables are solved in a continuous quadratic programming block, while the binary commitment block is formulated as a quadratic unconstrained binary optimization (QUBO) problem. The DQAOA interface allows this QUBO to be solved using brute-force enumeration, monolithic QAOA, or distributed QAOA, while the remaining ADMM updates are kept unchanged. In the distributed mode, the logical commitment qubits are allocated across multiple capacity-constrained quantum processing units (QPU), avoiding the requirement that the complete binary problem fits on a single device. The framework is evaluated on a five-unit UC instance containing 15 binary variables. All three solver modes reduce the ADMM primal residual below a certain tolerance and recover the same commitment schedule, dispatch, and operating cost. The results demonstrate solution consistency across the three solver modes and the multi-QPU capacity accommodation provided by the distributed QAOA method.

cs.DC

A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization

This paper presents a Qiskit-compatible distributed quantum approximate optimization algorithm (DQAOA) simulator for quadratic unconstrained binary optimization (QUBO) problems arising in engineering design and decision applications. The open-source simulator is available through the RAISE LAB website and GitHub repository, with README documentation for installation, input formatting, configurable parameters, and example workflows. The package addresses the need for a reusable simulator that can solve and compare QUBO instances across different QAOA execution modes. It supports monolithic QAOA on a single quantum processing unit (QPU) and distributed QAOA across a user-specified number of QPUs with configurable capacities. The workflow canonicalizes the QUBO model, maps it to a cost Hamiltonian, allocates variables across QPUs, identifies local and cross-QPU couplings, and constructs the corresponding circuits. Runtime optimizations, including parameterized circuit reuse, objective reuse at fixed depth, batched evaluations, and parallel multi-start execution, reduce repeated overhead. A Streamlit graphical user interface is also provided for entering or uploading QUBO instances, configuring solver settings, running selected modes, and visualizing solution-quality metrics without editing Python scripts. The package is demonstrated on standalone QUBO benchmarks and a power generation unit commitment application. In the unit commitment case, brute force, monolithic QAOA, and distributed QAOA recover the same commitment bitstring and operating cost. Across multiple case studies, the simulator produces results consistent with classical monolithic QAOA references in terms of optimal bitstrings and costs. Staged runtime analysis shows substantial runtime reduction across implementation stages, while distributed QAOA remains more demanding because cross-QPU couplings require remote operations.

cs.DC

A Survey on Applications of Quantum Computing for Unit Commitment

Unit Commitment (UC) is a core optimization problem in power system operation and electricity market scheduling. It determines the optimal on/off status and dispatch of generating units while satisfying system, operational, and market constraints. Traditionally, UC has been solved using mixed-integer programming, dynamic programming, or metaheuristic methods, all of which face scalability challenges as systems grow in size and uncertainty. Recent advances in quantum computing, spanning quantum annealing, variational algorithms, and hybrid quantum classical optimization, have opened new opportunities to accelerate UC solution processes by exploiting quantum parallelism and entanglement. This paper presents a comprehensive survey of existing research on the applications of quantum computing for solving the UC problem. The reviewed works are categorized based on the employed quantum paradigms, including annealing-based, variational hybrid, quantum machine learning, and quantum-inspired methods. Key modeling strategies, hardware implementations, and computational trade-offs are discussed, highlighting the current progress, limitations, and potential future directions for large-scale quantum-enabled UC.

quant-ph

Optics design and correction challenges for the high energy booster of FCC-ee

One of the major upcoming challenges in particle physics is achieving precise measurements of the Z, W, and H bosons, as well as the top quark. To meet these targets, the next e\textsuperscript{+}e\textsuperscript{-} collider complex, FCC-ee, will need to achieve unprecedented luminosities. The FCC-IS European Study is investigating the feasibility of these challenges, with a cornerstone of the study being the design and optimization of the high-energy booster (HEB). This paper provides an update on the status of the HEB of FCC-ee in light of recent developments in the injector and collider survey, as well as an overview of ongoing work on longitudinal stability and design robustness in relation to field, alignment, and diagnostics errors. Constraints and effects related to the design frequency of the accelerating cavities, as well as collective effects, are also highlighted. Lastly, the paper presents an investigation into an alternative arcs cell design.

physics.acc-ph

A Multifunctional Sub-10nm Transistor

Nano-electronic integrated circuit technology is exclusively based on MOSFET transistor due to its scalability down to the nanometer range. On the other hand, Bipolar Junction Transistor (BJT), which provides unmatched analog characteristics and frequency response, cannot be scaled to nanometer regime without the loss of transistor action. Here a versatile nanoscale transistor is introduced that provides identical BJT behavior and expands its capabilities. The new transistor uses CMOS fabrication technology and creates BJT emitter, base, and collector via electric fields. By allowing carrier modulation during operation, its current gain can be changed at least by five orders of magnitude. This property introduces novel adaptive, variable gain, and programmable analog modules into existing electronic circuit design and manufacturing. A NOT gate version of this device with the critical dimension of 7 nm operates at 730 GHz, and its three-stage ring oscillator exhibits a frequency of 240 GHz. With proper gate biasing, it can also operate as a nanoscale MOSFET, easily alleviating short-channel effects.

cond-mat.mes-hall