- Quantum Computing Algorithms and Architecture
- Quantum Information and Cryptography
- Quantum Mechanics and Applications
- Quantum-Dot Cellular Automata
- Quantum and electron transport phenomena
- Neural Networks and Reservoir Computing
- Quantum many-body systems
- Particle physics theoretical and experimental studies
- Computability, Logic, AI Algorithms
- Cosmology and Gravitation Theories
- Microwave Engineering and Waveguides
- Antenna Design and Analysis
- Traffic Prediction and Management Techniques
- Optimization and Search Problems
- Computational Physics and Python Applications
- Molecular Communication and Nanonetworks
- Blockchain Technology in Education and Learning
- Cellular and Composite Structures
- Molecular spectroscopy and chirality
- Spectroscopy and Quantum Chemical Studies
- EEG and Brain-Computer Interfaces
- Advancements in Semiconductor Devices and Circuit Design
- Internet of Things and AI
- 3D Shape Modeling and Analysis
- Imbalanced Data Classification Techniques
Indian Institute of Science Education and Research Kolkata
2017-2025
Welspun (India)
2020-2025
Indian Institute of Technology Delhi
2023
Quantum (Australia)
2023
University of Technology Sydney
2023
Indian Institute of Science Education and Research Berhampur
2023
KIIT University
2022
Indian Institute of Technology Bhubaneswar
2022
In this paper, we describe the usage of Quantum Approximate Optimization Algorithm (QAOA), which is a quantum-classical heuristic, to solve combinatorial optimization and integer programming task known as Vehicle Routing Problem (VRP). We outline Ising formulation for VRP present detailed procedure by minimizing its simulated Hamiltonian using IBM Qiskit platform. Here, attempt find solutions problems: (4,2), (5,2), (5,3), where each (n, k) represents problem with n locations k vehicles....
Abstract Controlled quantum teleportation involves a third party as controller for the of state. Here, we present novel protocols controlling arbitrary two-qubit and three-qubit states through five-qubit seven-qubit cluster respectively. In these schemes, Alice sends qubit to remote receiver Bob channels under control Charlie. can recover mentioned by making appropriate unitary operations, point out that efficiency in our schemes is 100%. process analysis, find classical communication cost...
Quantum key distribution (QKD) has emerged as a critical component of secure communication in the quantum era, ensuring information-theoretic security. Despite its potential, there are issues optimizing generation rates, enhancing security, and incorporating QKD into practical implementations. This research introduces unique framework for machine learning (QML) algorithms, notably reinforcement (QRL) neural networks (QNN), protocols to improve performance. Here, we present two novel...
This paper introduces Quantum-SMOTEV2, an advanced variant of the Quantum-SMOTE method, leveraging quantum computing to address class imbalance in machine learning datasets without K-Means clustering. Quantum-SMOTEV2 synthesizes data samples using swap tests and rotation centered around a single centroid, concentrating on angular distribution minority points concept outliers (AOL). Experimental results show significant enhancements model performance metrics at moderate SMOTE levels (30-36%),...
Intrusion detection systems (IDSs) are amongst the most important automated defense mechanisms in modern industry. It is guarding against many attack vectors, especially healthcare, where sensitive information (patient's medical history, prescriptions, electronic health records, bills/debts, and other data points) open to compromise from adversaries. In big era, classical machine learning has been applied train IDS. However, IDS tend be complex: either using several hidden layers susceptible...
The vehicle routing problem (VRP) is an NP-hard optimization that has been interest of research for decades in science and industry. objective to plan routes vehicles deliver goods a fixed number customers with optimal efficiency. Classical tools methods provide good approximations reach the global solution. Quantum computing quantum machine learning new approach solving combinatorial problems faster due inherent speedups effects. Many solutions VRP are offered across different platforms...
The famous Travelling Salesman Problem (TSP) is an important category of optimization problems that mostly encountered in various areas science and engineering. Studying motivates to develop advanced techniques more suited contemporary practical problems. Among those, especially the NP hard provide apt platform demonstrate supremacy quantum over classical technologies terms resources time. TSP one such problem combinatorial which takes exponential time order for solving by brute force...