arXiv subjects

Ashish Mani

Publications and source records attributed to Ashish Mani.

11 recordsLinked to original sources

arXiv2026

A Quantum-inspired Hybrid Swarm Intelligence and Decision-Making for Multi-Criteria ADAS Calibration

The tuning of Advanced Driver Assistance Systems (ADAS) involves resolving trade-offs among several competing objectives, including operational safety, system responsiveness, energy usage, and passenger comfort. This work introduces a novel optimization framework based on Quantum-Inspired Hybrid Swarm Intelligence (QiHSI), in which quantum-inspired mechanisms are embedded within a multi-objective salp swarm optimization process to strengthen global search capability and preserve population diversity in complex, high-dimensional decision spaces. In addition, a decision-maker-in-the-loop strategy is incorporated to incorporate adaptive expert guidance, enabling the optimization process to respond dynamically to changing design priorities and system constraints. The effectiveness of QiHSI is assessed using established multi-objective benchmark problems as well as a practical ADAS calibration scenario. Experimental comparisons with several state-of-the-art evolutionary and swarm-based algorithms, including MSSA, MOPSO, MOEA/D, SPEA2, NSGA-III, and RVEA, show that the proposed method consistently produces well-distributed Pareto-optimal solutions with faster convergence and improved adaptability. These findings demonstrate that QiHSI offers a reliable and scalable approach for intelligent ADAS calibration, supporting the development of more responsive, efficient, and safety-oriented autonomous driving technologies.

cs.NE↗

arXiv2024

Quantum Inspired Chaotic Salp Swarm Optimization for Dynamic Optimization

Many real-world problems are dynamic optimization problems that are unknown beforehand. In practice, unpredictable events such as the arrival of new jobs, due date changes, and reservation cancellations, changes in parameters or constraints make the search environment dynamic. Many algorithms are designed to deal with stationary optimization problems, but these algorithms do not face dynamic optimization problems or manage them correctly. Although some optimization algorithms are proposed to deal with the changes in dynamic environments differently, there are still areas of improvement in existing algorithms due to limitations or drawbacks, especially in terms of locating and following the previously identified optima. With this in mind, we studied a variant of SSA known as QSSO, which integrates the principles of quantum computing. An attempt is made to improve the overall performance of standard SSA to deal with the dynamic environment effectively by locating and tracking the global optima for DOPs. This work is an extension of the proposed new algorithm QSSO, known as the Quantum-inspired Chaotic Salp Swarm Optimization (QCSSO) Algorithm, which details the various approaches considered while solving DOPs. A chaotic operator is employed with quantum computing to respond to change and guarantee to increase individual searchability by improving population diversity and the speed at which the algorithm converges. We experimented by evaluating QCSSO on a well-known generalized dynamic benchmark problem (GDBG) provided for CEC 2009, followed by a comparative numerical study with well-regarded algorithms. As promised, the introduced QCSSO is discovered as the rival algorithm for DOPs.

cs.NE↗

arXiv2020

Parts of Speech Tagging in NLP: Runtime Optimization with Quantum Formulation and ZX Calculus

This paper proposes an optimized formulation of the parts of speech tagging in Natural Language Processing with a quantum computing approach and further demonstrates the quantum gate-level runnable optimization with ZX-calculus, keeping the implementation target in the context of Noisy Intermediate Scale Quantum Systems (NISQ). Our quantum formulation exhibits quadratic speed up over the classical counterpart and further demonstrates the implementable optimization with the help of ZX calculus postulates.

quant-ph↗

arXiv2020

Gaussian Kernel in Quantum Learning

The Gaussian kernel is a very popular kernel function used in many machine learning algorithms, especially in support vector machines (SVMs). It is more often used than polynomial kernels when learning from nonlinear datasets, and is usually employed in formulating the classical SVM for nonlinear problems. In [3], Rebentrost et al. discussed an elegant quantum version of a least square support vector machine using quantum polynomial kernels, which is exponentially faster than the classical counterpart. This paper demonstrates a quantum version of the Gaussian kernel and analyzes its runtime complexity using the quantum random access memory (QRAM) in the context of quantum SVM. Our analysis shows that the runtime computational complexity of the quantum Gaussian kernel seems to be significantly faster as compared to its classical version.

cs.LG↗

arXiv2020

An Investigation on Support Vector Clustering for Big Data in Quantum Paradigm

The support vector clustering algorithm is a well-known clustering algorithm based on support vector machines using Gaussian or polynomial kernels. The classical support vector clustering algorithm works well in general, but its performance degrades when applied on big data. In this paper, we have investigated the performance of support vector clustering algorithm implemented in a quantum paradigm for possible run-time improvements. We have developed and analyzed a quantum version of the support vector clustering algorithm. The proposed approach is based on the quantum support vector machine and quantum kernels (i.e., Gaussian and polynomial). The proposed quantum version of the SVM clustering method demonstrates a significant speed-up gain on the overall run-time complexity as compared to the classical counterpart.

cs.LG↗

arXiv2019

An Investigation of Quantum Deep Clustering Framework with Quantum Deep SVM & Convolutional Neural Network Feature Extractor

In this paper, we have proposed a deep quantum SVM formulation, and further demonstrated a quantum-clustering framework based on the quantum deep SVM formulation, deep convolutional neural networks, and quantum K-Means clustering. We have investigated the run time computational complexity of the proposed quantum deep clustering framework and compared with the possible classical implementation. Our investigation shows that the proposed quantum version of deep clustering formulation demonstrates a significant performance gain (exponential speed up gains in many sections) against the possible classical implementation. The proposed theoretical quantum deep clustering framework is also interesting & novel research towards the quantum-classical machine learning formulation to articulate the maximum performance.

cs.LG↗

arXiv2019

Solving Combinatorial Optimization problems with Quantum inspired Evolutionary Algorithm Tuned using a Novel Heuristic Method

Quantum inspired Evolutionary Algorithms were proposed more than a decade ago and have been employed for solving a wide range of difficult search and optimization problems. A number of changes have been proposed to improve performance of canonical QEA. However, canonical QEA is one of the few evolutionary algorithms, which uses a search operator with relatively large number of parameters. It is well known that performance of evolutionary algorithms is dependent on specific value of parameters for a given problem. The advantage of having large number of parameters in an operator is that the search process can be made more powerful even with a single operator without requiring a combination of other operators for exploration and exploitation. However, the tuning of operators with large number of parameters is complex and computationally expensive. This paper proposes a novel heuristic method for tuning parameters of canonical QEA. The tuned QEA outperforms canonical QEA on a class of discrete combinatorial optimization problems which, validates the design of the proposed parameter tuning framework. The proposed framework can be used for tuning other algorithms with both large and small number of tunable parameters.

cs.AI↗

arXiv2018

An All-Pair Quantum SVM Approach for Big Data Multiclass Classification

In this paper, we have discussed a quantum approach for the all-pair multiclass classification problem. We have shown that the multiclass support vector machine for big data classification with a quantum all-pair approach can be implemented in logarithm runtime complexity on a quantum computer. In an all-pair approach, there is one binary classification problem for each pair of classes, and so there are k (k-1)/2 classifiers for a k-class problem. As compared to the classical multiclass support vector machine that can be implemented with polynomial run time complexity, our approach exhibits exponential speed up in the quantum version. The quantum all-pair algorithm can be used with other classification algorithms, and a speed up gain can be achieved as compared to their classical counterparts.

cs.LG↗

arXiv2018

Efficient Clear Air Turbulence Avoidance Algorithms using IoT for Commercial Aviation

With the growth of commercial aviation over the last few decades there have been many applications designed to improve the efficiency of flight operations as well as safety and security. A number of these applications are based on the gathered data from flights; the data is usually acquired from the various sensors available on the aircraft. There are numerous sensors among the electrical and electronics devices on an aircraft, most of which are essential for the proper functioning of the same. With the sensors being operational throughout the time of movement of the aircraft, a large amount of data is collected during each flight. Normally, most of the gathered data are stored on a storage device on the aircraft, and are analyzed and studied later off-site for research purposes focusing on improving airline operation and efficiently maintaining the same. In certain cases, when there is data transfer during the flight, it is between the aircraft and an air-traffic-control (ATC) tower, which serves as the base station. The aircraft equipped with all these sensors, which can gather and exchange data, form a framework of Internet of things (IoT). Detecting and avoiding any form of turbulence for an aircraft is vital; it adds to the safety of both passengers and aircraft while reducing the operating cost of the airline. Therefore, in this paper, we study techniques to detect and avoid Clear Air Turbulence (CAT), which is a specific type of turbulence, based on the IoT framework of aircraft. We propose algorithms that consider both direct and indirect communication between aircraft within a specific region. Using simulation results, we show that our proposed techniques of direct communication using the IoT framework is faster than conventional techniques involving radio communication via both single ATC tower and multiple ATC towers.

cs.NI↗

arXiv2012

A Fast fixed-point Quantum Search Algorithm by using Disentanglement and Measurement

Generic quantum search algorithm searches for target entity in an unsorted database by repeatedly applying canonical Grover's quantum rotation transform to reach near the vicinity of the target entity. Thus, upon measurement, there is a high probability of finding the target entity. However, the number of times quantum rotation transform is to be applied for reaching near the vicinity of the target is a function of the number of target entities present in an unsorted database, which is generally unknown. A wrong estimate of the number of target entities can lead to overshooting or undershooting the targets, thus reducing the success probability. Some proposals have been made to overcome this limitation. These proposals either employ quantum counting to estimate the number of solutions or fixed-point schemes. This paper proposes a new scheme for stopping the application of quantum rotation transformation on reaching near the targets by disentanglement, measurement and subsequent processing to estimate the distance of the state vector from the target states. It ensures a success probability, which is greater than half for all practically significant ratios of the number of target entities to the total number of entities in a database. The search problem is trivial for remaining possible ratios. The proposed scheme is simpler than quantum counting and more efficient than the known fixed-point schemes. It has same order of computational complexity as canonical Grover`s search algorithm but is slow by a factor of two and requires two additional ancilla qubits.

cs.IT↗

arXiv2011

A Fast Measurement based fixed-point Quantum Search Algorithm

Generic quantum search algorithm searches for target entity in an unsorted database by repeatedly applying canonical Grover's quantum rotation transform to reach near the vicinity of the target entity represented by a basis state in the Hilbert space associated with the qubits. Thus, when qubits are measured, there is a high probability of finding the target entity. However, the number of times quantum rotation transform is to be applied for reaching near the vicinity of the target is a function of the number of target entities present in the unsorted database, which is generally unknown. A wrong estimate of the number of target entities can lead to overshooting or undershooting the targets, thus reducing the success probability. Some proposals have been made to overcome this limitation. These proposals either employ quantum counting to estimate the number of solutions or fixed point schemes. This paper proposes a new scheme for stopping the application of quantum rotation transformation on reaching near the targets by measurement and subsequent processing to estimate the distance of the state vector from the target states. It ensures a success probability, which is at least greater than half for all the ratios of the number of target entities to the total number of entities in a database, which are less than half. The search problem is trivial for remaining possible ratios. The proposed scheme is simpler than quantum counting and more efficient than the known fixed-point schemes. It has same order of computational complexity as canonical Grover's search algorithm but is slow by a factor of two and requires an additional ancilla qubit.

cs.DB↗