Atul Kumar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Atul Kumar has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Parvinder Singh
Department of Computer Science and Technology, Central University of Punjab, Bathinda, India
9 shared publications - Satyabrata Adhikari
Indian Institute of Technology Rajasthan Jodhpur-11 India
6 shared publications - Satyabrata Adhikari
Institute of Physics Bhubaneswar-751005 India
4 shared publications Jyoti Faujdar
Indian Institute of Technology Jodhpur, Karwar, India
3 shared publicationsParvinder Singh
Central University of Punjab Bathinda India
3 shared publications- Sovik Roy
Department of Mathematics, Techno Main Salt Lake (Engg. Colg.), Techno India Group, EM 4/1, Sector V, Salt Lake, Kolkata 700091, India
3 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by IOP Publishing in New Journal of Physics
- Vol. 28 (1) , 014508
Heisenberg spin networks for realizing quantum battery with the aid of Dzyaloshinskii–Moriya interaction
This work investigates the energy storage properties of quantum spin chains in the context of quantum batteries (QBs) by introducing Heisenberg spin network models organized into different configurations: open, closed, supercube geometries, and c -regular graphs. The charging dynamics of these systems are examined using Hamiltonians that include contributions from the battery, spin-spin interactions, and a transverse magnetic field. Incorporating the Dzyaloshinskii–Moriya interaction (DMI) into the charging Hamiltonian is found to enhance the ergotropy in the XXZ model, particularly for the supercube configuration, thereby improving QB performance. To explore the role of structural variations, we extend our study to c -regular graphs with system sizes ranging from 3 to 12 qubits, including highly symmetric geometries such as the tetrahedron, octahedron, and icosahedron. These analyzes reveal that such symmetric structures retain ideal sinusoidal charging–discharging behavior when DMI is tuned appropriately, establishing symmetry and coordination as key principles for scalable QB architectures.
- 1 January 2026
- Published by IOP Publishing in New Journal of Physics
- Vol. 28 (1) , 014508
Open AccessHeisenberg spin networks for realizing quantum battery with the aid of Dzyaloshinskii–Moriya interaction
This work investigates the energy storage properties of quantum spin chains in the context of quantum batteries (QBs) by introducing Heisenberg spin network models organized into different configurations: open, closed, supercube geometries, and c -regular graphs. The charging dynamics of these systems are examined using Hamiltonians that include contributions from the battery, spin-spin interactions, and a transverse magnetic field. Incorporating the Dzyaloshinskii–Moriya interaction (DMI) into the charging Hamiltonian is found to enhance the ergotropy in the XXZ model, particularly for the supercube configuration, thereby improving QB performance. To explore the role of structural variations, we extend our study to c -regular graphs with system sizes ranging from 3 to 12 qubits, including highly symmetric geometries such as the tetrahedron, octahedron, and icosahedron. These analyzes reveal that such symmetric structures retain ideal sinusoidal charging–discharging behavior when DMI is tuned appropriately, establishing symmetry and coordination as key principles for scalable QB architectures.
- Open Access
Quantum neural networks facilitating quantum state classification
The classification of quantum states into distinct classes poses a significant challenge. In this study, we address this problem using quantum neural networks in combination with a problem-inspired circuit and customised as well as predefined ansätz. To facilitate the resource-efficient quantum state classification, we construct the dataset of quantum states using the proposed problem-inspired circuit. The problem-inspired circuit incorporates two-qubit parameterised unitary gates of varying entangling power, which is further integrated with the ansätz, developing an entire quantum neural network. To demonstrate the capability of the selected ansätz, we visualise the mitigated barren plateaus. The designed quantum neural network demonstrates the efficiency in binary and multi-class classification tasks. This work establishes a foundation for the classification of multi-qubit quantum states and offers the potential for generalisation to multi-qubit pure quantum states.
Open AccessQuantum neural networks facilitating quantum state classification
The classification of quantum states into distinct classes poses a significant challenge. In this study, we address this problem using quantum neural networks in combination with a problem-inspired circuit and customised as well as predefined ansätz. To facilitate the resource-efficient quantum state classification, we construct the dataset of quantum states using the proposed problem-inspired circuit. The problem-inspired circuit incorporates two-qubit parameterised unitary gates of varying entangling power, which is further integrated with the ansätz, developing an entire quantum neural network. To demonstrate the capability of the selected ansätz, we visualise the mitigated barren plateaus. The designed quantum neural network demonstrates the efficiency in binary and multi-class classification tasks. This work establishes a foundation for the classification of multi-qubit quantum states and offers the potential for generalisation to multi-qubit pure quantum states.
- 4 April 2025
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 7 (1) , 1-15
Harnessing quantum support vector machines for cross-domain classification of quantum states
- 4 April 2025
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 7 (1) , 1-15
Harnessing quantum support vector machines for cross-domain classification of quantum states
- 25 November 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (1) , 015036
Quantum-inspired attribute selection algorithms
In this study, we propose the use of quantum information gain (QIG) and fidelity as quantum splitting criteria to construct an efficient and balanced quantum decision tree. QIG is a circuit-based criterion in which angle embedding is used to construct a quantum state, which utilizes quantum mutual information to compute the information between a feature and the class attribute. For the fidelity-based criterion, we construct a quantum state using the occurrence of random events in a feature and its corresponding class. We use the constructed state to further compute fidelity for determining the splitting attribute among all features. Using numerical analysis, our results clearly demonstrate that the fidelity-based criterion ensures the construction of a balanced tree. We further compare the efficiency of our quantum information gain and fidelity-based quantum splitting criteria with different classical splitting criteria on balanced and imbalanced datasets. Our analysis shows that the quantum splitting criteria lead to quantum advantage in comparison to classical splitting criteria for different evaluation metrics.
- 25 November 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (1) , 015036
Quantum-inspired attribute selection algorithms
In this study, we propose the use of quantum information gain (QIG) and fidelity as quantum splitting criteria to construct an efficient and balanced quantum decision tree. QIG is a circuit-based criterion in which angle embedding is used to construct a quantum state, which utilizes quantum mutual information to compute the information between a feature and the class attribute. For the fidelity-based criterion, we construct a quantum state using the occurrence of random events in a feature and its corresponding class. We use the constructed state to further compute fidelity for determining the splitting attribute among all features. Using numerical analysis, our results clearly demonstrate that the fidelity-based criterion ensures the construction of a balanced tree. We further compare the efficiency of our quantum information gain and fidelity-based quantum splitting criteria with different classical splitting criteria on balanced and imbalanced datasets. Our analysis shows that the quantum splitting criteria lead to quantum advantage in comparison to classical splitting criteria for different evaluation metrics.
- Open Access
A Graph-Theoretical Framework to Analyse Zero Discord Quantum States
This article comprehensively explores matrices and their prerequisites for achieving positive semidefiniteness. The study delves into a series of theorems concerning pure quantum states in the context of weighted graphs. The main objective of this study is to establish a graph-theoretic framework for the study of quantum discord and to identify the necessary and sufficient conditions for zero quantum discord states using unitary operators. This research aims to advance the understanding of quantum discord and its implications for quantum information theory with a graph-theoretic framework.
Open AccessA Graph-Theoretical Framework to Analyse Zero Discord Quantum States
This article comprehensively explores matrices and their prerequisites for achieving positive semidefiniteness. The study delves into a series of theorems concerning pure quantum states in the context of weighted graphs. The main objective of this study is to establish a graph-theoretic framework for the study of quantum discord and to identify the necessary and sufficient conditions for zero quantum discord states using unitary operators. This research aims to advance the understanding of quantum discord and its implications for quantum information theory with a graph-theoretic framework.
- Open Access
Separability of Graph Laplacian Quantum States: Utilizing Unitary Operators, Neighbourhood Sets and Equivalence Relation
This article delves into an analysis of the intrinsic entanglement and separability feature in quantum states as depicted by graph Laplacian. We show that the presence or absence of edges in the graph plays a pivotal role in defining the entanglement or separability of these states. We propose a set of criteria for ascertaining the separability of quantum states comprising $n$-qubit within a composite Hilbert space, indicated as $H=H_1 \otimes H_2 \otimes \dots \otimes H_n$. This determination is achieved through a combination of unitary operators, neighbourhood sets, and equivalence relations.Open AccessSeparability of Graph Laplacian Quantum States: Utilizing Unitary Operators, Neighbourhood Sets and Equivalence Relation
This article delves into an analysis of the intrinsic entanglement and separability feature in quantum states as depicted by graph Laplacian. We show that the presence or absence of edges in the graph plays a pivotal role in defining the entanglement or separability of these states. We propose a set of criteria for ascertaining the separability of quantum states comprising $n$-qubit within a composite Hilbert space, indicated as $H=H_1 \otimes H_2 \otimes \dots \otimes H_n$. This determination is achieved through a combination of unitary operators, neighbourhood sets, and equivalence relations. - Open Access
Quantum-inspired attribute selection algorithm: A Fidelity-based Quantum Decision Tree
A classical decision tree is completely based on splitting measures, which utilize the occurrence of random events in correspondence to its class labels in order to optimally segregate datasets. However, the splitting measures are based on greedy strategy, which leads to construction of an imbalanced tree and hence decreases the prediction accuracy of the classical decision tree algorithm. An intriguing approach is to utilize the foundational aspects of quantum computing for enhancing decision tree algorithm. Therefore, in this work, we propose to use fidelity as a quantum splitting criterion to construct an efficient and balanced quantum decision tree. For this, we construct a quantum state using the occurrence of random events in a feature and its corresponding class. The quantum state is further utilized to compute fidelity for determining the splitting attribute among all features. Using numerical analysis, our results clearly demonstrate that the proposed algorithm cooperatively ensures the construction of a balanced tree. We further compared the efficiency of our proposed quantum splitting criterion to different classical splitting criteria on balanced and imbalanced datasets. Our simulation results show that the proposed splitting criterion exceeds all classical splitting criteria for all possible evaluation metrics.
Open AccessQuantum-inspired attribute selection algorithm: A Fidelity-based Quantum Decision Tree
A classical decision tree is completely based on splitting measures, which utilize the occurrence of random events in correspondence to its class labels in order to optimally segregate datasets. However, the splitting measures are based on greedy strategy, which leads to construction of an imbalanced tree and hence decreases the prediction accuracy of the classical decision tree algorithm. An intriguing approach is to utilize the foundational aspects of quantum computing for enhancing decision tree algorithm. Therefore, in this work, we propose to use fidelity as a quantum splitting criterion to construct an efficient and balanced quantum decision tree. For this, we construct a quantum state using the occurrence of random events in a feature and its corresponding class. The quantum state is further utilized to compute fidelity for determining the splitting attribute among all features. Using numerical analysis, our results clearly demonstrate that the proposed algorithm cooperatively ensures the construction of a balanced tree. We further compared the efficiency of our proposed quantum splitting criterion to different classical splitting criteria on balanced and imbalanced datasets. Our simulation results show that the proposed splitting criterion exceeds all classical splitting criteria for all possible evaluation metrics.
- Open Access
- 17 June 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-15
Investigating the role of Kinesin family in lung adenocarcinoma via integrated bioinformatics approach
Lung cancer is the leading cause of mortality from cancer worldwide. Lung adenocarcinoma (LUAD) is a type of non-small cell lung cancer (NSCLC) with highest prevalence. Kinesins a class of motor proteins are shown to be involved in carcinogenesis. We conducted expression, stage plot and survival analyses on kinesin superfamily (KIF) and scrutinized the key prognostic kinesins. Genomic alterations of these kinesins were studied thereafter via cBioPortal. A protein–protein interaction network (PPIN) of selected kinesins and 50 closest altering genes was constructed followed by gene ontology (GO) term and pathway enrichment analyses. Multivariate survival analysis based on CpG methylation of selected kinesins was performed. Lastly, we conducted tumor immune infiltration analysis. Our results found KIF11/15/18B/20A/2C/4A/C1 to be significantly upregulated and correlated with poor survival in LUAD patients. These genes also showed to be highly associated with cell cycle. Out of our seven selected kinesins, KIFC1 showed the highest genomic alteration with highest number of CpG methylation. Also, CpG island (CGI) cg24827036 was discovered to be linked to LUAD prognosis. Therefore, we deduced that reducing the expression of KIFC1 could be a feasible treatment strategy and that it can be a wonderful individual prognostic biomarker. CGI cg24827036 can also be used as a therapy site in addition to being a great prognostic biomarker.
- 17 June 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-15
Open AccessInvestigating the role of Kinesin family in lung adenocarcinoma via integrated bioinformatics approach
Lung cancer is the leading cause of mortality from cancer worldwide. Lung adenocarcinoma (LUAD) is a type of non-small cell lung cancer (NSCLC) with highest prevalence. Kinesins a class of motor proteins are shown to be involved in carcinogenesis. We conducted expression, stage plot and survival analyses on kinesin superfamily (KIF) and scrutinized the key prognostic kinesins. Genomic alterations of these kinesins were studied thereafter via cBioPortal. A protein–protein interaction network (PPIN) of selected kinesins and 50 closest altering genes was constructed followed by gene ontology (GO) term and pathway enrichment analyses. Multivariate survival analysis based on CpG methylation of selected kinesins was performed. Lastly, we conducted tumor immune infiltration analysis. Our results found KIF11/15/18B/20A/2C/4A/C1 to be significantly upregulated and correlated with poor survival in LUAD patients. These genes also showed to be highly associated with cell cycle. Out of our seven selected kinesins, KIFC1 showed the highest genomic alteration with highest number of CpG methylation. Also, CpG island (CGI) cg24827036 was discovered to be linked to LUAD prognosis. Therefore, we deduced that reducing the expression of KIFC1 could be a feasible treatment strategy and that it can be a wonderful individual prognostic biomarker. CGI cg24827036 can also be used as a therapy site in addition to being a great prognostic biomarker.
- Open Access
The role of entanglement for enhancing the efficiency of quantum kernels towards classification
Quantum kernels are considered as potential resources to illustrate benefits of quantum computing in machine learning. Considering the impact of hyperparameters on the performance of a classical machine learning model, it is imperative to identify promising hyperparameters using quantum kernel methods in order to achieve quantum advantages. In this work, we analyse and classify sentiments of textual data using a new quantum kernel based on linear and full entangled circuits as hyperparameters for controlling the correlation among words. We also find that the use of linear and full entanglement further controls the expressivity of the Quantum Support Vector Machine (QSVM). In addition, we also compare the efficiency of the proposed circuit with other quantum circuits and classical machine learning algorithms. Our results show that the proposed fully entangled circuit outperforms all other fully or linearly entangled circuits in addition to classical algorithms for most of the features. In fact, as the feature increases the efficiency of our proposed fully entangled model also increases significantly.
Open AccessThe role of entanglement for enhancing the efficiency of quantum kernels towards classification
Quantum kernels are considered as potential resources to illustrate benefits of quantum computing in machine learning. Considering the impact of hyperparameters on the performance of a classical machine learning model, it is imperative to identify promising hyperparameters using quantum kernel methods in order to achieve quantum advantages. In this work, we analyse and classify sentiments of textual data using a new quantum kernel based on linear and full entangled circuits as hyperparameters for controlling the correlation among words. We also find that the use of linear and full entanglement further controls the expressivity of the Quantum Support Vector Machine (QSVM). In addition, we also compare the efficiency of the proposed circuit with other quantum circuits and classical machine learning algorithms. Our results show that the proposed fully entangled circuit outperforms all other fully or linearly entangled circuits in addition to classical algorithms for most of the features. In fact, as the feature increases the efficiency of our proposed fully entangled model also increases significantly.
- 8 September 2022
- Published by Springer Nature in Quantum Studies: Mathematics and Foundations
- Vol. 10 (1) , 27-40
Nonlocality and efficiency of three-qubit partially entangled states
- 8 September 2022
- Published by Springer Nature in Quantum Studies: Mathematics and Foundations
- Vol. 10 (1) , 27-40
Nonlocality and efficiency of three-qubit partially entangled states